A key recovery attack on discrete log-based schemes using a prime order subgroup
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 249-263
- https://doi.org/10.1007/bfb0052240
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Generating EIGamal Signatures Without Knowing the Secret KeyLecture Notes in Computer Science, 1996
- Breaking and repairing a convertible undeniable signature schemePublished by Association for Computing Machinery (ACM) ,1996
- Several practical protocols for authentication and key exchangeInformation Processing Letters, 1995
- Robustness Principles for Public Key ProtocolsLecture Notes in Computer Science, 1995
- Parallel collision search with application to hash functions and discrete logarithmsPublished by Association for Computing Machinery (ACM) ,1994
- Authentication and authenticated key exchangesDesigns, Codes and Cryptography, 1992
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- How to share a secretCommunications of the ACM, 1979
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976