About: Coppersmith method

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Coppersmith method Goto Sponge NotDistinct Permalink

An Entity of Type : yago:Rule105846932, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FCoppersmith_method&invfp=IFP_OFF&sas=SAME_AS_OFF

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.

Attributes	Values
rdf:type	software yago:WikicatAsymmetric-keyAlgorithms yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Algorithm105847438 yago:Event100029378 yago:Procedure101023820 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity yago:Rule105846932
rdfs:label	Coppersmith method (en) Coppersmith-methode (nl) Теорема Копперсмита (ru)
rdfs: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. (en) De Coppersmith methode is een factorisatie methode, voornamelijk toegepast in cryptografie. Don Coppersmith heeft verschillende bijdragen aan de cryptografie geleverd, waaronder twee stellingen in 1996 en 1997. (nl) Теорема Копперсмита (метод Копперсмита) — теорема, позволяющая эффективно найти все нули нормированных многочленов по определённому модулю. Теорема используется в основном для атак на криптосистему RSA. Этот метод является эффективным, если экспонента кодирования имеет достаточно малое значение, либо когда известна часть секретного ключа. Теорема также связана с LLL-алгоритмом. (ru)
dcterms:subject	1996 introductions Asymmetric-key algorithms
Wikipage page ID	25974284 (xsd:integer)
Wikipage revision ID	1060812846 (xsd:integer)
Link from a Wikipage to another Wikipage	Public key cryptography 1996 introductions Cryptography SageMath Modular arithmetic Asymmetric-key algorithms Coppersmith's attack Linear combination PARI/GP Lenstra–Lenstra–Lovász lattice basis reduction algorithm Zero of a function Don Coppersmith Polynomial Newton's method RSA (algorithm) Magma computer algebra system
Link from a Wikipage to an external page	https://iacr.org/archive/eurocrypt2004/30270487/bivariate.pdf https://iacr.org/archive/crypto2007/46220372/46220372.pdf
sameAs	Coppersmith method Coppersmith method Coppersmith method Coppersmith method Coppersmith method Coppersmith method
dbp:wikiPageUsesTemplate	dbt:Cite_journal dbt:Mvar
has 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. (en) De Coppersmith methode is een factorisatie methode, voornamelijk toegepast in cryptografie. Don Coppersmith heeft verschillende bijdragen aan de cryptografie geleverd, waaronder twee stellingen in 1996 en 1997. (nl) Теорема Копперсмита (метод Копперсмита) — теорема, позволяющая эффективно найти все нули нормированных многочленов по определённому модулю. Теорема используется в основном для атак на криптосистему RSA. Этот метод является эффективным, если экспонента кодирования имеет достаточно малое значение, либо когда известна часть секретного ключа. Теорема также связана с LLL-алгоритмом. (ru)
gold:hypernym	Method
prov:wasDerivedFrom	wikipedia-en:Coppersmith_method?oldid=1060812846&ns=0
page length (characters) of wiki page	4514 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Coppersmith_method
is Link from a Wikipage to another Wikipage of	Coppersmith theorem Coppersmith's attack Function field sieve Lenstra–Lenstra–Lovász lattice basis reduction algorithm Don Coppersmith ROCA vulnerability
is Wikipage redirect of	Coppersmith theorem
is foaf:primaryTopic of	wikipedia-en:Coppersmith_method

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software