Fast implementation of elliptic curve defined over GF(p^m) on CalmRISC with MAC2424 coprocessor

DOI10.1007/3-540-44499-8_4MaRDI QIDQ4536207zbMATH OpenFDO

Authors Jaewook Chung, Sang Gyoo Sim, Pil Joong Lee

Publication date 28 November 2002

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

Full work available at URL https://doi.org/10.1007/3-540-44499-8_4

zbMATH Keywords

elliptic curve cryptographyfast field arithmetic

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Computing methodologies and applications (68U99) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Recommendations

• Fast implementation of elliptic curve arithmetic in GF(p^n)
• 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\)
• Implementation of elliptic curve cryptographic coprocessor over \(\text{GF}(2^m)\) on a FPGA
• scientific article; zbMATH DE number 2058638
• Fast multiplication on elliptic curves over GF(2ᵐ) without precomputation
• Design and implementation of elliptic curve point multiplication processor over GF\((2^m)\)
• A high-performance reconfigurable elliptic curve processor for \(\text{GF}(S^m)\)
• Pushing the Limits of High-Speed GF(2 m ) Elliptic Curve Scalar Multiplication on FPGAs

Cited in

(1)

• Efficient hardware implementation of finite fields with applications to cryptography

This page was built for publication: Fast implementation of elliptic curve defined over \(\text{GF}(p^m)\) on \(\text{CalmRISC}\) with \(\text{MAC}2424\) coprocessor

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