Multiple point compression on elliptic curves

DOI10.1007/s10623-016-0251-2zbMath1376.94033OpenAlexW2498182045MaRDI QIDQ521859

Adilet Otemissov, Andrey Sidorenko, Francesco Sica, 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

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

Uses Software

• EFD
• ISOLATE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving zero-dimensional systems through the rational univariate representation
• Efficient Implementation of NIST-Compliant Elliptic Curve Cryptography for Sensor Nodes
• A Schnorr-Like Lightweight Identity-Based Signature Scheme
• Elliptic Curve Cryptosystems
• Multi-exponentiation (cryptographic protocols)
• Double Point Compression with Applications to Speeding Up Random Point Multiplication
• Square Root Computation over Even Extension Fields
• Advances in Cryptology - EUROCRYPT 2004
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Software Implementation of Arithmetic in
• Implementing Cryptographic Pairings over Barreto-Naehrig Curves
• Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic

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