436 search results - page 20 / 88 » A Note on Negligible Functions |
DM
2006
13 years 8 months ago
2006
In 1983, Patterson and Wiedemann constructed Boolean functions on n = 15 input variables having nonlinearity strictly greater than 2n-1 -2 n-1 2 . Construction of Boolean function...
INTERACT
2003
13 years 9 months ago
2003
: In one study, people are observed to keep web information for later use through many different methods including the use of Bookmarks (or Favorites), self-addressed email, hand-w...
FSE
2009
Springer
14 years 9 months ago
2009
Springer
The EnRUPT hash functions were proposed by O'Neil, Nohl and Henzen [5] as candidates for the SHA-3 competition, organised by NIST [4]. The proposal contains seven concrete has...
FSE
2001
Springer
14 years 29 days ago
2001
Springer
PANAMA is a cryptographic module that was presented at the FSE Workshop in ’98 by Joan Daemen and Craig Clapp. It can serve both as a stream cipher and as a cryptographic hash fu...
CMMR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we present algorithms for the automatic timesynchronization of score-, MIDI- or PCM-data streams which represent the same polyphonic piano piece. In contras...