Correcting noisy exponentiation black-boxes modulo a prime

DOI10.1016/j.ipl.2013.03.016zbMath1358.11138OpenAlexW2039060028MaRDI QIDQ396612

Igor E. Shparlinski

Publication date: 13 August 2014

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

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

zbMATH Keywords

congruencesanalysis of algorithmsconcentration of solutionsnoisy exponentiation

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concentration of points on two and three dimensional modular hyperbolas and applications
• A hierarchy of polynomial time lattice basis reduction algorithms
• Factoring polynomials with rational coefficients
• On the concentration of points of polynomial maps and applications
• Multiplicative congruences with variables from short intervals
• On congruences with products of variables from short intervals and applications
• Noisy interpolation of sparse polynomials in finite fields
• A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations
• Distribution of Elements of Cosets of Small Subgroups and Applications
• Algorithms for the Shortest and Closest Lattice Vector Problems
• Product Sets of Rationals, Multiplicative Translates of Subgroups in Residue Rings, and Fixed Points of the Discrete Logarithm
• Sum-Products Estimates with Several Sets and Applications
• Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation
• Sparse polynomial approximation in finite fields
• ESTIMATES FOR THE NUMBER OF SUMS AND PRODUCTS AND FOR EXPONENTIAL SUMS IN FIELDS OF PRIME ORDER

This page was built for publication: Correcting noisy exponentiation black-boxes modulo a prime