Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Coppersmith_method> ?p ?o }
Showing triples 1 to 35 of
35
with 100 triples per page.
- Coppersmith_method abstract "The Coppersmith method, proposed by Don Coppersmith, is a method to find small integer zeroes of univariate or bivariate polynomials modulo a given integer. The method uses the Lenstra–Lenstra–Lovász lattice basis reduction algorithm (LLL) to find a polynomial that has the same zeroes as the target polynomial but smaller coefficients.In cryptography, the Coppersmith method is mainly used in attacks on RSA when parts of the secret key are known and forms a base for Coppersmith's attack.".
- Coppersmith_method wikiPageID "25974284".
- Coppersmith_method wikiPageLength "3259".
- Coppersmith_method wikiPageOutDegree "13".
- Coppersmith_method wikiPageRevisionID "705793934".
- Coppersmith_method wikiPageWikiLink Category:Asymmetric-key_algorithms.
- Coppersmith_method wikiPageWikiLink Coppersmiths_attack.
- Coppersmith_method wikiPageWikiLink Cryptography.
- Coppersmith_method wikiPageWikiLink Don_Coppersmith.
- Coppersmith_method wikiPageWikiLink Lenstra–Lenstra–Lovász_lattice_basis_reduction_algorithm.
- Coppersmith_method wikiPageWikiLink Linear_combination.
- Coppersmith_method wikiPageWikiLink Modular_arithmetic.
- Coppersmith_method wikiPageWikiLink Newtons_method.
- Coppersmith_method wikiPageWikiLink Polynomial.
- Coppersmith_method wikiPageWikiLink Public-key_cryptography.
- Coppersmith_method wikiPageWikiLink RSA_(cryptosystem).
- Coppersmith_method wikiPageWikiLink Zero_of_a_function.
- Coppersmith_method wikiPageWikiLinkText "Coppersmith method".
- Coppersmith_method wikiPageUsesTemplate Template:Cite_journal.
- Coppersmith_method wikiPageUsesTemplate Template:Cleanup.
- Coppersmith_method wikiPageUsesTemplate Template:Expert-subject.
- Coppersmith_method wikiPageUsesTemplate Template:Multiple_issues.
- Coppersmith_method subject Category:Asymmetric-key_algorithms.
- Coppersmith_method hypernym Method.
- Coppersmith_method type Software.
- Coppersmith_method type Algorithm.
- Coppersmith_method type Page.
- Coppersmith_method comment "The Coppersmith method, proposed by Don Coppersmith, is a method to find small integer zeroes of univariate or bivariate polynomials modulo a given integer. The method uses the Lenstra–Lenstra–Lovász lattice basis reduction algorithm (LLL) to find a polynomial that has the same zeroes as the target polynomial but smaller coefficients.In cryptography, the Coppersmith method is mainly used in attacks on RSA when parts of the secret key are known and forms a base for Coppersmith's attack.".
- Coppersmith_method label "Coppersmith method".
- Coppersmith_method sameAs Q2460488.
- Coppersmith_method sameAs Coppersmith-methode.
- Coppersmith_method sameAs m.0b6d6lv.
- Coppersmith_method sameAs Q2460488.
- Coppersmith_method wasDerivedFrom Coppersmith_method?oldid=705793934.
- Coppersmith_method isPrimaryTopicOf Coppersmith_method.