Hardware realization of fast elliptic curve point multiplication using balanced ternary representation and pre-computation over GF(p)
DOI10.1080/09720529.2015.1103017zbMATH Open1498.11237OpenAlexW2401718577MaRDI QIDQ5069765FDOQ5069765
Authors:
Publication date: 19 April 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2015.1103017
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})\)
balanced ternary representationelliptic curve point multiplicationradix 3 pre-computationternary point multiplication
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Curves over finite and local fields (11G20) Computational number theory (11Y99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Elliptic Curve Cryptosystems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hardware Elliptic Curve Cryptographic Processor Over<tex>$rm GF(p)$</tex>
Cited In (1)
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)
