Skip to content


Subversion checkout URL

You can clone with
Download ZIP
branch: master
Fetching contributors…

Cannot retrieve contributors at this time

48 lines (34 sloc) 1.379 kB
%%%% why-RSA-works/references.tex
%%%% Copyright 2012 Peter Franusic.
%%%% All rights reserved.
R. L. Rivest, A. Shamir, and L. Adleman.
A method for obtaining digital signatures and public-key cryptosystems.
\emph{Communications of the ACM}, 21(2):120-126.
Andreas de Vries. The ray attack, an inefficient trial to break RSA cryptosystems.
FH S\"udwestfalen University of Applied Sciences, Haldener StraBe 182, D-58095 Hagen, 2003.
Ring (mathematics). \emph{Wikipedia}, \verb$$.
\c Cetin Kaya Ko\c c. High-speed RSA implementation. RSA Labs, 1994.
Bruce Schneier. \emph{Applied Cryptography}. John Wiley \& Sons, 1994.
A. Menezes, P. van Oorschot, and S. Vanstone.
\emph{Handbook of Applied Cryptography}. CRC Press, 1996.
PKCS \#1 v2.1: RSA cryptography standard. RSA Labs, 2002.
Peter W. Shor,
``Polynomial-Time Algorithms for Prime Factorization and
Discrete Logarithms on a Quantum Computer,'' 1996.
Thorsten Kleinjung et al.
Factorization of a 768-bit RSA modulus.
Version 1.4, February 18, 2010.
Ronald L. Rivest and Burt Kaliski. RSA problem. RSA Labs, 2003.
Jump to Line
Something went wrong with that request. Please try again.