A high speed coprocessor for elliptic curve scalar multiplications over F_p

DOI10.1007/978-3-642-15031-9_4MaRDI QIDQ3583440zbMATH OpenOpenAlexFDO

Authors Nicolas Guillermin

Publication date 17 August 2010

Published in Cryptographic Hardware and Embedded Systems, CHES 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15031-9_4

zbMATH Keywords

elliptic curveFPGAhigh speedprime fieldRNS

Mathematics Subject Classification ID

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

Recommendations

• Research of high performance architecture for elliptic curve scalar multiplication over GF (2ᵐ)
• A scalable \(\text{GF}(p)\) elliptic curve processor architecture for programmable hardware
• Pushing the Limits of High-Speed GF(2 m ) Elliptic Curve Scalar Multiplication on FPGAs
• High-performance hardware architecture of elliptic curve cryptography processor over \(\text{GF}(2^{163})\)
• A high-performance reconfigurable elliptic curve processor for \(\text{GF}(S^m)\)

Cited in

(21)

• High-performance generic-point parallel scalar multiplication
• Lightweight coprocessor for Koblitz curves: 283-bit ECC including scalar conversion with only 4300 gates
• Four\(\mathbb {Q}\) on FPGA: new hardware speed records for elliptic curve cryptography over large prime characteristic fields
• Architecture level optimizations for Kummer based HECC on FPGAs
• Implementing complete formulas on Weierstrass curves in hardware
• Efficient FPGA design of exception-free generic elliptic curve cryptosystems
• Highly parallel modular multiplier for elliptic curve cryptography in residue number system
• Ultra high-performance ASIC implementation of SM2 with SPA resistance
• Arithmetic on elliptic curves with use of graphic calculators
• A high-speed elliptic curve cryptographic processor for generic curves over \(\mathrm{GF}(p)\)
• RNS arithmetic in \(\mathbb F_{p^{k}}\) and application to fast pairing computation
• Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$
• Efficient techniques for high-speed elliptic curve cryptography
• Elliptic curve scalar multiplier design using FPGAs
• Fast implementation of elliptic curve defined over \(\text{GF}(p^m)\) on \(\text{CalmRISC}\) with \(\text{MAC}2424\) coprocessor
• Pushing the Limits of High-Speed GF(2 m ) Elliptic Curve Scalar Multiplication on FPGAs
• Combining leak-resistant arithmetic for elliptic curves defined over F_p and RNS representation
• Hardware realization of fast elliptic curve point multiplication using balanced ternary representation and pre-computation over \(\mathrm{GF}(p)\)
• Low-power elliptic curve cryptography using scaled modular arithmetic
• Bit-parallel coprocessor for standard ECC-GF(2ᵐ) on FPGA
• Finite field arithmetic in large characteristic for classical and post-quantum cryptography

This page was built for publication: A high speed coprocessor for elliptic curve scalar multiplications over \(\mathbb{F}_p\)

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