Double Point Compression with Applications to Speeding Up Random Point Multiplication

DOI10.1109/TC.2007.47zbMATH Open1390.65181MaRDI QIDQ4564124FDOQ4564124

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)

Mathematics Subject Classification ID

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

Cited In (2)

• Faster point compression for elliptic curves of $j$-invariant $0$
• Multiple point compression on elliptic curves

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)