نتایج جستجو برای: rotary agitated extractors

تعداد نتایج: 13559  

2009
Avi Wigderson

Randomness extractors are efficient algorithms which convert weak random sources into nearly perfect ones. While such purification of randomness was the original motivation for constructing extractors, these constructions turn out to have strong pseudorandom properties which found applications in diverse areas of computer science and combinatorics. We will highlight some of the applications, as...

2006
J. Albert J. A. Barrio R. K. Bock A. De Angelis R. Garcia Lopez M. Garczarczyk D. Hakobyan M. Hayashida C. C. Hsu E. Lindfors P. Majumdar M. Mariotti R. Mirzoyan M. Pasanen E. Prandini L. S. Stark L. Takalo M. Teshima D. F. Torres N. Turini H. Vankov R. M. Wagner T. Wibig W. Wittek R. Zanin

The MAGIC telescope uses a 300 MHz FADC system to sample the shaped PMT signals produced by the captured Cherenkov photons of air showers. Different algorithms to reconstruct the signal from the read-out samples (extractors) have been developed and are described and compared. Criteria based on the obtained charge and time resolution/bias are defined and used to judge the different extractors, by

2009
Anindya De Luca Trevisan

Zimand [24] presented simple constructions of locally computable strong extractors whose analysis relies on the direct product theorem for one-way functions and on the Blum-Micali-Yao generator. For N -bit sources of entropy γN , his extractor has seed O(logN) and extracts N random bits. We show that his construction can be analyzed based solely on the direct product theorem for general functio...

2012
Daniil Musatov

An extractor is a function that receives some randomness and either “improves” it or produces “new” randomness. There are statistical and algorithmical specifications of this notion. We study an algorithmical one called Kolmogorov extractors and modify it to resourcebounded version of Kolmogorov complexity. Following Zimand we prove the existence of such objects with certain parameters. The uti...

Journal: :IACR Cryptology ePrint Archive 2013
Benjamin Fuller Xianrui Meng Leonid Reyzin

Fuzzy extractors derive strong keys from noisy sources. Their security is defined informationtheoretically, which limits the length of the derived key, sometimes making it too short to be useful. We ask whether it is possible to obtain longer keys by considering computational security, and show the following. • Negative Result: Noise tolerance in fuzzy extractors is usually achieved using an in...

Journal: :SIAM Journal on Computing 2011

Journal: :European Journal of Combinatorics 2016

2004
Yevgeniy Dodis Rosario Gennaro Johan Håstad Hugo Krawczyk Tal Rabin

We study the suitability of common pseudorandomness modes associated with cryptographic hash functions and block ciphers (CBCMAC, Cascade and HMAC) for the task of “randomness extraction”, namely, the derivation of keying material from semi-secret and/or semirandom sources. Important applications for such extractors include the derivation of strong cryptographic keys from non-uniform sources of...

Journal: :IACR Cryptology ePrint Archive 2014
Ran Canetti Benjamin Fuller Omer Paneth Leonid Reyzin

Fuzzy extractors (Dodis et al., Eurocrypt 2004) convert repeated noisy readings of a high-entropy secret into the same uniformly distributed key. To eliminate noise, they require an initial enrollment phase that takes the first noisy reading of the secret and produces a nonsecret helper string to be used in subsequent readings. This helper string reduces the entropy of the original secret—in th...

Journal: :PVLDB 2015
Yunyao Li Elmer Kim Marc A. Touchette Ramiya Venkatachalam Hao Wang

Information Extraction (IE) is the key technology enabling analytics over unstructured and semi-structured data. Not surprisingly, it is becoming a critical building block for a wide range of emerging applications. To satisfy the rising demands for information extraction in real-world applications, it is crucial to lower the barrier to entry for IE development and enable users with general comp...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید