Distribution of Modular Sums and the Security of the Server Aided Exponentiation
- 1 January 2001
- book chapter
- Published by Springer Nature
- p. 331-342
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- More Flexible Exponentiation with Precomputation2001
- Fast Exponentiation with Precomputation2001
- The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications1999
- Synthesizers and Their Application to the Parallel Construction of Pseudo-Random FunctionsJournal of Computer and System Sciences, 1999
- Modern Cryptography, Probabilistic Proofs and Pseudorandomness1999
- A Survey of Fast Exponentiation MethodsJournal of Algorithms, 1998
- On the security of server-aided RSA protocols1998
- Speeding up discrete log and factoring based schemes via precomputations1998
- Efficient Cryptographic Schemes Provably as Secure as Subset SumJournal of Cryptology, 1996
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985