XTR

Results: 836



#Item
61Abstracting Cryptographic Protocols with Tree Automata ? David Monniaux http://www.di.ens.fr/%7Fmonniaux, ´ Laboratoire d’Informatique, Ecole

Abstracting Cryptographic Protocols with Tree Automata ? David Monniaux http://www.di.ens.fr/%7Fmonniaux, ´ Laboratoire d’Informatique, Ecole

Add to Reading List

Source URL: www-verimag.imag.fr

Language: English - Date: 2007-10-18 09:44:59
62Cascade Encryption Revisited Peter Gaˇzi1,2 and Ueli Maurer1 2  1

Cascade Encryption Revisited Peter Gaˇzi1,2 and Ueli Maurer1 2 1

Add to Reading List

Source URL: pub.ist.ac.at

Language: English - Date: 2014-06-19 17:30:22
63Improving Brumley and Boneh Timing Attack on Unprotected SSL Implementations Onur Acıic¸mez Werner Schindler

Improving Brumley and Boneh Timing Attack on Unprotected SSL Implementations Onur Acıic¸mez Werner Schindler

Add to Reading List

Source URL: tls.mbed.org

Language: English - Date: 2016-01-19 07:39:30
64Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture

Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture

Add to Reading List

Source URL: www.usenix.org

Language: English
65Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice

Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice

Add to Reading List

Source URL: aaspring.com

Language: English - Date: 2015-08-21 16:58:21
66Looking beyond XTR Wieb Bosma1 , James Hutton2 , and Eric R. Verheul3 1 Mathematisch Instituut, Universiteit Nijmegen, Postbus 9010, 6500 GL Nijmegen, The Netherlands,

Looking beyond XTR Wieb Bosma1 , James Hutton2 , and Eric R. Verheul3 1 Mathematisch Instituut, Universiteit Nijmegen, Postbus 9010, 6500 GL Nijmegen, The Netherlands,

Add to Reading List

Source URL: www.math.ru.nl

Language: English - Date: 2003-03-04 03:36:09
67Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice

Imperfect Forward Secrecy: How Diffie-Hellman Fails in Practice

Add to Reading List

Source URL: weakdh.org

Language: English - Date: 2015-10-15 14:53:20
68Covert Two-Party Computation Carnegie Mellon University 5000 Forbes Ave Pittsburgh, PANicholas Hopper

Covert Two-Party Computation Carnegie Mellon University 5000 Forbes Ave Pittsburgh, PANicholas Hopper

Add to Reading List

Source URL: hunch.net

Language: English - Date: 2005-03-01 11:04:04
69Explicit Primality Criteria for h #2k ± 1 Wieb Bosma Mathematics of Computation, Vol. 61, No. 203, Special Issue Dedicated to Derrick Henry Lehmer. (Jul., 1993), ppStable URL: http://links.jstor.org/sici?sici=

Explicit Primality Criteria for h #2k ± 1 Wieb Bosma Mathematics of Computation, Vol. 61, No. 203, Special Issue Dedicated to Derrick Henry Lehmer. (Jul., 1993), ppStable URL: http://links.jstor.org/sici?sici=

Add to Reading List

Source URL: www.math.ru.nl

Language: English - Date: 2008-03-28 07:26:11