Efficient FPGA design of exception-free generic elliptic curve cryptosystems
From MaRDI portal
Publication:2117041
DOI10.1007/978-3-030-78372-3_15zbMATH Open1498.94083OpenAlexW3171333901MaRDI QIDQ2117041FDOQ2117041
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
Recommendations
- Publication:4502793
- Design and implementation of elliptic curve point multiplication processor over GF\((2^m)\)
- Reconfigurable architecture for elliptic curve cryptography using FPGA
- scientific article; zbMATH DE number 1941127
- High-performance hardware architecture of elliptic curve cryptography processor over \(\text{GF}(2^{163})\)
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves (14H52)
Cites Work
- Title not available (Why is that?)
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
- Modular Multiplication Without Trial Division
- Title not available (Why is that?)
- Elliptic Curve Cryptosystems
- Title not available (Why is that?)
- Highly Regular m-Ary Powering Ladders
- Title not available (Why is that?)
- 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)$$
- A High Speed Coprocessor for Elliptic Curve Scalar Multiplications over $\mathbb{F}_p$
- Title not available (Why is that?)
- Petrel: Power and Timing Attack Resistant Elliptic Curve Scalar Multiplier Based on Programmable ${\rm GF}(p)$ Arithmetic Unit
Cited In (7)
- Topics in Cryptology – CT-RSA 2004
- Title not available (Why is that?)
- Efficient elliptic curve cryptographic hardware design for wireless security
- Collision Search for Elliptic Curve Discrete Logarithm over GF(2 m ) with FPGA
- A Fast and Compact FPGA Implementation of Elliptic Curve Cryptography Using Lambda Coordinates
- On efficient implementation of FPGA-based hyperelliptic curve cryptosystems
- Title not available (Why is that?)
Uses Software
This page was built for publication: Efficient FPGA design of exception-free generic elliptic curve cryptosystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117041)