Rounding in lattices and its cryptographic applications
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
NTRU: A Ring-Based Public Key Cryptosystem
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
Journal of Cryptology
The Weil Pairing, and Its Efficient Calculation
Journal of Cryptology
A theoretical basis for the reduction of polynomials to canonical forms
ACM SIGSAM Bulletin
A Fault Attack on Pairing-Based Cryptography
IEEE Transactions on Computers
Efficient pairing computation on supersingular Abelian varieties
Designs, Codes and Cryptography
Efficient algorithms for solving overdefined systems of multivariate polynomial equations
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Side channel analysis of practical pairing implementations: which path is more secure?
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
IEEE Transactions on Information Theory
The importance of the final exponentiation in pairings when considering fault attacks
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
Inverting the final exponentiation of tate pairings on ordinary elliptic curves using faults
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
| Hi-index | 0.00 |
In this paper we study a novel computational problem called the Hidden Root Problem, which appears naturally when considering fault attacks on pairing based cryptosystems. Furthermore, a variant of this problem is one of the main obstacles for efficient pairing inversion. We present an algorithm to solve this problem over extension fields and investigate for which parameters the algorithm becomes practical.