Certifying giant nonprimes
From MaRDI portal
Publication:6070774
DOI10.1007/978-3-031-31368-4_19MaRDI QIDQ6070774
Pavel Hubáček, Unnamed Author, Krzysztof Pietrzak, Chethan Kamath
Publication date: 24 November 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- A key-exchange system based on imaginary quadratic fields
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
- Verifiable delay functions
- PRIMES is in P
- Stronger security proofs for RSA and Rabin bits.
- Transparent SNARKs from DARK compilers
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Time- and space-efficient arguments from groups of unknown order
- Tight upper and lower bounds for the reciprocal sum of Proth primes
- Simple and efficient batch verification techniques for verifiable delay functions
- Elliptic Curves and Primality Proving
- The Group of Signed Quadratic Residues and Applications
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- The Pseudoprimes to 25 ⋅10 9
- Lucas Pseudoprimes
- New Primality Criteria and Factorizations of 2 m ± 1
- Every Prime Has a Succinct Certificate
- A Fast Monte-Carlo Test for Primality
- A method for obtaining digital signatures and public-key cryptosystems
- Simple verifiable delay functions
- Lucasian Criteria for the Primality of = h ⋅2 n - 1
- Efficient verifiable delay functions
- Practical statistically-sound proofs of exponentiation in any group
- PPAD is as hard as LWE and iterated squaring
This page was built for publication: Certifying giant nonprimes
