Reconstructing points of superelliptic curves over a prime finite field

DOI10.3934/AMC.2022022MaRDI QIDQ6089463FDO

Authors 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

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

Recommendations

• Recovering zeros of polynomials modulo a prime
• scientific article; zbMATH DE number 2081082
• The distribution of points on superelliptic curves over finite fields
• Rational Points on Certain Hyperelliptic Curves over Finite Fields
• Arithmetic on superelliptic curves

Cites work

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

Cited in

(1)

• Fixed points of the subset sum pseudorandom number generators

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

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