Timing Attack against Protected RSA-CRT Implementation Used in PolarSSL
暂无分享,去创建一个
[1] C. D. Walter,et al. Montgomery exponentiation needs no final subtractions , 1999 .
[2] Colin D. Walter. Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli , 2002, CT-RSA.
[3] Werner Schindler,et al. A Timing Attack against RSA with the Chinese Remainder Theorem , 2000, CHES.
[4] David Brumley,et al. Remote timing attacks are practical , 2003, Comput. Networks.
[5] Onur Aciiçmez,et al. Improving Brumley and Boneh timing attack on unprotected SSL implementations , 2005, CCS '05.
[6] Christof Paar,et al. Cryptographic Hardware and Embedded Systems - CHES 2006, 8th International Workshop, Yokohama, Japan, October 10-13, 2006, Proceedings , 2006, CHES.
[7] P. L. Montgomery. Modular multiplication without trial division , 1985 .
[8] Colin Boyd,et al. Cryptography and Coding , 1995, Lecture Notes in Computer Science.
[9] Werner Schindler,et al. More Detail for a Combined Timing and Power Attack against Implementations of RSA , 2003, IMACC.
[10] Bart Preneel,et al. Topics in Cryptology — CT-RSA 2002 , 2002, Lecture Notes in Computer Science.
[11] Don Coppersmith,et al. Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities , 1997, Journal of Cryptology.