Fault attacks on hyperelliptic curve discrete logarithm problem over binary field

DOI10.1007/s11432-013-5048-6zbMath1357.94077OpenAlexW2066391825MaRDI QIDQ893699

Haiyang Xue, Ming-Qiang Wang, Zhan, Tao

Publication date: 20 November 2015

Published in: Science China. Information Sciences (Search for Journal in Brave)

Full work available at URL: http://engine.scichina.com/doi/10.1007/s11432-013-5048-6

zbMATH Keywords

hyperelliptic curvegenusdiscrete logarithmcryptosystembinary field

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of the fault attack ECDLP over prime field
• Invalid-curve attacks on (hyper)elliptic curve cryptosystems
• Fault-based attack on Montgomery's ladder algorithm
• Analysis of a simple factorization algorithm
• Elliptic curve cryptosystems in the presence of permanent and transient faults
• Elliptic Curve Cryptosystems
• A method for obtaining digital signatures and public-key cryptosystems
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Monte Carlo Methods for Index Computation (mod p)
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Selected Areas in Cryptography
• On the importance of eliminating errors in cryptographic computations

This page was built for publication: Fault attacks on hyperelliptic curve discrete logarithm problem over binary field