Date: 2006-07-27 09:21:33Cryptographic protocols Public-key cryptography Diffie–Hellman problem Diffie–Hellman key exchange XTR Discrete logarithm ElGamal encryption Subliminal channels RSA Cryptography Computational hardness assumptions Finite fields | | Minding your p’s and q’s Ross Anderson1 , Serge Vaudenay2 1 Computer Laboratory, Pembroke Street, Cambridge, CB2 3QG, England Ecole Normal Sup´erieure — DMI, 45 rue d’Ulm, 75230 Paris, FranceAdd to Reading ListSource URL: book.huihoo.comDownload Document from Source Website File Size: 143,86 KBShare Document on Facebook
|