Hardware realization of fast elliptic curve point multiplication using balanced ternary representation and pre-computation over GF(p)
From MaRDI portal
Publication:5069765
Recommendations
- Research of high performance architecture for elliptic curve scalar multiplication over GF (\(2^m\))
- scientific article; zbMATH DE number 1878342
- Pushing the Limits of High-Speed GF(2 m ) Elliptic Curve Scalar Multiplication on FPGAs
- A high speed coprocessor for elliptic curve scalar multiplications over \(\mathbb{F}_p\)
- High-performance hardware architecture of elliptic curve cryptography processor over \(\text{GF}(2^{163})\)
Cites work
- scientific article; zbMATH DE number 3948147 (Why is no real title available?)
- scientific article; zbMATH DE number 1349933 (Why is no real title available?)
- scientific article; zbMATH DE number 954401 (Why is no real title available?)
- scientific article; zbMATH DE number 1878342 (Why is no real title available?)
- scientific article; zbMATH DE number 2114384 (Why is no real title available?)
- scientific article; zbMATH DE number 854547 (Why is no real title available?)
- Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
- Elliptic Curve Cryptosystems
- Hardware Elliptic Curve Cryptographic Processor Over<tex>$rm GF(p)$</tex>
This page was built for publication: Hardware realization of fast elliptic curve point multiplication using balanced ternary representation and pre-computation over \(\mathrm{GF}(p)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069765)