Reconstructing points of superelliptic curves over a prime finite field

DOI10.3934/AMC.2022022MaRDI QIDQ6089463FDOQ6089463

Authors: Jaime Gutierrez 

Publication date: 14 December 2023

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

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

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)

Cites Work

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