Nonuniform polynomial time algorithm to solve decisional Diffie-Hellman problem in finite fields under conjecture

DOI10.1007/3-540-45760-7_20MaRDI QIDQ4472081zbMATH OpenFDO

Authors Qi Cheng, Shigenori Uchiyama

Publication date 3 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2271/22710290.htm

Mathematics Subject Classification ID

Curves over finite and local fields (11G20) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Recommendations

• Obstacles to the torsion-subgroup attack on the decision Diffie-Hellman Problem
• Interpolation of the elliptic curve Diffie-Hellman mapping
• Easy Decision Diffie-Hellman Groups
• Algorithms for black-box fields and their application to cryptography
• Algorithms to solve the finite field discrete logarithm problem

Cited in

(2)

• Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
• Obstacles to the torsion-subgroup attack on the decision Diffie-Hellman Problem

This page was built for publication: Nonuniform polynomial time algorithm to solve decisional Diffie-Hellman problem in finite fields under conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472081)