Solving modular cubic equations with Coppersmith's method

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A new generalization of the KMOV cryptosystem
Factoring polynomials with rational coefficients
The discrete logarithm problem on elliptic curves of trace one
Small solutions to polynomial equations, and low exponent RSA vulnerabilities
Elliptic curves. A computational approach. With an appendix by Attila Pethö
The Arithmetic of Elliptic Curves
A public key cryptosystem and a signature scheme based on discrete logarithms
Elliptic Curve Cryptosystems
New directions in cryptography
A monte carlo method for factorization
A method for obtaining digital signatures and public-key cryptosystems
An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
Solving elliptic diophantine equations: the general cubic case
A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
Reducing elliptic curve logarithms to logarithms in a finite field
Evaluation of discrete logarithms in a group of 𝑝-torsion points of an elliptic curve in characteristic 𝑝
A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
Finding points on elliptic curves with Coppersmith's method

This page was built for publication: Solving modular cubic equations with Coppersmith's method

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