scientific article; zbMATH DE number 2066371

MaRDI QIDQ4462809zbMATH OpenFDO

Authors Ashwani K. Bhandari

Publication date 18 May 2004

zbMATH Keywords

cryptographydecipheringdigital signatureselliptic curvemessage authenticationRSA systemtrapdoor one way functions

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Review text

This presentation appears to be the contents of a general lecture on `public key cryptography'. It includes many aspects of various kinds of cryptosystems. It covers the RSA cryptosystem, discrete logarithms in finite fields, the Diffie-Hellman key exchange scheme, the Massey-Omura cryptosystem and the ElGamal cryptosystem based on the discrete logarithm problem, the Silver-Pohlig-Hellman algorithm, and knapsack cryptosystems. The presentation is nice as the theory has been supplemented with a good number of examples to make the text clear and many remarks which may help any reader to distinguish between various cryptosystems. For the entire collection see [Zbl 1022.00013].

Recommendations

• An introduction to public-key cryptography
• scientific article; zbMATH DE number 49145
• scientific article; zbMATH DE number 857030
• scientific article; zbMATH DE number 707175
• scientific article; zbMATH DE number 2231488

Cited in

(6)

• Computational Number Theory and Cryptography
• scientific article; zbMATH DE number 5005844 (Why is no real title available?)
• Public Key Cryptography
• The GH public-key cryptosystem
• scientific article; zbMATH DE number 857030 (Why is no real title available?)
• The Complexity of Public-Key Cryptography

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4462809)