Signature schemes based on the strong RSA assumption
- 1 August 2000
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Information and System Security
- Vol. 3 (3) , 161-185
- https://doi.org/10.1145/357830.357847
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Secure Hash-and-Sign Signatures Without the Random OraclePublished by Springer Nature ,1999
- Collision-Free Accumulators and Fail-Stop Signature Schemes Without TreesPublished by Springer Nature ,1997
- How to Protect DES Against Exhaustive Key SearchPublished by Springer Nature ,1996
- Fast generation of prime numbers and secure public-key cryptographic parametersJournal of Cryptology, 1995
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and MemoryPublished by Springer Nature ,1988
- Sieve MethodsPublished by Springer Nature ,1983
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980
- Primes represented by irreducible polynomials in one variablePublished by American Mathematical Society (AMS) ,1965
- A heuristic asymptotic formula concerning the distribution of prime numbersMathematics of Computation, 1962