Naor - PDFSEARCH.IO - Document Search Engine

Naor
Results: 103

#	Item
71	Microsoft Word - Cv-Miriam Naor 2015_new design Add to Reading List Source URL: elyon1.court.gov.il Language: English - Date: 2015-03-12 03:03:03 Supreme Court of Israel Supreme court Lithuanian Jews Eliezer Rivlin Dalia Dorner Israel Israeli Jews Israeli law
72	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
73	Friedgut–Kalai–Naor theorem for slices of the Boolean cube Yuval Filmus˚ Institute for Advanced Study, Princeton, NJ October 15, 2014 Abstract Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2014-10-15 11:15:14 Character encoding Physics Mathematics Fourier analysis Fourier transform Joseph Fourier
74	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
75	One-Time Signatures Revisited: Have They Become Practical? Dalit Naor∗ Amir Shenhav† Avishai Wool‡ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2005-12-02 02:25:54 Hashing Error detection and correction Digital signature Hash tree SHA-2 SHA-1 RSA Hash function Merkle signature scheme Cryptography Cryptographic hash functions Public-key cryptography
76	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
77	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
78	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
79	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
80	Games for Extracting Randomness∗ Ran Halprin and Moni Naor† Department of Computer Science and Applied Mathematics Weizmann Institute of Science {ran.halprin, moni.naor}@weizmann.ac.il Add to Reading List Source URL: cups.cs.cmu.edu Language: English - Date: 2009-06-18 19:46:36 Mathematics Randomness extractor Random number generation Pseudorandomness Min-entropy Entropy Random sequence One-time pad Statistical randomness Randomness Cryptography Applied mathematics

UPDATE