Low-resource and fast binary Edwards curves cryptography

DOI10.1007/978-3-319-26617-6_19MaRDI QIDQ3460185zbMATH OpenOpenAlexFDO

Authors Brian Koziel, Reza Azarderakhsh, Mehran Mozaffari-Kermani

Publication date 12 January 2016

Published in Progress in Cryptology -- INDOCRYPT 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-26617-6_19

zbMATH Keywords

point multiplicationGaussian normal basisbinary Edwards curvescrypto-processorlow-resource devices

Mathematics Subject Classification ID

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

Recommendations

• Binary Edwards curves revisited
• An elliptic curve cryptographic processor using Edwards curves and the number theoretic transform
• Twisted Edwards Curves Revisited
• Memory-constrained implementations of elliptic curve cryptography in co-\(Z\) coordinate repre\-sentation
• Faster Addition and Doubling on Elliptic Curves

Cited in

(4)

• An elliptic curve cryptographic processor using Edwards curves and the number theoretic transform
• New Hybrid Method for Isogeny-Based Cryptosystems Using Edwards Curves
• On Edwards curves and ZVP-attacks
• Memory-constrained implementations of elliptic curve cryptography in co-\(Z\) coordinate repre\-sentation

This page was built for publication: Low-resource and fast binary Edwards curves cryptography

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