This RSA algorithm webpage was initiated after the last lecture in the
Algebra course given by me in the Centre for Mathematical Sciences, Engeneering Faculty (LTH) , Lund University.
More staff on RSA algorithm is added continuously.
So bookmark, link and visit this page often!
Contact me for any ideas and cooperation or joint project proposals on RSA or other cryptography related topics
Sergei Silvestrov,
Matematikcentrum, Matematik LTH, rum MH562B, tel.
046-2228854 E-post: ssilvest@maths.lth.se
Do you want to know what is RSA? If yes, then visit:
Classic RSA algorithm. Algebra step by step (from my last lecture in Algebra course)
English Wikipedia article on RSA
Russian Wikipedia article on RSA
Swedish Wikipedia article on RSA
Extract from the English Wikipedia article on RSA:
In
cryptography,
RSA (which stands
for
Rivest,
Shamir and
Adleman who first
publicly described it) is an algorithm for
public-key cryptography. It is the first
algorithm known to be suitable for
signing as well as encryption, and was one of
the first great advances in public key cryptography. RSA is widely used in
electronic commerce protocols, and is
believed to be secure given sufficiently long keys and the use of up-to-date
implementations. ..........
Interesting links on RSA including also some simulation tools!
- The Original RSA Patent as filed with the U.S. Patent Office by Rivest;
Ronald L. (Belmont, MA), Shamir; Adi (Cambridge, MA), Adleman; Leonard M.
(Arlington, MA), December 14, 1977, U.S. Patent
4,405,829.
- PKCS #1:
RSA Cryptography Standard (RSA Laboratories website)
- Thorough walk through of RSA
- Prime
Number Hide-And-Seek: How the RSA Cipher Works
- Menezes, Oorschot, Vanstone, Scott: Handbook of Applied
Cryptography (free PDF downloads), see Chapter 8
- Onur Aciicmez, Cetin Kaya Koc, Jean-Pierre Seifert: On the Power
of Simple Branch Prediction Analysis
- A New Vulnerability In RSA Cryptography, CAcert NEWS Blog
- Example of an RSA implementation with PKCS#1 padding (GPL source
code)
- Kocher's article about timing attacks
- Online RSA encryption application (Dutch)
- An
animated explanation of RSA with its mathematical background by CrypTool
Some Notes on RSA and more ....
- Rivest, R.; A. Shamir; L. Adleman (1978). "A Method for Obtaining Digital Signatures and Public-Key
Cryptosystems". Communications of the ACM 21 (2): 120–126. doi:10.1145/359340.359342. http://theory.lcs.mit.edu/~rivest/rsapaper.pdf.
- SIAM News, Volume 36, Number 5, June 2003, "Still Guarding
Secrets after Years of Attacks, RSA Earns Accolades for its Founders", by Sara
Robinson
- http://www.rsa.com/press_release.aspx?id=261
- Boneh, Dan (1999). "Twenty Years of attacks on the RSA Cryptosystem". Notices
of the American Mathematical Society (AMS) 46 (2): 203–213. http://crypto.stanford.edu/~dabo/abstracts/RSAattack-survey.html.
- Johan Håstad, "On using
RSA with Low Exponent in a Public Key Network", Crypto 85
- Don Coppersmith, "Small
Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities",
Journal of Cryptology, v. 10, n. 4, Dec. 1997
- Key Encapsulation: A New Scheme for Public-Key Encryption, XML
Security Working Group F2F, May 2009
- http://www.di-mgt.com.au/rsa_alg.html#weaknesses
- 518-bit
GNFS with msieve
- Has the RSA
algorithm been compromised as a result of Bernstein's Paper? What key size
should I be using?
- Wiener, Michael J. (May 1990). "Cryptanalysis of short
RSA secret exponents". Information Theory, IEEE Transactions on 36
(3): 553–558. doi:10.1109/18.54902.
- http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.80.1438&rep=rep1&type=pdf
- FaultBased Attack of RSA Authentication
More references
- Menezes, Alfred; Paul C. van Oorschot; Scott A.
Vanstone (October 1996). Handbook of Applied Cryptography. CRC Press. ISBN 0-8493-8523-7.
- Cormen, Thomas H.; Charles E. Leiserson; Ronald L. Rivest; Clifford Stein (2001). Introduction to Algorithms (2e
ed.). MIT Press and McGraw-Hill. pp. 881–887. ISBN 0-262-03293-7.
- Венбо Мао Современная криптография. Теория и
практика = Modern Cryptography: Theory and Practice. — М.:
Вильямс, 2005. — 768 с. — 2 000 экз. —
ISBN
5-8459-0847-7, ISBN
0-13-066943-1
- Нильс
Фергюсон, Брюс
Шнайер Практическая криптография = Practical Cryptography: Designing and
Implementing Secure Cryptographic Systems. — М.:
«Диалектика»,
2004. — 432 с. — 3 000 экз. — ISBN
5-8459-0733-0, ISBN
0-4712-2357-3
- Шнайер
Б. Прикладная криптография. Протоколы, алгоритмы, исходные тексты на
языке Си = Applied Cryptography. Protocols, Algorithms and Source Code in C.
— М.: Триумф,
2002. — 816 с. — 3000 экз. — ISBN
5-89392-055-4