Fast cryptographic primitives and circular-secure encryption based on hard learning problems
The well-studied task of learning a linear function with errors is a seemingly hard problem
and the basis for several cryptographic schemes. Here we demonstrate additional …
and the basis for several cryptographic schemes. Here we demonstrate additional …
Security and privacy aspects of low-cost radio frequency identification systems
Like many technologies, low-cost Radio Frequency Identification (RFID) systems will
become pervasive in our daily lives when affixed to everyday consumer items as” smart …
become pervasive in our daily lives when affixed to everyday consumer items as” smart …
Number-theoretic constructions of efficient pseudo-random functions
M Naor, O Reingold - Journal of the ACM (JACM), 2004 - dl.acm.org
We describe efficient constructions for various cryptographic primitives in private-key as well
as public-key cryptography. Our main results are two new constructions of pseudo-random …
as public-key cryptography. Our main results are two new constructions of pseudo-random …
[PDF][PDF] Cryptographic approach to “privacy-friendly” tags
M Ohkubo, K Suzuki, S Kinoshita - RFID privacy workshop, 2003 - cop4708.pbworks.com
Cryptographic Approach to “Privacy-Friendly” Tags Cryptographic Approach to “Privacy-Friendly”
Tags Page 1 © copyright NTT Information Sharing Platform Laboratories Cryptographic …
Tags Page 1 © copyright NTT Information Sharing Platform Laboratories Cryptographic …
Cryptography in
We study the parallel time-complexity of basic cryptographic primitives such as one-way
functions (OWFs) and pseudorandom generators (PRGs). Specifically, we study the …
functions (OWFs) and pseudorandom generators (PRGs). Specifically, we study the …
[PDF][PDF] Security and privacy in radio-frequency identification devices
SA Weis - 2003 - dspace.mit.edu
Abstract Radio Frequency Identification (RFID) systems are a common and useful tool in
manufacturing, supply chain management and retail inventory control. Optical barcodes …
manufacturing, supply chain management and retail inventory control. Optical barcodes …
[图书][B] Cryptographic applications of analytic number theory: complexity lower bounds and pseudorandomness
I Shparlinski - 2013 - books.google.com
The book introduces new techniques that imply rigorous lower bounds on the com plexity of
some number-theoretic and cryptographic problems. It also establishes certain attractive …
some number-theoretic and cryptographic problems. It also establishes certain attractive …
Recent advances in the theory of nonlinear pseudorandom number generators
H Niederreiter, IE Shparlinski - Monte Carlo and Quasi-Monte Carlo …, 2002 - Springer
Recent Advances in the Theory of Nonlinear Pseudorandom Number Generators Page 1
Recent Advances in the Theory of Nonlinear Pseudorandom Number Generators Harald …
Recent Advances in the Theory of Nonlinear Pseudorandom Number Generators Harald …
Pseudorandom generators with long stretch and low locality from random local one-way functions
B Applebaum - Proceedings of the forty-fourth annual ACM symposium …, 2012 - dl.acm.org
We continue the study of locally-computable pseudorandom generators (PRG) G:{0, 1} n-
>{0, 1} m that each of their outputs depend on a small number of d input bits. While it is …
>{0, 1} m that each of their outputs depend on a small number of d input bits. While it is …
On Pseudorandom Generators in NC0
M Cryan, PB Miltersen - … Foundations of Computer Science 2001: 26th …, 2001 - Springer
In this paper we consider the question of whether NC 0 circuits can generate pseudorandom
distributions. While we leave the general question unanswered, we show• Generators …
distributions. While we leave the general question unanswered, we show• Generators …