Sciweavers

3328 search results - page 102 / 666
» On Plateaued Functions and Their Constructions
Sort
View
IFIP
2004
Springer
14 years 3 months ago
A Randomised Algorithm for Checking the Normality of Cryptographic Boolean Functions
Abstract A Boolean function is called normal if it is constant on flats of certain dimensions. This property is relevant for the construction and analysis of cryptosystems. This p...
An Braeken, Christopher Wolf, Bart Preneel
CRYPTO
1993
Springer
131views Cryptology» more  CRYPTO 1993»
14 years 2 months ago
Hash Functions Based on Block Ciphers: A Synthetic Approach
Constructions for hash functions based on a block cipher are studied where the size of the hashcode is equal to the block length of the block cipher and where the key size is appro...
Bart Preneel, René Govaerts, Joos Vandewall...
FSE
2008
Springer
115views Cryptology» more  FSE 2008»
13 years 11 months ago
On the Salsa20 Core Function
In this paper, we point out some weaknesses in the Salsa20 core function that could be exploited to obtain up to 231 collisions for its full (20 rounds) version. We first find an i...
Julio César Hernández Castro, Juan M...
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 10 months ago
Optimal topological simplification of discrete functions on surfaces
We solve the problem of minimizing the number of critical points among all functions on a surface within a prescribed distance from a given input function. The result is achieved...
Ulrich Bauer, Carsten Lange, Max Wardetzky
ENTCS
2007
112views more  ENTCS 2007»
13 years 10 months ago
Structure and Properties of Traces for Functional Programs
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
Olaf Chitil, Yong Luo