On Verification of Restricted Extended Affine Equivalence of Vectorial Boolean Functions

Date

2015-02-01

Author

Özbudak, Ferruh
Yayla, Oğuz

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

183
views

0
downloads

Vectorial Boolean functions are used as substitution boxes in cryptosystems. Designing inequivalent functions resistant to known attacks is one of the challenges in cryptography. In doing this, finding a fast technique for determining whether two given functions are equivalent is a significant problem. A special class of the equivalence called restricted extended affine (REA) equivalence is studied in this paper. We update the verification procedures of the REA-equivalence types given in the recent work of Budaghyan and Kazymyrov (2012). In particular, we solve the system of linear equations simultaneously in the verification procedures to get better complexity. We also present the explicit number of operations of the verification procedures of these REA-equivalence types. Moreover, we construct two new REA-equivalence types and present the verification procedures of these types with their complexities.

Subject Keywords

Vectorial Boolean functions, EA-equivalence, REA-equivalence

URI

https://hdl.handle.net/11511/69540

Journal

Lecture Notes in Computer Science

DOI

https://doi.org/10.1007/978-3-319-16277-5_8

Collections

Department of Mathematics, Article

Suggestions

OpenMETU
Core

On verification of restricted extended affine equivalence of vectorial boolean functions Sınak, Ahmet; Özbudak, Ferruh; Yayla, Oğuz; Department of Cryptography (2012) 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) equivale...
Characterisation and enumeration of a class of semi bent quadratic Boolean functions KOÇAK, Neşe; Koçak, Onur Ozan; Özbudak, Ferruh; SAYGI, ZÜLFÜKAR (2015-01-01) In this paper, we consider semi-bentness of quadratic Boolean functions defined for even n and give the characterisation of these functions. Up to our knowledge, semi-bentness of this class has not been investigated before and we proved that semi-bent functions of this form exist only for 6|n. Furthermore, we present a method for enumeration of semi-bent and bent functions in certain classes. Using this method we find the exact number of semi-bent functions of this form. Moreover, we complete some previous ...
Integrable KdV systems: Recursion operators of degree four Gurses, M; Karasu, Atalay (1999-01-25) The recursion operator and bi-Hamiltonian formulation of the Drinfeld-Sokolov system are given. (C) 1999 Elsevier Science B.V.
On nonlinearity and hamming weight preserving bijective mappings acting on boolean functions Sertkaya, İsa; Doğanaksoy, Ali; Department of Cryptography (2014) Boolean functions are widely studied in cryptography due to their key role and ap- plications in various cryptographic schemes. Particularly in order to make symmetric crypto-systems resistant against cryptanalytic attacks, Boolean functions are associ- ated some cryptographic design criteria. As a result of Shannon’s similarity of secrecy systems theory, cryptographic design criteria should be at least preserved under the action of basic transformations. Among these design criteria, Meier and Staffelbach a...
On decoding interleaved reed-solomon codes Yayla, Oğuz; Özbudak, Ferruh; Department of Cryptography (2011) Probabilistic simultaneous polynomial reconstruction algorithm of Bleichenbacher-Kiayias-Yung is extended to the polynomials whose degrees are allowed to be distinct. Furthermore, it is observed that probability of the algorithm can be increased. Specifically, for a finite field $\F$, we present a probabilistic algorithm which can recover polynomials $p_1,\ldots, p_r \in \F[x]$ of degree less than $k_1,k_2,\ldots,k_r$, respectively with given field evaluations $p_l(z_i) = y_{i,l}$ for all $i \in I$, $

Citation Formats

F. Özbudak and O. Yayla, “On Verification of Restricted Extended Affine Equivalence of Vectorial Boolean Functions,” Lecture Notes in Computer Science, pp. 137–154, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/69540.