scientific article; zbMATH DE number 1759281
From MaRDI portal
Publication:4536205
zbMATH Open0998.68650MaRDI QIDQ4536205FDOQ4536205
Authors: Gerardo Orlando, Christof Paar
Publication date: 25 June 2002
Title of this publication is not available (Why is that?)
Recommendations
- A high-speed elliptic curve cryptographic processor for generic curves over \(\mathrm{GF}(p)\)
- High-performance hardware architecture of elliptic curve cryptography processor over \(\text{GF}(2^{163})\)
- scientific article; zbMATH DE number 1878342
- Hardware Elliptic Curve Cryptographic Processor Over<tex>$rm GF(p)$</tex>
- scientific article; zbMATH DE number 1979297
- Design and implementation of elliptic curve point multiplication processor over GF\((2^m)\)
- scientific article; zbMATH DE number 1759280
- Research of high performance architecture for elliptic curve scalar multiplication over GF (\(2^m\))
finite fieldselliptic curve scalar multiplicationsMontgomery scalar multiplication algorithmscalable elliptic curve processor architecture
Computing methodologies and applications (68U99) Cryptography (94A60) Finite fields and commutative rings (number-theoretic aspects) (11T99) Mathematical problems of computer architecture (68M07)
Cited In (20)
- A high speed coprocessor for elliptic curve scalar multiplications over \(\mathbb{F}_p\)
- Title not available (Why is that?)
- A high-speed elliptic curve cryptographic processor for generic curves over \(\mathrm{GF}(p)\)
- Title not available (Why is that?)
- Pushing the Limits of High-Speed GF(2 m ) Elliptic Curve Scalar Multiplication on FPGAs
- Title not available (Why is that?)
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient time-area scalable ECC processor using \(\mu\)-coding technique
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Reconfigurable architecture for elliptic curve cryptography using FPGA
- Research of high performance architecture for elliptic curve scalar multiplication over GF (\(2^m\))
- High-performance hardware architecture of elliptic curve cryptography processor over \(\text{GF}(2^{163})\)
- Towards Faster and Greener Cryptoprocessor for Eta Pairing on Supersingular Elliptic Curve over $\mathbb{F}_{2^{1223}}$
- High Speed Compact Elliptic Curve Cryptoprocessor for FPGA Platforms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Applying systolic multiplication-inversion architectures based on modified extended Euclidean algorithm for \(\text{GF}(2^k)\) in elliptic curve cryptography
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536205)