Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods

DOI10.1007/S10444-017-9581-5zbMath1408.94939OpenAlexW2772482257MaRDI QIDQ1670419

Denis Khleborodov

Publication date: 5 September 2018

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10444-017-9581-5

zbMATH Keywords

elliptic curvesscalar multiplicationlightweight cryptographyEECEoT securityIoT securitymobile security

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Elliptic curves (14H52) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sequences of numbers generated by addition in formal groups and new primality and factorization tests
• Signed bits and fast exponentiation
• Trading inversions for multiplications in elliptic curve cryptography
• Elliptic Curve Cryptosystems
• A Survey of Fast Exponentiation Methods
• Fast and Flexible Elliptic Curve Point Arithmetic over Prime Fields
• Advances in Cryptology – CRYPTO 2004
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields
• Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains

This page was built for publication: Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods