Quantum period reconstruction of approximate sequences

DOI10.1016/j.ipl.2007.02.019zbMath1184.68259OpenAlexW2017764060MaRDI QIDQ2379974

Arne Winterhof, Igor E. Shparlinski

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.02.019

zbMATH Keywords

algorithmsfinite fieldsquantum algorithmautocorrelationapproximate sequencesperiod finding

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sequences, discrepancies and applications
• Inferring sequences produced by a linear congruential generator missing low-order bits
• Lattice reduction: a toolbox for the cryptoanalyst
• Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order.
• Estimates on exponential sums related to the Diffie-Hellman distributions
• Reconstructing Truncated Integer Variables Satisfying Linear Congruences
• Inferring sequences produced by pseudo-random number generators
• How to predict congruential generators
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation
• Information Security and Privacy
• Computing and Combinatorics
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

This page was built for publication: Quantum period reconstruction of approximate sequences