Naor-Reingold Pseudorandom Function - PDFSEARCH.IO - Document Search Engine

Naor-Reingold Pseudorandom Function
Results: 12

#	Item
1	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 Source URL: eprint.iacr.org Language: English - Date: 2008-11-30 10:17:55 Ring theory Finite fields Theoretical computer science Diffie–Hellman problem XTR Polynomial ring Algorithm Ring Naor-Reingold Pseudorandom Function Abstract algebra Algebra Mathematics
2	An Improved Pseudorandom Generator Based on Hardness of Factoring Nenad Dedi´c Boston University Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2002-08-27 12:28:51 Pseudorandomness Pseudorandom number generators Computational complexity theory Algorithmic information theory Pseudorandom generator Hard-core predicate XTR One-way function Naor-Reingold Pseudorandom Function Theoretical computer science Cryptography Applied mathematics
3	CS255: Cryptography and Computer Security Winter 2002 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2004-01-05 17:05:04 Cryptographic protocols Diffie–Hellman key exchange Finite fields RSA Euclidean algorithm Naor-Reingold Pseudorandom Function Cryptography Mathematics Public-key cryptography
4	CS255: Cryptography and Computer Security Winter 2002 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2006-01-11 14:38:17 Cryptographic protocols Diffie–Hellman key exchange Finite fields RSA Euclidean algorithm Naor-Reingold Pseudorandom Function Cryptography Mathematics Public-key cryptography
5	CS255: Cryptography and Computer Security Winter 2002 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2003-01-05 20:38:49 Cryptographic protocols Diffie–Hellman key exchange Finite fields RSA Euclidean algorithm Naor-Reingold Pseudorandom Function Cryptography Mathematics Public-key cryptography
6	CS255: Cryptography and Computer Security Winter 2002 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2002-03-21 01:47:16 Cryptographic protocols Diffie–Hellman key exchange Finite fields RSA Euclidean algorithm Naor-Reingold Pseudorandom Function Cryptography Mathematics Public-key cryptography
7	CS255: Cryptography and Computer Security Winter 2002 Final Exam Instructions Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2005-01-04 13:22:38 Cryptographic protocols Diffie–Hellman key exchange Finite fields RSA Euclidean algorithm Naor-Reingold Pseudorandom Function Cryptography Mathematics Public-key cryptography
8	Kleptography: Using Cryptography Against Cryptography Adam Young* and Add to Reading List Source URL: cryptome.org Language: English - Date: 2013-09-12 07:28:33 Finite fields Cryptographic protocols Diffie–Hellman key exchange Kleptography XTR RSA Key management Discrete logarithm Naor-Reingold Pseudorandom Function Cryptography Abstract algebra Public-key cryptography
9	Efficient Pseudorandom Functions From the Decisional Linear Assumption and Weaker Variants Allison B. Lewko ∗ University of Texas at Austin Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2009-10-16 13:57:22 Pseudorandomness Computational hardness assumptions Pseudorandom number generators Algorithmic information theory Pseudorandom generator Naor-Reingold Pseudorandom Function Decisional Diffie–Hellman assumption Pseudorandom function family Randomized algorithm Cryptography Theoretical computer science Applied mathematics
10	CS255: Cryptography and Computer Security Winter 2002 Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2007-01-06 01:59:49 Cryptographic protocols Diffie–Hellman key exchange Finite fields RSA Euclidean algorithm Naor-Reingold Pseudorandom Function Cryptography Mathematics Public-key cryptography