Back to Results
First PageMeta Content
RSA / Strong RSA assumption / Optimal asymmetric encryption padding / Chosen-ciphertext attack / Ciphertext / Cryptanalysis / Cipher / Plaintext-aware encryption / Blum–Goldwasser cryptosystem / Cryptography / Public-key cryptography / RSA problem


RSA Problem Ronald L. Rivest, MIT Laboratory for Computer Science [removed]
Add to Reading List

Document Date: 2003-12-18 14:24:00

Open Document

File Size: 97,18 KB

Share Result on Facebook

City

Chicago / /

Company

Cambridge University Press / Plenum Press / RSA Laboratories / /

/

Facility

University of Wisconsin / /

IndustryTerm

probabilisitic polynomial-time algorithm / public network / modulus protocol / /

NaturalFeature

Singer Island / /

Organization

Cambridge University / University of Wisconsin / Milwaukee / MIT / /

Person

David Pointcheval / Ronald Cramer / Victor Shoup / Mihir Bellare / Benny Chor / H. W. Lenstra / Jr. / L. Lov´asz / Vijay Vazirani / Tal Rabin / Stefan Katzenbeisser / Leonard M. Adleman / Rosario Gennaro / Dan Boneh / Ronald L. Rivest / Eiichiro Fujisaki / Rajeev Motwani / Niko Bari / Shai Halevi / Tatsuaki Okamoto / Prabhakar Raghavan / Proc / Oded Goldreich / Umesh Vazirani / Jacques Stern / Phillip Rogaway / Birgit Pfitzmann / Proceedings Eurocrypt / Claus-Peter Schnorr / Gary L. Miller / A. K. Lenstra / Proceedings Crypto / Roger Fischlin / Adi Shamir / Burt Kaliski / /

Position

editor / Singer / /

Product

Franklin / /

ProgrammingLanguage

C / /

ProvinceOrState

Wisconsin / /

PublishedMedium

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

Technology

encryption / cryptography / modulus protocol / public key / public-key encryption / faster public-key encryption / LLL algorithm / private key / digital signature / probabilisitic polynomial-time algorithm / Public Key Encryption / /

URL

http /

SocialTag