Public Key Cryptography

  title={Public Key Cryptography},
  author={Jennifer Seberry},
  booktitle={Lecture Notes in Computer Science},
  • J. Seberry
  • Published in
    Lecture Notes in Computer…
  • Computer Science, Mathematics
We are going to devote most of our attention in this talk to the RSA Public Key Cryptosystem because it not only remains unbroken but it has some other useful features for digital signatures and authentication. We will briefly mention some other methods which have been compromised to some degree, and one, McEliece's which has not, but which are still valid when both keys are kept secret and some have other features which may be useful. Disciplines Physical Sciences and Mathematics Publication… 


This proposal is the only factorization equivalent scheme that is known which does not impose any restrictions on the primes used in the modulus and uses properties of the Lucas functions to do so.


DNA steganography is explained as an innovative paradigm to diminish the usage of public cryptography to exchange session key, and session key between a sender and receiver is hidden by novel DNA data hiding technique, so the attackers are not aware of transmission of session key through unsecure channel.

Text Encryption: Hybrid cryptographic method using Vigenere and Hill Ciphers.

A hybridization of Vigenere and Hill encryption that belongs to this family is presented, which will provide a reliable hybrid algorithm, resistant to varying attacks, including statistical attacks.

Quantum Encrypted Data Transfers in GRID

It is apparent that given adequate key distribution protection AES cannot be broken – at least not in the next 1017 years (for 1 key), and the secret key carrier needs to be a stable long-term committed technology, that would not come under question any time soon.

A hybrid RSA-DH cipher for Signed Encrypted Messages

This work proposes the design of a hybrid RSA-DH algorithm which signed encrypted messages are shared and shows negligible differences in the relative performance of the hybrid and ordinary versions, even when the hybrid version combines the processes of two algorithms.

Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem

statistical zero-knowledge protocols for statements of the form “plaintext m corresponds to ciphertext c” and “ciphertext c and c' decrypt to the same value” for the Ajtai-Dwork cryptosystem are shown.

Steganography with Cryptography Technique For Data Hiding

Three encrypt techniques like RSA algorithm along with steganographic algorithm like LSB substitution technique are implemented to secure the data while transmitting in the network.

Equivalent keys in ℳultivariate uadratic public key systems

This article shows that for all basic classes mentioned above, it is possible to reduce the private – and hence the public – key space by several orders of magnitude, i.e. the size of the set of possible private and hence public keys can be reduced.

The Design of a New Symmetric Key Cryptographic Algorithm - RLR

The design principles and the algorithmic steps of the RLR algorithm are discussed and it is said that this algorithm can be generalized to obtain computational complexity of 2 where n is the block size.

OTP Camouflaging using LSB Steganography and Public Key Cryptography

As the proposed algorithm is a combination of both Cryptography and Steganography it meets all the challenges very efficiently and it is impossible to crack the original data from the cover media.



A method for obtaining digital signatures and public-key cryptosystems

An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key, soriers or other secure means are not needed to transmit keys.

On Diffie-Hellman Key Agreement with Short Exponents

A new divide-and-conquer algorithm for discrete logarithms is presented, combining Pollard's lambda method with a partial Pohlig-Hellman decomposition, which allows recovery of short exponents in many cases, while the new technique dramatically extends the range.

Rabin and RSA analogues based on non-maximal imaginary quadratic orders

It will be shown that breaking the Rabin analogue is as hard as factoring just like the original scheme in ZZ nZZ.

Meta-ElGamal signature schemes

This paper integrates all these approaches in a Meta-ElGamal signature scheme, and obtains in the authors' example settings numerous variants of the ElGamal scheme, from which it can extract new, highly efficient signature schemes, which haven't been proposed before.

How to share a secret

  • A. Shamir
  • Computer Science, Mathematics
  • 1979
This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.

Cryptography - an introduction to computer security

Efficient Identification and Signatures for Smart Cards

We present an efficient interactive identification scheme and a related signature scheme that are based on discrete logarithms and which are particularly suited for smart cards. Previous

The Discrete Logarithm Problem on Elliptic Curves of Trace One

  • N. Smart
  • Mathematics, Computer Science
    Journal of Cryptology
  • 1999
An elementary technique is described which leads to a linear algorithm for solving the discrete logarithm problem on elliptic curves of trace one and this means that when choosing elliptic curve to use in cryptography one has to eliminate all curves whose group orders are equal to the order of the finite field.

Improved digital signature scheme based on discrete exponentiation

A method of generating and verifying a digital signature is examined. The scheme is tested using a microprocessor and demonstrates fast signature generation.

Rueppel, message recovery for signature schemes based on the dis- crete logarithm problem, Eurocrypto’94

  • 1994