The Hidden Root Problem
From MaRDI portal
Publication:3600495
DOI10.1007/978-3-540-85538-5_6zbMath1186.94474OpenAlexW2102598455MaRDI QIDQ3600495
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
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)
Related Items (3)
Products with variables from low-dimensional affine spaces and shifted power identity testing in finite fields ⋮ Fixed argument pairing inversion on elliptic curves ⋮ Pairing inversion for finding discrete logarithms
Cites Work
- Factoring polynomials with rational coefficients
- Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
- The Weil pairing, and its efficient calculation
- Efficient pairing computation on supersingular abelian varieties
- Side Channel Analysis of Practical Pairing Implementations: Which Path Is More Secure?
- Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
- A Fault Attack on Pairing-Based Cryptography
- The Eta Pairing Revisited
- Aspects of Pairing Inversion
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A method for obtaining digital signatures and public-key cryptosystems
- The Importance of the Final Exponentiation in Pairings When Considering Fault Attacks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The Hidden Root Problem
