Back to Results
First PageMeta Content
Ring theory / Finite fields / Theoretical computer science / Diffie–Hellman problem / XTR / Polynomial ring / Algorithm / Ring / Naor-Reingold Pseudorandom Function / Abstract algebra / Algebra / Mathematics


Lower Bounds on Black-Box Ring Extraction Tibor Jager and Andy Rupp , Horst G¨ ortz Institute for IT Security Ruhr-University Bochum, Germany
Add to Reading List

Document Date: 2008-11-30 10:17:55


Open Document

File Size: 201,21 KB

Share Result on Facebook

Company

Oracle / /

/

Facility

University Bochum / Horst G¨ ortz Institute / /

IndustryTerm

reduction algorithm / generic algorithm / subexponential-time algorithms / black-box ring extraction algorithm / direct product / inversion algorithm / generic algorithms / determinate algorithm / /

OperatingSystem

Xp / /

Organization

Horst G¨ ortz Institute for IT Security Ruhr-University Bochum / /

Person

Lj / Andy Rupp / /

Position

rt / /

PublishedMedium

Communications of the ACM / Lecture Notes in Computer Science / IEEE Transactions on Information Theory / /

Technology

encryption / black-box ring extraction algorithm / inversion algorithm / cryptography / BBRE algorithm / simulation / public key / determinate algorithm / subexponential-time algorithms / known algorithms / reduction algorithm / Diffie-Hellman protocol / /

SocialTag