The Decision Diffie-Hellman problem
- 1 January 1998
- book chapter
- Published by Springer Nature
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- Number-theoretic constructions of efficient pseudo-random functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Synthesizers and their application to the parallel construction of pseudo-random functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Complexity of a determinate algorithm for the discrete logarithmMathematical Notes, 1994
- Non-malleable cryptographyPublished by Association for Computing Machinery (ACM) ,1991
- A hierarchy of polynomial time lattice basis reduction algorithmsTheoretical Computer Science, 1987
- How to construct random functionsJournal of the ACM, 1986
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980
- New directions in cryptographyIEEE Transactions on Information Theory, 1976