Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms
- 13 July 2001
- book chapter
- Published by Springer Nature
- p. 271-281
- https://doi.org/10.1007/3-540-48658-5_26
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Non-interactive Public-Key CryptographyPublished by Springer Nature ,2001
- Elliptic Curve Public Key CryptosystemsPublished by Springer Nature ,1993
- Primality Testing and Abelian Varieties Over Finite FieldsLecture Notes in Mathematics, 1992
- A key-exchange system based on imaginary quadratic fieldsJournal of Cryptology, 1988
- Factoring Integers with Elliptic CurvesAnnals of Mathematics, 1987
- A simple and fast probabilistic algorithm for computing square roots modulo a prime number (Corresp.)IEEE Transactions on Information Theory, 1986
- Almost all primes can be quickly certifiedPublished by Association for Computing Machinery (ACM) ,1986
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- On a problem of Oppenheim concerning “factorisatio numerorum”Journal of Number Theory, 1983
- New directions in cryptographyIEEE Transactions on Information Theory, 1976