Back to Results
First PageMeta Content
Algebra / Polynomial ring / Polynomial / Euclidean algorithm / Factorization of polynomials over a finite field and irreducibility tests / Abstract algebra / Polynomials / Mathematics


J. Cryptology[removed]: 39–50 DOI: [removed]s00145[removed] © 2006 International Association for Cryptologic Research Deterministic Polynomial-Time Equivalence of
Add to Reading List

Document Date: 2014-12-02 03:11:30

Open Document

File Size: 229,58 KB

Share Result on Facebook

City

Darmstadt / /

Company

X5 / /

Country

Germany / Luxembourg / /

/

Facility

Shoup’s NTL library / Factoring Jean-S´ebastien Coron University of Luxembourg / /

IndustryTerm

deterministic polynomial-time algorithm / probabilistic polynomial-time algorithm / lattice reduction algorithm / Online publication / deterministic algorithm / exhaustive search / simpler algorithm / root-finding algorithm / /

Organization

Department of Computer Science / International Association for Cryptologic Research Deterministic Polynomial-Time Equivalence of Computing / RSA Secret Key and Factoring Jean-S´ebastien Coron University of Luxembourg / /

Person

Dan Boneh / /

/

SportsLeague

International Association / /

Technology

previous algorithm / public key / lattice reduction algorithm / LLL lattice reduction algorithm / root-finding algorithm / LLL algorithm / deterministic algorithm / 2 algorithm / simpler algorithm / Secret Key / The LLL algorithm / probabilistic polynomial-time algorithm / deterministic polynomial-time algorithm / two algorithms / then be recovered using any standard root-finding algorithm / /

SocialTag