Low-power elliptic curve cryptography using scaled modular arithmetic

DOI10.1007/978-3-540-28632-5_7MaRDI QIDQ5311464zbMATH OpenOpenAlexFDO

Authors Berk Sunar, Erdinç Öztürk, Erkay Savaş

Publication date 23 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99451

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• A high speed coprocessor for elliptic curve scalar multiplications over \(\mathbb{F}_p\)
• A scalable \(\text{GF}(p)\) elliptic curve processor architecture for programmable hardware
• High-performance hardware architecture of elliptic curve cryptography processor over \(\text{GF}(2^{163})\)
• Applying systolic multiplication-inversion architectures based on modified extended Euclidean algorithm for \(\text{GF}(2^k)\) in elliptic curve cryptography
• A high-performance reconfigurable elliptic curve processor for \(\text{GF}(S^m)\)

Cited in

(2)

• Generalised Mersenne numbers revisited
• Efficient Hardware Operations for the Residue Number System by Boolean Minimization

This page was built for publication: Low-power elliptic curve cryptography using scaled modular arithmetic

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