Mathematical Hard Problems in Modern Public-Key Cryptosystem

Author

Saeed, Qamar ; Basir, Tariq ; Haq, Saeed Ul ; Zia, Nadia ; Paracha, Mushtaq A.

Author_Institution

Sch. of Comput. Sci., Windsor Univ., Ont.

fYear

2006

fDate

13-14 Nov. 2006

Firstpage

456

Lastpage

460

Abstract

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

Keywords

public key cryptography; Diffie-Hellman key exchange; chosen-plaintext attacks; ciphertext; digital signature algorithms; discrete logarithms; elliptic curve; mathematical hard problems; modern public-key cryptosystem; number factoring; Algorithm design and analysis; Computer science; Computer security; Digital signatures; Elliptic curve cryptography; Elliptic curves; Polynomials; Public key; Public key cryptography; Resists;

fLanguage

English

Publisher

ieee

Conference_Titel

Emerging Technologies, 2006. ICET '06. International Conference on

Conference_Location

Peshawar

Print_ISBN

1-4244-0502-5

Electronic_ISBN

1-4244-0503-3

Type

conf

DOI

10.1109/ICET.2006.335986

Filename

4136953

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2098550