Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture
- 8 February 2002
- book chapter
- Published by Springer Nature
- p. 290-299
- https://doi.org/10.1007/3-540-45760-7_20
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Sur le nombre de points de torsion rationnels sur une courbe elliptiqueComptes Rendus de l'Académie des Sciences - Series I - Mathematics, 1999
- The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete LogarithmsSIAM Journal on Computing, 1999
- The Decision Diffie-Hellman problemPublished by Springer Nature ,1998
- A practical public key cryptosystem provably secure against adaptive chosen ciphertext attackPublished by Springer Nature ,1998
- Bornes pour la torsion des courbes elliptiques sur les corps de nombresInventiones Mathematicae, 1996
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of CurvesMathematics of Computation, 1994
- Torsion points on elliptic curvesBulletin of the American Mathematical Society, 1990
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- New directions in cryptographyIEEE Transactions on Information Theory, 1976