Public-Key Encryption

2017 ◽  
Author(s):  
Keith M. Martin
Keyword(s):  
Elliptic Curve ◽  
Public Key Cryptography ◽  
Public Key ◽  
Public Key Encryption ◽  
Hybrid Encryption ◽  
Public Key Cryptosystems ◽  
Encryption And Decryption ◽  
Encryption Schemes ◽  
Hard Problems ◽  
Set Up

In this chapter, we introduce public-key encryption. We first consider the motivation behind the concept of public-key cryptography and introduce the hard problems on which popular public-key encryption schemes are based. We then discuss two of the best-known public-key cryptosystems, RSA and ElGamal. For each of these public-key cryptosystems, we discuss how to set up key pairs and perform basic encryption and decryption. We also identify the basis for security for each of these cryptosystems. We then compare RSA, ElGamal, and elliptic-curve variants of ElGamal from the perspectives of performance and security. Finally, we look at how public-key encryption is used in practice, focusing on the popular use of hybrid encryption.

An applications of signed quadratic residues in public key cryptography

2018 ◽  
Vol 10 (06) ◽  
pp. 1850081
Author(s):  
Pinkimani Goswami ◽  
Madan Mohan Singh
Keyword(s):  
Public Key Cryptography ◽  
Public Key ◽  
Public Key Encryption ◽  
Quadratic Residues ◽  
Encryption Schemes

At Eurocrypt ’02, Cramer and Shoup introduced the idea of public key encryption schemes with double decryption mechanism (DD-PKE) and at Asiacrypt ’03, Bresson, Catalano and Pointcheval revisited the notion of DD-PKE. They proposed the first DD-PKE scheme (called BCP cryptosystem) over the group of quadratic residues. In this paper, we point out an attack against BCP cryptosystem and propose a secure variant constructed over the group of signed quadratic residues (SQR).

scholarly journals Twisted Edwards Elliptic Curves for Zero-Knowledge Circuits

Mathematics ◽  
2021 ◽  
Vol 9 (23) ◽  
pp. 3022
Author(s):  
Marta Bellés-Muñoz ◽  
Barry Whitehat ◽  
Jordi Baylina ◽  
Vanesa Daza ◽  
Jose Luis Muñoz-Tapia
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curves ◽  
Elliptic Curve Cryptography ◽  
Public Key Cryptography ◽  
Deterministic Algorithm ◽  
Public Key ◽  
Security Attacks ◽  
Zero Knowledge ◽  
Prime Field ◽  
Encryption Schemes

Circuit-based zero-knowledge proofs have arose as a solution to the implementation of privacy in blockchain applications, and to current scalability problems that blockchains suffer from. The most efficient circuit-based zero-knowledge proofs use a pairing-friendly elliptic curve to generate and validate proofs. In particular, the circuits are built connecting wires that carry elements from a large prime field, whose order is determined by the number of elements of the pairing-friendly elliptic curve. In this context, it is important to generate an inner curve using this field, because it allows to create circuits that can verify public-key cryptography primitives, such as digital signatures and encryption schemes. To this purpose, in this article, we present a deterministic algorithm for generating twisted Edwards elliptic curves defined over a given prime field. We also provide an algorithm for checking the resilience of this type of curve against most common security attacks. Additionally, we use our algorithms to generate Baby Jubjub, a curve that can be used to implement elliptic-curve cryptography in circuits that can be validated in the Ethereum blockchain.

scholarly journals Sieve Method for Polynomial Linear Equivalence

2013 ◽  
Vol 2013 ◽  
pp. 1-8
Author(s):  
Baocang Wang ◽  
Yupu Hu
Keyword(s):  
Finite Field ◽  
Linear Transformation ◽  
Public Key Cryptography ◽  
Public Key ◽  
Public Key Encryption ◽  
Sieve Method ◽  
Polynomial Maps ◽  
Algebraic Properties ◽  
Encryption Schemes ◽  
Multivariate Public Key

