Show simple item record

dc.contributor.authorIndrøy, John Petter
dc.date.accessioned2021-10-25T13:23:50Z
dc.date.available2021-10-25T13:23:50Z
dc.date.issued2021-10-27
dc.date.submitted2021-10-17T19:32:07.970Z
dc.identifiercontainer/ec/44/4a/e5/ec444ae5-7dab-43f1-986b-cef9c7e10aa6
dc.identifier.isbn9788230860922
dc.identifier.isbn9788230861486
dc.identifier.urihttps://hdl.handle.net/11250/2825441
dc.description.abstractIt is well established that a symmetric cipher may be described as a system of Boolean polynomials, and that the security of the cipher cannot be better than the difficulty of solving said system. Compressed Right-Hand Side (CRHS) Equations is but one way of describing a symmetric cipher in terms of Boolean polynomials. The first paper of this thesis provides a comprehensive treatment firstly of the relationship between Boolean functions in algebraic normal form, Binary Decision Diagrams and CRHS equations. Secondly, of how CRHS equations may be used to describe certain kinds of symmetric ciphers and how this model may be used to attempt a key-recovery attack. This technique is not left as a theoretical exercise, as the process have been implemented as an open-source project named CryptaPath. To ensure accessibility for researchers unfamiliar with algebraic cryptanalysis, CryptaPath can convert a reference implementation of the target cipher, as specified by a Rust trait, into the CRHS equations model automatically. CRHS equations are not limited to key-recovery attacks, and Paper II explores one such avenue of CRHS equations flexibility. Linear and differential cryptanalysis have long since established their position as two of the most important cryptanalytical attacks, and every new design since must show resistance to both. For some ciphers, like the AES, this resistance can be mathematically proven, but many others are left to heuristic arguments and computer aided proofs. This work is tedious, and most of the tools require good background knowledge of a tool/technique to transform a design to the right input format, with a notable exception in CryptaGraph. CryptaGraph is written in Rust and transforms a reference implementation into CryptaGraphs underlying data structure automatically. Paper II introduces a new way to use CRHS equations to model a symmetric cipher, this time in such a way that linear and differential trail searches are possible. In addition, a new set of operations allowing us to count the number of active S-boxes in a path is presented. Due to CRHS equations effective initial data compression, all possible trails are captured in the initial system description. As is the case with CRHS equations, the crux is the memory consumption. However, this approach also enables the graph of a CRHS equation to be pruned, allowing the memory consumption to be kept at manageable levels. Unfortunately, pruning nodes also means that we will lose valid, incomplete paths, meaning that the hulls found are probably incomplete. On the flip side, all paths, and their corresponding probabilities, found by the tool are guaranteed to be valid trails for the cipher. This theory is also implemented in an extension of CryptaPath, and the name is PathFinder. PathFinder is also able to automatically turn a reference implementation of a cipher into its CRHS equations-based model. As an additional bonus, PathFinder supports the reference implementation specifications specified by CryptaGraph, meaning that the same reference implementation can be used for both CryptaGraph and PathFinder. Paper III shifts focus onto symmetric ciphers designed to be used in conjunction with FHE schemes. Symmetric ciphers designed for this purpose are relatively new and have naturally had a strong focus on reducing the number of multiplications performed. A multiplication is considered expensive on the noise budget of the FHE scheme, while linear operations are viewed as cheap. These ciphers are all assuming that it is possible to find parameters in the various FHE schemes which allow these ciphers to work well in symbiosis with the FHE scheme. Unfortunately, this is not always possible, with the consequence that the decryption process becomes more costly than necessary. Paper III therefore proposes Fasta, a stream cipher which has its parameters and linear layer especially chosen to allow efficient implementation over the BGV scheme, particularly as implemented in the HElib library. The linear layers are drawn from a family of rotation-based linear transformations, as cyclic rotations are cheap to do in FHE schemes that allow packing of multiple plaintext elements in one FHE ciphertext. Fasta follows the same design philosophy as Rasta, and will never use the same linear layer twice under the same key. The result is a stream cipher tailor-made for fast evaluation in HElib. Fasta shows an improvement in throughput of a factor more than 7 when compared to the most efficient implementation of Rasta.en_US
dc.language.isoengen_US
dc.publisherThe University of Bergenen_US
dc.relation.haspartPaper I: Indrøy J.P., Costes N., Raddum H. (2021) Boolean Polynomials, BDDs and CRHS Equations - Connecting the Dots with CryptaPath. In: Dunkelman O., Jacobson, Jr. M.J., O'Flynn C. (eds) Selected Areas in Cryptography. SAC 2020. Lecture Notes in Computer Science, vol 12804. Springer, Cham. The article is available in the thesis file. The article is also available at: <a href=" https://doi.org/10.1007/978-3-030-81652-0_9" target="blank"> https://doi.org/10.1007/978-3-030-81652-0_9</a>en_US
dc.relation.haspartPaper II: Indrøy J.P., Raddum H. Trail Search with CRHS Equations. The submitted version is available in the thesis file.en_US
dc.relation.haspartPaper III: Cid C., Indrøy J.P., Raddum H. Fasta - a stream cipher for fast FHE evaluation. The submitted version is available in the thesis file.en_US
dc.rightsAttribution-NoDerivs (CC BY-ND). This item's rights statement or license does not apply to the included articles in the thesis.
dc.rights.urihttps://creativecommons.org/licenses/by-nd/4.0/
dc.titleSelected Topics in Cryptanalysis of Symmetric Ciphersen_US
dc.typeDoctoral thesisen_US
dc.date.updated2021-10-17T19:32:07.970Z
dc.rights.holderCopyright the Author.en_US
dc.description.degreeDoktorgradsavhandling
fs.unitcode12-12-0


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NoDerivs (CC BY-ND). This item's rights statement or license does not apply to the included articles in the thesis.
Except where otherwise noted, this item's license is described as Attribution-NoDerivs (CC BY-ND). This item's rights statement or license does not apply to the included articles in the thesis.