Propagation characteristics of RC5, RC6 and Twofish ciphers

Download

index.pdf

Date

2003

Author

Arıkan, Savaş

Metadata

Show full item record

Item Usage Stats

128
views

0
downloads

In this thesis, two finalists of the AES (Advanced Encryption Standard) contest, RC6 developed by Rivest et al, Twofish proposed by Schneier et al, and preceding algorithm of RC6 cipher, RC5, are studied. The strength of ciphers to cryptanalytic attacks is measured according to different criteria. The studied evaluation criteria are the avalanche criterion and its derivations. After theimplementation of the algorithms and the test procedures, they are compared with each other. Different test criteria, including avalanche criterion, avalanche weight distribution (AWD) for randomness of RC5, RC6 and Twofish algorithms are applied; and the S-boxes of the Twofish algorithm are analyzed according to nonlinearity criterion. The avalanche criteria results of RC6 and Twofish are compared with NIST (National Institute of Standards and Technology) Statistical Test Suite results.

Subject Keywords

Computer security, Block ciphers, RC5, RC6, Twofish, Avalanche criteria, Nonlinearity measure

URI

http://etd.lib.metu.edu.tr/upload/650/index.pdf
https://hdl.handle.net/11511/13865

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

Aalanche properties and randomness of the Twofish cipher El, Ömer; Yücel, Melek D; Department of Electrical and Electronics Engineering (2004) In this thesis, one finalist cipher of the Advanced Encryption Standard (AES) block cipher contest, Twofish proposed by Schneier et al, is studied in order to observe the validity of the statement made by Arikan about the randomness of the cipher, which contradicts National Institute of Standards and Technology (NIST)̕s results. The strength of the cipher to cryptanalytic attacks is investigated by measuring its randomness according to the avalanche criterion. The avalanche criterion results are compared wi...
High speed VLSI implementation of the Rijndael Encryption Algorithm Sever, Refik; Aşkar, Murat; Department of Electrical and Electronics Engineering (2003) This thesis study presents a high speed VLSI implementation of the Rijndael Encryption Algorithm, which is selected to be the new Advanced Encryption Standard (AES) Algorithm. Both the encryption and the decryption algorithms of Rijndael are implemented as a single ASIC. Although data size is fixed to 128 bits in the AES, our implementation supports all the data sizes of the original Rijndael Algorithm. The core is optimised for both area and speed. Using 149K gates in a 0.35-æm standard CMOS process, 132 M...
Implementation and comparison of the advanced encryption standard finalist algorithms on tms320c54x Serter, Ahmet Volkan; Yücel, Melek D; Department of Electrical and Electronics Engineering (2005) Implementation aspects of Advanced Encryption Standard (AES) Contest finalist algorithms (MARS, RC6, RIJNDAEL, SERPENT and TWOFISH) are studied on TMS320C54X processor. The C codes written by Brian Gladman in 1999 are adapted to TMS320C54X and the speed and memory usage values are compared with the adaptation of Karol Gorski and Michal Skalski̕s implementation in 1999. The effects of implementation environment are investigated by comparing the two implementations. The sensitivities of the finalist algorithm...
Multiobjective evolutionary feature subset selection algorithm for binary classification Deniz Kızılöz, Firdevsi Ayça; Coşar, Ahmet; Dökeroğlu, Tansel; Department of Computer Engineering (2016) This thesis investigates the performance of multiobjective feature subset selection (FSS) algorithms combined with the state-of-the-art machine learning techniques for binary classification problem. Recent studies try to improve the accuracy of classification by including all of the features in the dataset, neglecting to determine the best performing subset of features. However, for some problems, the number of features may reach thousands, which will cause too much computation power to be consumed during t...
Principal Coordinate Clustering SEKMEN, ali; ALDROUBİ, Akram; HAMM, Keaton; Koku, Ahmet Buğra (2017-12-14) This paper introduces a clustering algorithm, called principal coordinate clustering. It takes in a similarity matrix SW of a data matrix W and computes the singular value decomposition of SW to determine the principal coordinates to convert the clustering problem to a simpler domain. It is a relative of spectral clustering, however, principal coordinate clustering is easier to interpret, and gives a clear understanding of why it performs well. In a fashion, this gives intuition behind why spectral clusteri...

Citation Formats

S. Arıkan, “Propagation characteristics of RC5, RC6 and Twofish ciphers,” M.S. - Master of Science, Middle East Technical University, 2003.