3238 search results - page 67 / 648 » Multi-return function call |
CRYPTO
2004
Springer
13 years 11 months ago
2004
Springer
Let f : {0, 1}n {0, 1}l be a one-way function. A function h : {0, 1}n {0, 1}m is called a hard-core function for f if, when given f(x) for a (secret) x drawn uniformly from {0, 1}n...
IJON
2006
13 years 7 months ago
2006
This article presents a new system for automatically constructing and training radial basis function networks based on original evolutionary computing methods. This system, called...
FSE
1999
Springer
14 years 2 days ago
1999
Springer
We study the functions from Fm 2 into Fm 2 for odd m which oppose an optimal resistance to linear cryptanalysis. These functions are called almost bent. It is known that almost ben...
ICANN
2009
Springer
14 years 2 months ago
2009
Springer
The best recent supervised sequence learning methods use gradient descent to train networks of miniature nets called memory cells. The most popular cell structure seems somewhat ar...
FSE
2005
Springer
14 years 1 months ago
2005
Springer
For the power consumption model called Hamming weight model, we rewrite DPA attacks in terms of correlation coefficients between two Boolean functions. We exhibit properties of S-b...