Multiple point compression on elliptic curves

DOI10.1007/S10623-016-0251-2MaRDI QIDQ521859zbMATH OpenOpenAlexFDO

Authors Adilet Otemissov, Francesco Sica, Andrey Sidorenko, Xin-Xin Fan

Publication date 12 April 2017

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-016-0251-2

zbMATH Keywords

elliptic curvescryptographypoint compression

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Recommendations

• Public Key Cryptography – PKC 2004
• Optimal bandwidth for elliptic curves defined over \(\text{GF}(2^n)\)
• Point compression for Koblitz elliptic curves
• Faster point compression for elliptic curves of \(j\)-invariant 0
• New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0

Cites work

• scientific article; zbMATH DE number 3859276 (Why is no real title available?)
• scientific article; zbMATH DE number 1206418 (Why is no real title available?)
• scientific article; zbMATH DE number 1942431 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 2114384 (Why is no real title available?)
• A Schnorr-Like Lightweight Identity-Based Signature Scheme
• Advances in Cryptology - EUROCRYPT 2004
• Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic
• Double Point Compression with Applications to Speeding Up Random Point Multiplication
• Efficient implementation of NIST-compliant elliptic curve cryptography for sensor nodes
• Elliptic Curve Cryptosystems
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• Implementing Cryptographic Pairings over Barreto-Naehrig Curves
• Multi-exponentiation (cryptographic protocols)
• Software Implementation of Arithmetic in
• Solving zero-dimensional systems through the rational univariate representation
• Square Root Computation over Even Extension Fields

Cited in

(5)

• New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0
• Faster point compression for elliptic curves of \(j\)-invariant 0
• Point compression for the trace zero subgroup over a small degree extension field
• Optimal bandwidth for elliptic curves defined over \(\text{GF}(2^n)\)
• Public Key Cryptography – PKC 2004

Describes a project that uses

Uses Software

• ISOLATE
• EFD

This page was built for publication: Multiple point compression on elliptic curves

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