Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Coppersmith_method> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- Coppersmith_method abstract "The Coppersmith method, proposed by Don Coppersmith, is a method to find small integer roots of polynomial equations. These polynomials can be univariate or bivariate. In cryptography the algorithm is mainly used in attacks on RSA when parts of the secret key are known. The method uses the LLL algorithm to find a polynomial that has the roots of the target polynomial as roots and has small coefficients. Coppersmith’s method is based on lattice reduction. A lattice L is a subgroup of . Also there exists a k such that , whereis a basis of L. The LLL algorithm computes a basisof short vectors.If k=n, the determinant of the lattice is given by det(L)=det(B); in general .For any LLL reduced basis it holds that, see.Let and assume that for someinteger .Coppersmith’s algorithm can be used to find this integer solution .Finding roots over Q is easy using e.g. Newton's method but these algorithms do not work modulo a composite number M. The idea behind Coppersmith’s method is to find a different polynomial related to F that has the same as a solution and has only small coefficients. If the coefficients and are so small that over the integers, then is a root of F over Q and can easily be found.".
- Coppersmith_method wikiPageID "25974284".
- Coppersmith_method wikiPageRevisionID "585544624".
- Coppersmith_method hasPhotoCollection Coppersmith_method.
- Coppersmith_method subject Category:Asymmetric-key_algorithms.
- Coppersmith_method type Abstraction100002137.
- Coppersmith_method type Act100030358.
- Coppersmith_method type Activity100407535.
- Coppersmith_method type Algorithm105847438.
- Coppersmith_method type Asymmetric-keyAlgorithms.
- Coppersmith_method type Event100029378.
- Coppersmith_method type Procedure101023820.
- Coppersmith_method type PsychologicalFeature100023100.
- Coppersmith_method type Rule105846932.
- Coppersmith_method type YagoPermanentlyLocatedEntity.
- Coppersmith_method comment "The Coppersmith method, proposed by Don Coppersmith, is a method to find small integer roots of polynomial equations. These polynomials can be univariate or bivariate. In cryptography the algorithm is mainly used in attacks on RSA when parts of the secret key are known. The method uses the LLL algorithm to find a polynomial that has the roots of the target polynomial as roots and has small coefficients. Coppersmith’s method is based on lattice reduction. A lattice L is a subgroup of .".
- Coppersmith_method label "Coppersmith method".
- Coppersmith_method label "Coppersmith-methode".
- Coppersmith_method sameAs Coppersmith-methode.
- Coppersmith_method sameAs m.0b6d6lv.
- Coppersmith_method sameAs Q2460488.
- Coppersmith_method sameAs Q2460488.
- Coppersmith_method sameAs Coppersmith_method.
- Coppersmith_method wasDerivedFrom Coppersmith_method?oldid=585544624.
- Coppersmith_method isPrimaryTopicOf Coppersmith_method.