Close to Uniform Prime Number Generation with Fewer Random Bits

DOI10.1007/978-3-662-43948-7_82zbMath1414.11165arXiv1406.7078OpenAlexW31244460MaRDI QIDQ5167809

Mehdi Tibouchi, Pierre-Alain Fouque

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.7078

zbMATH Keywords

cryptographynumber theoryprime number generation

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial probability (60C05) Number-theoretic algorithms; complexity (11Y16) Primality (11Y11)

Related Items

Zero-knowledge proofs for set membership: efficient, succinct, modular, Zero-knowledge proofs for set membership: efficient, succinct, modular