On the optimization of Pippenger's bucket method with precomputation

DOI10.1007/978-3-031-48679-1_18MaRDI QIDQ6613373zbMATH OpenFDO

Authors Guiwen Luo, Guang Gong

Publication date 2 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48679-1_18

zbMATH Keywords

\(n\)-scalar multiplication algorithms

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Basic digit sets for radix representation
• Double-Base Number System for Multi-scalar Multiplications
• Endomorphisms for faster elliptic curve cryptography on a large class of curves
• Faster batch forgery identification
• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 1842492 (Why is no real title available?)
• Low-Weight Polynomial Form Integers for Efficient Modular Multiplication
• On the size of pairing-based non-interactive arguments
• Speeding the Pollard and Elliptic Curve Methods of Factorization

This page was built for publication: On the optimization of Pippenger's bucket method with precomputation

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