A high-speed elliptic curve cryptographic processor for generic curves over GF(p)
From MaRDI portal
Publication:2949543
Recommendations
- Fully parameterizable elliptic curve cryptography processor over GF(2)
- 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)\)
- A scalable \(\text{GF}(p)\) elliptic curve processor architecture for programmable hardware
- A high speed coprocessor for elliptic curve scalar multiplications over \(\mathbb{F}_p\)
Cited in
(13)- Efficient FPGA design of exception-free generic elliptic curve cryptosystems
- A HDL generator for flexible and efficient finite-field multipliers on FPGAs
- Highly parallel modular multiplier for elliptic curve cryptography in residue number system
- Implementation of high speed arithmetic point production model for elliptic curve engine
- An elliptic curve cryptographic processor using Edwards curves and the number theoretic transform
- Fast multi-precision multiplication for public-key cryptography on embedded microprocessors
- 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
- A design of low latency multiplier/mac unit for public-key cryptography
- A high-performance reconfigurable elliptic curve processor for \(\text{GF}(S^m)\)
- Fast implementation of elliptic curve defined over \(\text{GF}(p^m)\) on \(\text{CalmRISC}\) with \(\text{MAC}2424\) coprocessor
- Development of Fast Multiplier Structures with Cryptographic Applications
- High Speed Compact Elliptic Curve Cryptoprocessor for FPGA Platforms
This page was built for publication: A high-speed elliptic curve cryptographic processor for generic curves over \(\mathrm{GF}(p)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949543)