Sciweavers

103 search results - page 8 / 21
» Cryptographic Functions and Design Criteria for Block Cipher...
Sort
View
88
Voted
ASIACRYPT
2005
Springer
15 years 5 months ago
Fast Computation of Large Distributions and Its Cryptographic Applications
Let X1, X2, . . . , Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute distributions like Pr{X1 ⊕ X2 ⊕ · · · ⊕ Xk} and ...
Alexander Maximov, Thomas Johansson
FPL
2004
Springer
143views Hardware» more  FPL 2004»
15 years 3 months ago
Exploring Area/Delay Tradeoffs in an AES FPGA Implementation
Abstract. Field-Programmable Gate Arrays (FPGAs) have lately become a popular target for implementing cryptographic block ciphers, as a well-designed FPGA solution can combine some...
Joseph Zambreno, David Nguyen, Alok N. Choudhary
INDOCRYPT
2003
Springer
15 years 4 months ago
Improved Cost Function in the Design of Boolean Functions Satisfying Multiple Criteria
We develop an improved cost function to be used in simulated annealing followed by hill-climbing to find Boolean functions satisfying multiple desirable criteria such as high nonli...
Selçuk Kavut, Melek D. Yücel
FSE
1993
Springer
101views Cryptology» more  FSE 1993»
15 years 3 months ago
SAFER K-64: A Byte-Oriented Block-Ciphering Algorithm
: A new non-proprietary secret-key block-enciphering algorithm, SAFER K-64 (for Secure And Fast Encryption Routine with a Key of length 64 bits) is described. The blocklength is 64...
James L. Massey
FSE
2003
Springer
137views Cryptology» more  FSE 2003»
15 years 4 months ago
Turing: A Fast Stream Cipher
Abstract. This paper proposes the Turing stream cipher. Turing offers up to 256-bit key strength, and is designed for extremely efficient software implementation.It combines an LFS...
Gregory G. Rose, Philip Hawkes