389 search results - page 23 / 78 » Computational Alternatives to Random Number Generators |
CRYPTO
2004
Springer
14 years 1 months ago
2004
Springer
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...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
ICCBR
2003
Springer
14 years 28 days ago
2003
Springer
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Proble...
IJON
1998
13 years 7 months ago
1998
The Generative Topographic Mapping (GTM) model was introduced by 7) as a probabilistic re-formulation of the self-organizing map (SOM). It offers a number of advantages compared ...
CEC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...