Cryptanalysis of the SoDark family of cipher algorithms
Buettner, Raymond R.
MetadataShow full item record
The thesis studies the security of the SoDark family of cipher algorithms through cryptanalysis. The ciphers in question are used to protect messages sent by second- and third-generation automatic link establishment (ALE) systems for high frequency radios. Radios utilizing ALE technology are in use by a multitude of government and non-government organizations worldwide. Structural attacks on up to eight rounds based on differential properties are presented and implemented in practice. An efficient logic circuit representation of the only nonlinear component of the ciphers, the S-box, is generated. That representation, converted to conjunctive normal form (CNF), is used to perform key-recovery attacks on up to four rounds with the use of Boolean satisfiability problem (SAT) solvers. The logic circuit representation is further used to develop an efficient bitslicing CUDA implementation of the cipher. Its efficiency in attacking the cipher is demonstrated. The impact of the attacks on the ALE system is considered. Finally, the thesis includes suggestions regarding a replacement cipher and ideas for further cryptanalysis.
RightsCopyright is reserved by the copyright owner.
Showing items related by title, author, creator and subject.
Zillmer, Devon (Monterey, CA; Naval Postgraduate School, 2021-06);Encryption is ubiquitous in the modern environment. While public/private key architecture has provided an amazing and powerful way to encrypt information so that only one intended recipient can decrypt, the computation ...
Maitra, S.; Mandal, B.; Martinsen, T.; Roy, D.|Stănică, P. (IEEE, 2020);distributed. However, in the case of some stream ciphers, a keystream bit is generated by using a nonlinear Boolean function with inputs from a restricted domain. At Eurocrypt 2016, one such stream cipher (FLIP) has been ...
Wang, Qichun; Tan, Chick How; Stănică, Pantelimon (2014);To resis Binary Decision Diagrams (BDD) based attacks, a Boolean function should have a high BDD size. The hidden weighted bit function (HWBF), introduced by Bryant in 1991, seems to be the simplest function with exponential ...