The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
Top Cited Papers
- 5 June 2001
- book chapter
- Published by Springer Nature
- p. 104-118
- https://doi.org/10.1007/3-540-44586-2_8
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystemsIEEE Transactions on Information Theory, 1999
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of CurvesMathematics of Computation, 1994
- Discrete Logarithms in $GF ( P )$ Using the Number Field SieveSIAM Journal on Discrete Mathematics, 1993
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- RSA and Rabin Functions: Certain Parts are as Hard as the WholeSIAM Journal on Computing, 1988
- Elliptic Curve CryptosystemsMathematics of Computation, 1987
- Elliptic curve cryptosystemsMathematics of Computation, 1987
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976