Efficient FPGA design of exception-free generic elliptic curve cryptosystems

DOI10.1007/978-3-030-78372-3_15zbMath1498.94083OpenAlexW3171333901MaRDI QIDQ2117041

Kiyofumi Tanaka, Atsuko Miyaji, Yaoan Jin

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-78372-3_15

zbMATH Keywords

FPGAelliptic curve cryptosystemcomplete additionexception-free

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Elliptic curves (14H52) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Uses Software

• gmp
• Xilinx

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel crypto-devices for GF\((p)\) elliptic curve multiplication resistant against side channel attacks
• Secure and compact elliptic curve cryptosystems
• Complete Addition Formulas for Prime Order Elliptic Curves
• A High-Speed Elliptic Curve Cryptographic Processor for Generic Curves over $$\mathrm{GF}(p)$$
• Modular Multiplication Without Trial Division
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
• A High Speed Coprocessor for Elliptic Curve Scalar Multiplications over $\mathbb{F}_p$
• Highly Regular m-Ary Powering Ladders
• Elliptic Curve Cryptosystems
• Petrel: Power and Timing Attack Resistant Elliptic Curve Scalar Multiplier Based on Programmable ${\rm GF}(p)$ Arithmetic Unit

This page was built for publication: Efficient FPGA design of exception-free generic elliptic curve cryptosystems