5 Result(s)
within
Stefan Lucks
Algorithms
-
Chapter and Conference Paper
Linearity of the AES Key Schedule
The AES key schedule can almost be described as collection of 32 linear feedback shift registers LFSRs, working in parallel. This implies that for related keys, i.e., pairs of unknown keys with known differences,...
-
Chapter and Conference Paper
Helix: Fast Encryption and Authentication in a Single Cryptographic Primitive
Helix is a high-speed stream cipher with a built-in MAC functionality. On a Pentium II CPU it is about twice as fast as Rijndael or Twofish, and comparable in speed to RC4. The overhead per encrypted/authentic...
-
Chapter and Conference Paper
On the Security of the 128-bit Block Cipher DEAL
DEAL is a DES-based block cipher proposed by Knudsen. The block size of DEAL is 128 bits, twice as much as the DES block size. The main result of the current paper is a certificational attack on DEAL- 192, the...
-
Chapter and Conference Paper
Accelerated Remotely Keyed Encryption
Remotely keyed encryption schemes (RKESs) support fast encryption and decryption using low-bandwidth devices, such as secure smartcards. The long-lived secret keys never leave the smartcard, but most of the en...
-
Chapter and Conference Paper
How to exploit the intractability of exact TSP for cryptography
We outline constructions for both pseudo-random generators and one-way hash functions. These constructions are based on the exact TSP (XTSP), a special variant of the well known traveling salesperson problem. ...
