Mathematical Hard Problems in Modern Public-Key Cryptosystem

In secure network communication public-key algorithms are designed to resist chosen-plaintext attacks; their security is based both on the difficulty of deducing the secret key from the public key and difficulty of deducing the plaintext from the ciphertext. In this paper the two general types of ha...

Full description

Saved in:
Bibliographic Details
Main Authors: Saeed, Q., Basir, T., Ul Haq, S., Zia, N., Paracha, M.A.
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Computer science
Computer security
Digital signatures
Elliptic curve cryptography
Elliptic curves
Polynomials
Public key
Public key cryptography
Resists
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In secure network communication public-key algorithms are designed to resist chosen-plaintext attacks; their security is based both on the difficulty of deducing the secret key from the public key and difficulty of deducing the plaintext from the ciphertext. In this paper the two general types of hard problems - number factoring and discrete logarithms are explained. These apply to cryptosystems such as RSA, ElGamal, elliptic curve, Diffie-Hellman key exchange, and they are used in digital signature algorithms
DOI:10.1109/ICET.2006.335986