Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions

DOI10.1007/978-3-030-56877-1_17zbMath1504.94183OpenAlexW3046435833MaRDI QIDQ2102077

Lior Rotem, Gil Segev

Publication date: 7 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-56877-1_17

zbMATH Keywords

generic-ring delay functionsrepeated squaring in RSA groups

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Practical statistically-sound proofs of exponentiation in any group ⋮ On time-lock cryptographic assumptions in abelian hidden-order groups ⋮ Completeness theorems for adaptively secure broadcast ⋮ Non-malleable time-lock puzzles and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Malleability of the blockchain's entropy
• A key-exchange system based on imaginary quadratic fields
• Simple proofs of sequential work
• Verifiable delay functions
• The algebraic group model and its applications
• Complexity of a determinate algorithm for the discrete logarithm
• Continuous verifiable delay functions
• Generic-group delay functions require hidden-order groups
• Tight verifiable delay functions
• On the security of time-lock puzzles and timed commitments
• Verifiable delay functions from supersingular isogenies and pairings
• On the analysis of cryptographic assumptions in the generic ring model
• Time-Lock Puzzles from Randomized Encodings
• Publicly verifiable proofs of sequential work
• The Semi-Generic Group Model and Applications to Pairing-Based Cryptography
• Algorithms for Black-Box Fields and their Application to Cryptography
• Breaking RSA may not be equivalent to factoring
• Simple verifiable delay functions
• Time-Lock Puzzles in the Random Oracle Model
• When e-th Roots Become Easier Than Factoring
• Separating succinct non-interactive arguments from all falsifiable assumptions
• On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
• On the Equivalence of Generic Group Models
• Cryptography and Coding
• Breaking RSA Generically Is Equivalent to Factoring
• Efficient verifiable delay functions

This page was built for publication: Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions