The Hidden Root Problem

DOI10.1007/978-3-540-85538-5_6MaRDI QIDQ3600495zbMATH OpenOpenAlexFDO

Authors Frederik Vercauteren

Publication date 10 February 2009

Published in Pairing-Based Cryptography – Pairing 2008 (Search for Journal in Brave)

Full work available at URL https://www.cosic.esat.kuleuven.be/publications/article-1164.pdf

zbMATH Keywords

finite fieldhidden root problempairing inversionsubgroup

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 2086222
• An attack on disguised elliptic curves
• On the modular inversion hidden number problem
• Aspects of Pairing Inversion
• On Pairing Inversion Problems

Cites work

• A Fault Attack on Pairing-Based Cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Aspects of Pairing Inversion
• Efficient algorithms for solving overdefined systems of multivariate polynomial equations
• Efficient pairing computation on supersingular abelian varieties
• Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
• Factoring polynomials with rational coefficients
• Hardness of computing the most significant bits of secret keys in Diffie-Hellman and related schemes
• scientific article; zbMATH DE number 1722679 (Why is no real title available?)
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 6472645 (Why is no real title available?)
• Side channel analysis of practical pairing implementations: which path is more secure?
• The Eta Pairing Revisited
• The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks
• The Weil pairing, and its efficient calculation

Cited in

(4)

• Products with variables from low-dimensional affine spaces and shifted power identity testing in finite fields
• Pairing inversion for finding discrete logarithms
• An attack on disguised elliptic curves
• Fixed argument pairing inversion on elliptic curves

This page was built for publication: The Hidden Root Problem

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