We consider the polynomial linear equivalence (PLE) problem arising from the multivariate public key cryptography, which is defined as to find an invertible linear transformationℒsatisfying𝒫=𝒮∘ℒfor given nonlinear polynomial maps𝒫and𝒮over a finite field𝔽q. Some cryptographic and algebraic properties of PLE are discussed, and from the properties we derive three sieves called multiplicative, differential, and additive sieves. By combining the three sieves, we propose a sieve method for the PLE problem. As an application of our sieve method, we show that it is infeasible to construct public key encryption schemes from the PLE problem.

scholarly journals Cryptography in Terms of Triangular Neutrosophic Numbers with Real Life Applications

2020 ◽  
pp. 39-52
Author(s):  
admin admin ◽  
◽  
◽  
◽  
◽  
...  
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Information Transfer ◽  
Real Life ◽  
Public Key Cryptography ◽  
Public Key ◽  
Encryption And Decryption ◽  
Basic Concepts ◽  
Triangular Neutrosophic Numbers

In this article, our main focus is to put forward the concept of Cryptography in terms of triangular neutrosophic numbers. This kind of cryptography is really reliable, manual, secure, and based on few simple steps. All the encryption and decryption are easy to proceed (mention below). As we know, Public-key cryptography as an indefatigable defender for human privacy and use as information transfer from the ages. various concepts are available with regard to cryptography e.g. Elliptic curve cryptography. TNNC (Triangular neutrosophic numbers cryptography) is familiar with basic concepts of math as well as applicable in different situations e.g. code cryptography, detailed view cryptography, and Graph cryptography encryption facilitate.

IMPLEMENTASI ALGORITMA SCHMIDT-SAMOA PADA ENKRIPSI DEKRIPSI EMAIL BERBASIS ANDROID

2013 ◽  
Vol 9 (1) ◽  
Author(s):  
Willy Ristanto ◽  
Willy Sudiarto Raharjo ◽  
Antonius Rachmat Chrismanto
Keyword(s):  
Public Key Cryptography ◽  
Text Messages ◽  
Public Key ◽  
Client Application ◽  
Performance Measurements ◽  
Encryption And Decryption ◽  
Number Variation

Cryptography is a technique for sending secret messages. This research builds an Android-based email client application which implement cryptography with Schmidt-Samoa algorithm, which is classified as a public key cryptography. The algorithm performs encryption and decryption based on exponential and modulus operation on text messages. The application use 512 and 1024 bit keys. Performance measurements is done using text messages with character number variation of 5 – 10.000 characters to obtain the time used for encryption and decryption process. As a result of this research, 99,074% data show that decryption process is faster than encryption process. In 512 bit keys, the system can perform encryption process in 520 - 18.256 miliseconds, and decryption process in 487 - 5.688 miliseconds. In 1024 bit keys, system can perform encryption process in 5626 – 52,142 miliseconds (7.388 times slower than 512 bit keys) and decryption process with time 5463 – 15,808 miliseconds or 8.290 times slower than 512 bit keys.

scholarly journals Survey on Asymmetric Key Cryptographic Algorithms

2020 ◽  
pp. 404-408
Author(s):  
Sabitha S ◽  
Binitha V Nair
Keyword(s):  
Public Key Cryptography ◽  
Public Key ◽  
The Public ◽  
Private Key ◽  
Design And Implementation ◽  
Diffie Hellman ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Symmetric Key ◽  
Symmetric Key Cryptography

Cryptography is an essential and effective method for securing information’s and data. Several symmetric and asymmetric key cryptographic algorithms are used for securing the data. Symmetric key cryptography uses the same key for both encryption and decryption. Asymmetric Key Cryptography also known as public key cryptography uses two different keys – a public key and a private key. The public key is used for encryption and the private key is used for decryption. In this paper, certain asymmetric key algorithms such as RSA, Rabin, Diffie-Hellman, ElGamal and Elliptical curve cryptosystem, their security aspects and the processes involved in design and implementation of these algorithms are examined.

Sign in / Sign up

Export Citation Format

Share Document