Double Point Compression with Applications to Speeding Up Random Point Multiplication

DOI10.1109/TC.2007.47MaRDI QIDQ4564124zbMATH OpenFDO

Authors Majid Khabbazian, T. Aaron Gulliver, Vijay K. Bhargava

Publication date 12 June 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2007.47

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Cryptography (94A60)

Cited in

(4)

• Faster point compression for elliptic curves of \(j\)-invariant 0
• Multiple point compression on elliptic curves
• Batch point compression in the context of advanced pairing-based protocols
• Point (de)compression for elliptic curves over highly 2-adic finite fields

This page was built for publication: Double Point Compression with Applications to Speeding Up Random Point Multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4564124)