Sciweavers

290 search results - page 42 / 58
» Pseudorandom Bits for Polynomials
Sort
View
COMPSEC
2004
131views more  COMPSEC 2004»
13 years 8 months ago
Biometric random number generators
Abstract Up to now biometric methods have been used in cryptography for authentication purposes. In this paper we propose to use biological data for generating sequences of random ...
Janusz Szczepanski, Elek Wajnryb, José M. A...
PKC
2010
Springer
210views Cryptology» more  PKC 2010»
14 years 12 days ago
Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem
Abstract. In this paper, we fully break the Algebraic Surface Cryptosystem (ASC for short) proposed at PKC’2009 [3]. This system is based on an unusual problem in multivariate cr...
Jean-Charles Faugère, Pierre-Jean Spaenleha...
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
14 years 19 days ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
FOCS
1989
IEEE
14 years 15 days ago
Constant Depth Circuits, Fourier Transform, and Learnability
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
Nathan Linial, Yishay Mansour, Noam Nisan
CORR
2011
Springer
143views Education» more  CORR 2011»
13 years 7 days ago
Non-malleable extractors via character sums
In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor. A non-malleable extractor dramat...
Trevor D. Wooley, David Zuckerman