Sciweavers

673 search results - page 41 / 135
» Biometric random number generators
Sort
View
EUROGP
2001
Springer
103views Optimization» more  EUROGP 2001»
14 years 7 days ago
Computational Complexity, Genetic Programming, and Implications
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
Bart Rylander, Terence Soule, James A. Foster
SAC
2010
ACM
14 years 2 months ago
Tracking random finite objects using 3D-LIDAR in marine environments
This paper presents a random finite set theoretic formulation for multi-object tracking as perceived by a 3D-LIDAR in a dynamic environment. It is mainly concerned with the joint...
Kwang Wee Lee, Bharath Kalyan, W. Sardha Wijesoma,...
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
13 years 9 months ago
Reconstructing strings from random traces
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andre...
CRYPTO
2004
Springer
119views Cryptology» more  CRYPTO 2004»
14 years 1 months ago
Security of Random Feistel Schemes with 5 or More Rounds
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
Jacques Patarin
IJNSEC
2010
143views more  IJNSEC 2010»
13 years 2 months ago
Nonce Generation For The Digital Signature Standard
Digital Signature Algorithm (DSA) is an underlying algorithm to form a signature in the Digital Signature Standard (DSS). DSA uses a new random number (or nonce) each time a signa...
Rajendra S. Katti, Rajesh G. Kavasseri