Doug Whiting
Hifn
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Doug Whiting.
fast software encryption | 2000
Niels Ferguson; John Kelsey; Stefan Lucks; Bruce Schneier; Michael Stay; David A. Wagner; Doug Whiting
We improve the best attack on Rijndael reduced to 6 rounds from complexity 272 to 244. We also present the first known attacks on 7- and 8-round Rijndael. The attacks on 8-round Rijndael work for 192- bit and 256-bit keys. Finally, we discuss the key schedule of Rijndael and describe a related-key attack that can break 9-round Rijndael with 256-bit keys.
fast software encryption | 2003
Niels Ferguson; Doug Whiting; Bruce Schneier; John Kelsey; Stefan Lucks; Tadayoshi Kohno
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/authenticated message is low, making it suitable for small messages. It is efficient in both hardware and software, and with some pre-computation can effectively switch keys on a per-message basis without additional overhead.
selected areas in cryptography | 2001
Niels Ferguson; Richard Crabtree Schroeppel; Doug Whiting
We show that there is a very straightforward closed algebraic formula for the Rijndael block cipher. This formula is highly structured and far simpler then algebraic formulations of any other block cipher we know. The security of Rijndael depends on a new and untested hardness assumption: it is computationally infeasible to solve equations of this type. The lack of research on this new assumption raises concerns over the wisdom of using Rijndael for security-critical applications.
fast software encryption | 1997
Bruce Schneier; Doug Whiting
Most encryption algorithms are designed without regard to their performance on top-of-the-line microprocessors. This paper discusses general optimization principles algorithms designers should keep in mind when designing algorithms, and analyzes the performance of RC4, SEAL, RC5, Blowfish, and Khufu/Khafre on the Intel Pentium with respect to those principles. Finally, we suggest directions for algorithm design, and give example algorithms, that take performance into account.
selected areas in cryptography | 1998
Bruce Schneier; John Kelsey; Doug Whiting; David A. Wagner; Chris Hall
Twofish is a new block cipher with a 128 bit block, and a key length of 128, 192, or 256 bits, which has been submitted as an AES candidate. In this paper, we briefly review the structure of Twofish, and then discuss the key schedule of Twofish, and its resistance to attack. We close with some open questions on the security of Twofishs key schedule.
smart card research and advanced application conference | 1998
Bruce Schneier; Doug Whiting
Twofish is a 128-bit block cipher with a 128-, 192-, or 256-bit key. The algorithm was designed with smart cards in mind, and can be implemented on 8-bit CPUs with only 60 bytes of RAM. A variety of implementation options allows Twofish to encrypt and decrypt quicker if more RAM is available.
RFC | 2003
Doug Whiting; Russell Housley; Niels Ferguson
Archive | 1999
Bruce Schneier; John Kelsey; Doug Whiting; David A. Wagner; Chris Hall; Niels Ferguson
AES Candidate Conference | 1999
Bruce Schneier; John Kelsey; Doug Whiting; David A. Wagner; Chris Hall; Niels Ferguson
AES Candidate Conference | 2000
Bruce Schneier; Doug Whiting