Reconstructing points of superelliptic curves over a prime finite field

DOI10.3934/amc.2022022MaRDI QIDQ6089463

Jaime Gutierrez

Publication date: 14 December 2023

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

zbMATH Keywords

cryptographysuperelliptic curvesprime finite fieldslattice techniques

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Lattices and convex bodies (number-theoretic aspects) (11H06) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16)

Related Items (1)

Fixed points of the subset sum pseudorandom number generators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Points on curves in small boxes and applications
• Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits
• On Lovász' lattice reduction and the nearest lattice point problem
• Factoring polynomials with rational coefficients
• Geometric algorithms and combinatorial optimization
• Lattice reduction: a toolbox for the cryptoanalyst
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Bilinear forms in Weyl sums for modular square roots and applications
• Recovering zeros of polynomials modulo a prime
• Reconstructing noisy polynomial evaluation in residue rings
• Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
• Minkowski's Convex Body Theorem and Integer Programming
• Reconstructing Truncated Integer Variables Satisfying Linear Congruences
• Inferring sequences produced by pseudo-random number generators
• How to predict congruential generators
• Predicting nonlinear pseudorandom number generators
• Sparsity of curves and additive and multiplicative expansion of rational maps over finite fields
• A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
• A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
• Additive energy and a large sieve inequality for sparse sequences

This page was built for publication: Reconstructing points of superelliptic curves over a prime finite field