论文信息 - Foundations of Asymmetric Cryptography

Foundations of Asymmetric Cryptography

This chapter presents asymmetric key cryptography, also known as public-key cryptography. It introduces the first asymmetric algorithm, invented by Diffie and Hellman, as well as the ElGamal algorithm. Moreover, we describe in detail a very well-known example of an asymmetric cryptosystem called RSA.

[1] Emmanuel Bresson,et al. The Group Diffie-Hellman Problems , 2002, Selected Areas in Cryptography.

[2] Richard E. Crandall,et al. Subexponential Factoring Algorithms , 2001 .

[3] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .

[4] Whitfield Diffie,et al. New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[5] Andrew M. Odlyzko,et al. Discrete Logarithms: The Past and the Future , 2000, Des. Codes Cryptogr..

[6] C. Pomerance,et al. Prime Numbers: A Computational Perspective , 2002 .

[7] Dan Boneh,et al. Breaking Generalized Diffie-Hellmann Modulo a Composite is no Easier Than Factoring , 1999, Information Processing Letters.