Algorithmic Number Theory

DOI10.1007/11792086zbMATH Open1143.11341OpenAlexW2977481208MaRDI QIDQ5899255FDOQ5899255

Authors: Damien Stehlé 

Publication date: 2 May 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11792086

Recommendations

• Local Randomness in Polynomial Random Number and Random Function Generators
• Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers
• Attacking the linear congruential generator on elliptic curves via lattice techniques
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• scientific article; zbMATH DE number 3928174

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45) Number-theoretic algorithms; complexity (11Y16)

Cited In (3)

• Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)
• Generating random bits from an arbitrary source: fundamental limits
• Formally verified certificate checkers for hardest-to-round computation

This page was built for publication: Algorithmic Number Theory

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