Sciweavers

230 search results - page 35 / 46
» A Random Bit Generator Using Chaotic Maps
Sort
View
TOMACS
2011
139views more  TOMACS 2011»
13 years 2 months ago
The double CFTP method
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
Luc Devroye, Lancelot F. James
PROVSEC
2007
Springer
14 years 1 months ago
Stronger Security of Authenticated Key Exchange
In this paper we study security definitions for authenticated key exchange (AKE) protocols. We observe that there are several families of attacks on AKE protocols that lie outsid...
Brian A. LaMacchia, Kristin Lauter, Anton Mityagin
JOC
2008
92views more  JOC 2008»
13 years 7 months ago
Cryptanalysis of an E0-like Combiner with Memory
In this paper, we study an E0-like combiner with memory as the keystream generator. First, we formulate a systematic and simple method to compute correlations of the FSM output seq...
Yi Lu 0002, Serge Vaudenay
TCOM
2008
118views more  TCOM 2008»
13 years 6 months ago
Performance analysis for collaborative decoding with least-reliable-bits exchange on AWGN channels
Collaborative decoding is an approach that can achieve diversity and combining gain by exchanging decoding information among a cluster of physically separated receivers. On AWGN ch...
Xin Li, Tan F. Wong, John M. Shea
WWW
2007
ACM
14 years 8 months ago
GigaHash: scalable minimal perfect hashing for billions of urls
A minimal perfect function maps a static set of keys on to the range of integers {0,1,2, ... , - 1}. We present a scalable high performance algorithm based on random graphs for ...
Kumar Chellapilla, Anton Mityagin, Denis Xavier Ch...