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

DOI10.4213/mvk381zbMath1490.94055OpenAlexW4206499385MaRDI QIDQ5071488

Dmitrii Koshelev

Publication date: 21 April 2022

Published in: Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mvk381

zbMATH Keywords

finite fieldspairing-based cryptographypoint compressionelliptic curves of \(j\)-invariant 0

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Elliptic curves over local fields (11G07)

Uses Software

• Magma

Cites Work

• New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0
• New cube root algorithm based on the third order linear recurrence relations in finite fields
• Guide to Pairing-Based Cryptography
• Algebraic Surfaces in Positive Characteristic
• The Arithmetic of Elliptic Curves
• Double Point Compression with Applications to Speeding Up Random Point Multiplication
• On the Size of Pairing-Based Non-interactive Arguments

This page was built for publication: Faster point compression for elliptic curves of $j$-invariant $0$