Sciweavers

290 search results - page 2 / 58
» Pseudorandom Bits for Polynomials
Sort
View
CRYPTO
2001
Springer
145views Cryptology» more  CRYPTO 2001»
13 years 9 months ago
Pseudorandomness from Braid Groups
Recently the braid groups were introduced as a new source for cryptography. The group operations are performed efficiently and the features are quite different from those of other...
Eonkyung Lee, Sangjin Lee, Sang Geun Hahn
ICALP
2011
Springer
12 years 8 months ago
New Algorithms for Learning in Presence of Errors
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...
Sanjeev Arora, Rong Ge
CTRSA
2003
Springer
105views Cryptology» more  CTRSA 2003»
13 years 10 months ago
Forward-Security in Private-Key Cryptography
This paper provides a comprehensive treatment of forward-security in the context of sharedkey based cryptographic primitives, as a practical means to mitigate the damage caused by...
Mihir Bellare, Bennet S. Yee
ICWE
2003
Springer
13 years 10 months ago
A Pseudorandom Bit Generator Based on Block Upper Triangular Matrices
The popularity of the Web has created a great marketplace for businesses to sell and showcase their products increasing the need for secure Web services such as SSL, TLS or SET. We...
Rafael Álvarez, Joan-Josep Climent, Leandro...
ITC
1996
IEEE
127views Hardware» more  ITC 1996»
13 years 9 months ago
Altering a Pseudo-Random Bit Sequence for Scan-Based BIST
This paper presents a low-overhead scheme for built-in self-test of circuits with scan. Complete (100%) fault coverage is obtained without modifying the function logic and without...
Nur A. Touba, Edward J. McCluskey