Revisiting cycles of pairing-friendly elliptic curves

DOI10.1007/978-3-031-38545-2_1MaRDI QIDQ6186695

Javier Silva, Jorge Jiménez-Urroz, Marta Bellés-Muñoz

Publication date: 2 February 2024

Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

zbMATH Keywords

proof systemspairing-friendly elliptic curvescycles of elliptic curves

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Elliptic curves over global fields (11G05) Number-theoretic algorithms; complexity (11Y16) Elliptic curves (14H52) Curves over finite and local fields (11G20) Applications to coding theory and cryptography of arithmetic geometry (14G50) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring integers with elliptic curves
• The improbability that an elliptic curve has subexponential discrete log problem under the Menezes-Okamoto-Vanstone algorithm
• Elliptic curve implementation of zero-knowledge blobs
• The discrete logarithm problem on elliptic curves of trace one
• Scalable zero knowledge via cycles of elliptic curves
• Recursive proof composition from accumulation schemes
• Proof-carrying data without succinct arguments
• Families of SNARK-friendly 2-chains of elliptic curves
• A taxonomy of pairing-friendly elliptic curves
• Ordinary Abelian varieties having small embedding degree
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• Cluster Computing in Zero Knowledge
• Constant-Size Commitments to Polynomials and Their Applications
• On Prime-Order Elliptic Curves with Embedding Degrees k = 3, 4, and 6
• The Arithmetic of Elliptic Curves
• The large sieve
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Reducing elliptic curve logarithms to logarithms in a finite field
• What You Should Know About Integer-Valued Polynomials
• Amicable Pairs and Aliquot Cycles for Elliptic Curves
• Accelerating the CM method
• Pairing-Friendly Elliptic Curves of Prime Order
• Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
• On the Size of Pairing-Based Non-interactive Arguments
• On Cycles of Pairing-Friendly Elliptic Curves
• Algorithmic Number Theory
• A survey of elliptic curves for proof systems