Vectorial Boolean functions are used as S-boxes in cryptosystems. To design inequivalent vectorial Boolean functions resistant to known attacks is one of the challenges in cryptography. Verifying whether two vectorial Boolean functions are equivalent or not is the final step in this challenge. Hence, finding a fast technique for determining whether two given vectorial Boolean functions are equivalent is an important problem. A special class of the equivalence called restricted extended affine (REA) equivalence is studied in this thesis. We study the verification complexity of REA-equivalence of two vectorial Boolean functions for some types, namely types I to VI. We first review the verification of the REA-equivalence types I to IV given in the recent work of Budaghyan and Kazymyrov (2012). Furthermore, we present the complexities of the verification of REA-equivalence types I and IV in the case basic simultaneous Gaussian elimination method is used. Next, we present two new REA-equivalence types V and VI with their complexities. Finally, we give the algorithms of each type I to VI with their MAGMA codes.
| Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12615191/index.pdf |
| Date | 01 September 2012 |
| Creators | Sinak, Ahmet |
| Contributors | Ozbudak, Ferruh |
| Publisher | METU |
| Source Sets | Middle East Technical Univ. |
| Language | English |
| Detected Language | English |
| Type | M.S. Thesis |
| Format | text/pdf |
| Rights | Access forbidden for 1 year |
Page generated in 0.0011 seconds