Generating EIGamal Signatures Without Knowing the Secret Key
- 1 January 1996
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Fast Exponentiation with PrecomputationPublished by Springer Nature ,2001
- The Eurocrypt’92 Controversial Issue Trapdoor Primes and ModuliPublished by Springer Nature ,2001
- Designing and Detecting Trapdoors for Discrete Log CryptosystemsPublished by Springer Nature ,2001
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete LogarithmsPublished by Springer Nature ,2000
- Public-key cryptosystem design based on factoring and discrete logarithmsIEE Proceedings - Computers and Digital Techniques, 1994
- Meta-ElGamal signature schemesPublished by Association for Computing Machinery (ACM) ,1994
- Discrete Logarithms in $GF ( P )$ Using the Number Field SieveSIAM Journal on Discrete Mathematics, 1993
- An interactive identification scheme based on discrete logarithms and factoringJournal of Cryptology, 1992
- An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)IEEE Transactions on Information Theory, 1978