Analysis of the fault attack ECDLP over prime field

DOI10.1155/2011/580749zbMath1235.94052OpenAlexW2069132213WikidataQ58690462 ScholiaQ58690462MaRDI QIDQ410803

Ming-Qiang Wang, Zhan, Tao

Publication date: 4 April 2012

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2011/580749

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (1)

Fault attacks on hyperelliptic curve discrete logarithm problem over binary field

Cites Work

• Unnamed Item
• Unnamed Item
• On a problem of Oppenheim concerning Factorisatio Numerorum
• Factoring integers with elliptic curves
• Nonsingular plane cubic curves over finite fields
• Die Typen der Multiplikatorenringe elliptischer Funktionenkörper
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Elliptic Curve Cryptosystems
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• A hyperelliptic smoothness test. I
• How the Number of Points of An Elliptic Curve Over a Fixed Prime Field Varies
• Abelian varieties over finite fields
• On the importance of eliminating errors in cryptographic computations

This page was built for publication: Analysis of the fault attack ECDLP over prime field