13214 search results - page 15 / 2643 » Pseudorandomness for network algorithms |
218
click to vote
FPGA
2008
ACM
15 years 7 months ago
2008
ACM
Stochastic simulations and other scientific applications that depend on random numbers are increasingly implemented in a parallelized manner in programmable logic. High-quality ps...
153
click to vote
JSS
2007
15 years 5 months ago
2007
This paper reports security problems with improper implementations of an improved version of FEA-M (fast encryption algorithm for multimedia). It is found that an implementation-d...
151
click to vote
ESANN
2006
15 years 6 months ago
2006
Abstract. Ensemble methods allow to improve the accuracy of classification methods. This work considers the application of one of these methods, named Rotation-based, when the clas...
132
click to vote
DATESO
2010
15 years 3 months ago
2010
Abstract. Quasigroups are a well-known combinatorial design equivalent to more familiar Latin squares. Because all possible elements of a quasigroup occur with equal probability, i...
167
click to vote
LATINCRYPT
2010
15 years 3 months ago
2010
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...