<--- Back to Details
First PageDocument Content
Computational hardness assumptions / Electronic commerce / RSA / Cryptographic protocols / Leonard Adleman / Adi Shamir / Diffie–Hellman problem / Ron Rivest / Cipher / Cryptography / Public-key cryptography / Turing Award laureates
Date: 2004-04-09 16:58:07
Computational hardness assumptions
Electronic commerce
RSA
Cryptographic protocols
Leonard Adleman
Adi Shamir
Diffie–Hellman problem
Ron Rivest
Cipher
Cryptography
Public-key cryptography
Turing Award laureates

Add to Reading List

Source URL: www.msri.org

Download Document from Source Website

File Size: 769,20 KB

Share Document on Facebook

Similar Documents

On the Robustness of some Cryptographic Protocols for Mobile Agent Protection Volker Roth Fraunhofer Institut f¨ur Graphische Datenverarbeitung Rundeturmstraße 6, 64283 Darmstadt, Germany

DocID: 1uZJK - View Document

Verifying Cryptographic Protocols in Applied Pi Calculus Mark Ryan Ben Smyth

DocID: 1uXvn - View Document

Secure Cryptographic Protocols for E-commerce Transaction on the Internet

DocID: 1uDkO - View Document

Type-Based Automated Verification of Authenticity in Cryptographic Protocols Daisuke Kikuchi and Naoki Kobayashi Graduate School of Information Sciences, Tohoku University {kikuchi,koba}@kb.ecei.tohoku.ac.jp

DocID: 1u5Us - View Document

Cryptographic schemes Protocols Specifications of primitives

DocID: 1u4P2 - View Document