Breaking RSA may not be equivalent to factoring
- 1 January 1998
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete LogarithmsPublished by Springer Nature ,2001
- Algorithms for Black-Box Fields and their Application to CryptographyPublished by Springer Nature ,1996
- Diffie-Hellman OraclesPublished by Springer Nature ,1996
- Finding a Small Root of a Univariate Modular EquationPublished by Springer Nature ,1996
- Algorithms in Number TheoryPublished by Elsevier ,1990
- Solving Simultaneous Modular Equations of Low DegreeSIAM Journal on Computing, 1988
- Factoring Integers with Elliptic CurvesAnnals of Mathematics, 1987
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976