On Verification of Restricted Extended Affine Equivalence of Vectorial Boolean Functions

dc.contributor.authorOzbudak, Ferruh
dc.contributor.authorSinak, Ahmet
dc.contributor.authorYayla, Oguz
dc.date.accessioned2024-02-23T13:39:00Z
dc.date.available2024-02-23T13:39:00Z
dc.date.issued2015
dc.departmentNEÜen_US
dc.description5th International Workshop on the Arithmetic of Finite Fields (WAIFI) -- SEP 27-28, 2014 -- Gebze, TURKEYen_US
dc.description.abstractVectorial 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.en_US
dc.identifier.doi10.1007/978-3-319-16277-5_8
dc.identifier.endpage154en_US
dc.identifier.isbn978-3-319-16276-8
dc.identifier.isbn978-3-319-16277-5
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.scopus2-s2.0-84923531994en_US
dc.identifier.scopusqualityQ3en_US
dc.identifier.startpage137en_US
dc.identifier.urihttps://doi.org/10.1007/978-3-319-16277-5_8
dc.identifier.urihttps://hdl.handle.net/20.500.12452/10672
dc.identifier.volume9061en_US
dc.identifier.wosWOS:000354609600008en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherSpringer-Verlag Berlinen_US
dc.relation.ispartofArithmetic Of Finite Fields (Waifi 2014)en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectVectorial Boolean Functionsen_US
dc.subjectEa-Equivalenceen_US
dc.subjectRea-Equivalenceen_US
dc.titleOn Verification of Restricted Extended Affine Equivalence of Vectorial Boolean Functionsen_US
dc.typeConference Objecten_US

Dosyalar