Batch point compression in the context of advanced pairing-based protocols

DOI10.1007/S00200-023-00625-3MaRDI QIDQ6962825zbMATH OpenFDO

Authors Dmitrii Koshelev

Publication date 8 July 2025

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00200-023-00625-3

zbMATH Keywords

batch point compressionconic bundlescubic and sextic rootselliptic curves of \(j\)-invariant 0generalized Kummer varietiesgenerating ``independent pointshighly 2-adic fieldsrationality problem

Mathematics Subject Classification ID

Elliptic curves over local fields (11G07) Elliptic curves (14H52) Cryptography (94A60)

Cites work

• Compression in Finite Fields and Torus-Based Cryptography
• Constant-Size Commitments to Polynomials and Their Applications
• Converting pairing-based cryptosystems from composite-order groups to prime-order groups
• Double Point Compression with Applications to Speeding Up Random Point Multiplication
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Explicit examples of rational and Calabi-Yau threefolds with primitive automorphisms of positive entropy
• Faster point compression for elliptic curves of \(j\)-invariant 0
• Fully Collusion Resistant Traitor Tracing with Short Ciphertexts and Private Keys
• Guide to pairing-based cryptography
• scientific article; zbMATH DE number 1703931 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 3445393 (Why is no real title available?)
• Indifferentiable hashing to ordinary elliptic \(\mathbb{F}_{q} \)-curves of \(j=0\) with the cost of one exponentiation in \(\mathbb{F}_{q} \)
• LOVE a pairing
• Mathematics of public key cryptography.
• Multiple point compression on elliptic curves
• New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0
• On the computation of square roots in finite fields
• On the efficiency and security of pairing-based protocols in the type 1 and type 4 settings
• On the size of pairing-based non-interactive arguments
• On the unirationality of higher dimensional Ueno-type manifolds
• Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition
• Scalable zero knowledge via cycles of elliptic curves
• The eleventh power residue symbol
• Theory of Cryptography

Cited in

(1)

• Point (de)compression for elliptic curves over highly 2-adic finite fields

This page was built for publication: Batch point compression in the context of advanced pairing-based protocols

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