Design and implementation of high-speed algorithms for public-key cryptosystems
作者： George Joseph
DOI:
关键词:
摘要:
up.ac.za参考文章(68)
Cetin K. Koc, Tolga Acar, Alan Wallace, High-speed algorithms and architectures for number-theoretic cryptosystems Oregon State University. ,(1998)
William Stallings, Cryptography and network security ,(1998)
Hirosuke Yamamoto, Noboru Kunihiro, New Methods for Generating Short Addition Chains IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. ,vol. 83, pp. 60- 67 ,(2000)
Paul C. van Oorschot, Michael J. Wiener, On diffie-hellman key agreement with short exponents theory and application of cryptographic techniques. pp. 332- 343 ,(1996) , 10.1007/3-540-68339-9_29
Henri Cohen, A Course in Computational Algebraic Number Theory ,(1993)
Chung-Huang Yang, Hikaru Morita, 楊中皇, A Modular-Multiplication Algorithm using Lookahead Determination IEICE Trans. Fundamentals / E76-A. ,(1993)
Paul Barrett, Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor international cryptology conference. pp. 311- 323 ,(1987) , 10.1007/3-540-47721-7_24
Neal Koblitz, A Course in Number Theory and Cryptography ,(1987)
Christian P. Waldvogel, James L. Massey, The Probability Distribution of the Diffie-Hellman Key theory and application of cryptographic techniques. pp. 492- 504 ,(1992) , 10.1007/3-540-57220-1_87
Rainer A. Rueppel, Key agreements based on function composition theory and application of cryptographic techniques. pp. 3- 10 ,(1988) , 10.1007/3-540-45961-8_1