3328 search results - page 163 / 666 » On Plateaued Functions and Their Constructions |
137
click to vote
GLOBECOM
2008
IEEE
16 years 29 days ago
2008
IEEE
-- The substitution box (S-Box) is one of the most important components in modern ciphers. This paper reports a new class of S-Boxes defined by the logarithmic functions in GF(16)....
135
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...
157
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— We consider networks of input-to-state dynamically stable (ISDS) systems and provide a small gain condition under which the entire network is again ISDS. A Lyapunov for...
145
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean
166
click to vote
CTRSA
2008
Springer
15 years 8 months ago
2008
Springer
We motivate and describe the problem of finding protocols for multiparty computations that only use a single broadcast round per computation (latency-free computations). We show t...