290 search results - page 44 / 58 » Pseudorandom Bits for Polynomials |
CRYPTO
2010
Springer
13 years 5 months ago
2010
Springer
We present a general method to compile any cryptographic algorithm into one which resists side channel attacks of the only computation leaks information variety for an unbounded nu...
Publication
An analysis is made of the impact of various design decisions on the error detection capability of the fiber distributed data interface (FDDI), a 100-Mb/s fiber-optic LAN stardard ...
CRYPTO
2003
Springer
14 years 1 months ago
2003
Springer
Many popular stream ciphers apply a filter/combiner to the state of one or several LFSRs. Algebraic attacks on such ciphers [10, 11] are possible, if there is a multivariate relat...
ASIAN
2004
Springer
14 years 6 days ago
2004
Springer
This paper presents a line of research in genetic algorithms (GAs), called building-block identification. The building blocks (BBs) are common structures inferred from a set of sol...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...