247 search results - page 37 / 50 » On Pseudorandom Generators in NC |
INFORMATICALT
2010
13 years 4 months ago
2010
This paper presents an entire chaos-based biometric remote user authentication scheme on tokens without using passwords. The proposed scheme is based on the chaotic hash function a...
TCOM
2008
13 years 7 months ago
2008
This paper proposes a general and systematic code design method to efficiently combine constrained codes with parity-check (PC) codes for optical recording. The proposed constraine...
COCO
2004
Springer
14 years 27 days ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
EUROCRYPT
2010
Springer
14 years 9 days ago
2010
Springer
This paper revisits the construction of Universal One-Way Hash Functions (UOWHFs) from any one-way function due to Rompel (STOC 1990). We give a simpler construction of UOWHFs, whi...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...