An Elliptic Curve Cryptographic Processor Using Edwards Curves and the Number Theoretic Transform

DOI10.1007/978-3-319-21356-9_7zbMath1401.94166OpenAlexW2234636045MaRDI QIDQ2947104

Lejla Batina, Nele Mentens, Selçuk Baktır

Publication date: 21 September 2015

Published in: Cryptography and Information Security in the Balkans (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21356-9_7

zbMATH Keywords

side-channel analysisEdwards curvesnumber theoretic transformECC

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• Unnamed Item
• Unnamed Item
• An area/performance trade-off analysis of a GF\((2^m)\) multiplier architecture for elliptic curve cryptography
• Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Elliptic Curve Cryptosystems
• Elliptic-Curve-Based Security Processor for RFID
• Faster Addition and Doubling on Elliptic Curves
• A normal form for elliptic curves
• The Fast Fourier Transform in a Finite Field

This page was built for publication: An Elliptic Curve Cryptographic Processor Using Edwards Curves and the Number Theoretic Transform