A new public-key cryptosystem as secure as factoring
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 308-318
- https://doi.org/10.1007/bfb0054135
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A public-key cryptosystem with worst-case/average-case equivalencePublished by Association for Computing Machinery (ACM) ,1997
- The discrete logarithm modulo a composite hides 0(n) BitsJournal of Computer and System Sciences, 1993
- A cubic RSA code equivalent to factorizationJournal of Cryptology, 1992
- Non-malleable cryptographyPublished by Association for Computing Machinery (ACM) ,1991
- PUBLIC KEY CRYPTOSYSTEM USING A RECIPROCAL NUMBER WITH THE SAME INTRACTABILITY AS FACTORING A LARGE NUMBERCryptologia, 1988
- RSA and Rabin Functions: Certain Parts are as Hard as the WholeSIAM Journal on Computing, 1988
- Elliptic Curve CryptosystemsMathematics of Computation, 1987
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- Hiding information and signatures in trapdoor knapsacksIEEE Transactions on Information Theory, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976