Back to Results
First PageMeta Content
Polynomials / Integer factorization algorithms / Public-key cryptography / Finite fields / XTR / Polynomial interpolation / Discrete Fourier transform / Polynomial / RSA / Mathematics / Abstract algebra / Mathematical analysis


Cryptanalysis of the RSA Subgroup Assumption from TCC 2005? Jean-S´ebastien Coron1 , Antoine Joux2,3 , Avradip Mandal1 , David Naccache4 , and Mehdi Tibouchi1,4 1 Universit´e du Luxembourg
Add to Reading List

Document Date: 2010-12-21 02:57:04

Open Document

File Size: 343,08 KB

Share Result on Facebook

City

Versailles Cedex / /

Company

Cambridge University Press / 3M / Intel / RSA Subgroup / /

Country

France / Luxembourg / /

/

Facility

Fast library / FLINT library / Sage Library / /

IndustryTerm

on-line auctions / z-transform algorithm / factor search / middle products / computing / basis conversion algorithms / middle product algorithm / middle product / /

NaturalFeature

FLINT / /

Organization

Cambridge University / Ecole polytechnique / European Commission / /

Person

Luca De Feo / Jens Groth / Marc Mezzarobba / /

Position

author / /

Product

Core2 Duo E8500 3.12 GHz / /

ProgrammingLanguage

C / /

Technology

z-transform algorithm / cryptography / attack #include Algorithm / middle product algorithm / algorithms Algorithm / Newton basis conversion algorithms / /

URL

www.flintlib.org / http /

SocialTag