Generating random factored Gaussian integers, easily

DOI10.1090/MCOM/3000MaRDI QIDQ3450047zbMATH OpenOpenAlexFDO

Authors Noah Lebowitz-Lockard, Carl Pomerance

Publication date 2 November 2015

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/mcom/3000

zbMATH Keywords

polynomial-time algorithmrandom Gaussian integerrandom number generation

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45) Random number generation in numerical analysis (65C10)

Recommendations

• Generating random factored ideals in number fields
• How to Generate Factored Random Numbers
• Generating random factored numbers, easily
• scientific article; zbMATH DE number 2119690
• Primality testing with Gaussian periods

Cites work

• Approximate formulas for some functions of prime numbers
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Generating random factored numbers, easily
• How to Generate Factored Random Numbers
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 5635018 (Why is no real title available?)
• scientific article; zbMATH DE number 1232560 (Why is no real title available?)
• scientific article; zbMATH DE number 2206373 (Why is no real title available?)
• PRIMES is in P

Cited in

(4)

• Generating random factored numbers, easily
• How to Generate Factored Random Numbers
• Generating random factored ideals in number fields
• scientific article; zbMATH DE number 2119690 (Why is no real title available?)

This page was built for publication: Generating random factored Gaussian integers, easily

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