530 search results - page 7 / 106 » Universal randomized switching |
103
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
107
click to vote
MST
2006
15 years 1 months ago
2006
We investigate the characterizations of effective randomness in terms of Martin-L
102
Voted
CHES
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. It has recently been shown that logic circuits in the implementation of cryptographic algorithms, although protected by “secure” random masking schemes, leak side-cha...
111
click to vote
FOCS
1989
IEEE
15 years 5 months ago
1989
IEEE
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...