Research development on efficient elliptic curve isogenous computations

DOI10.13328/J.CNKI.JOS.006116MaRDI QIDQ4996241zbMATH OpenFDO

Authors Yan Huang, Fangguo Zhang

Publication date 1 July 2021

Full work available at URL https://doi.org/10.13328/J.CNKI.JOS.006116

zbMATH Keywords

Edwards curveisogenous computationMontgomery curve

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Recommendations

• Computational problems in supersingular elliptic curve isogenies
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
• Constructing elliptic curve isogenies in quantum subexponential time
• Supersingular isogeny-based cryptography: a survey
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies

Cited in

(4)

• Eliptic curves in post-quantum cryptography
• On fast calculation of addition chains for isogeny-based cryptography
• Efficient finite field multiplication for isogeny based post quantum cryptography
• Exploring the solution space: CB-WCA for efficient finite field multiplication in post-quantum cryptography

This page was built for publication: Research development on efficient elliptic curve isogenous computations

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