Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
On Verification of Restricted Extended Affine Equivalence of Vectorial Boolean Functions
Date
2014-09-28
Author
Özbudak, Ferruh
Yayla, Oğuz
Metadata
Show full item record
Item Usage Stats
72
views
0
downloads
Cite This
URI
https://hdl.handle.net/11511/83540
Collections
Unverified, Conference / Seminar
Suggestions
OpenMETU
Core
On Verification of Restricted Extended Affine Equivalence of Vectorial Boolean Functions
Özbudak, Ferruh; Yayla, Oğuz (2015-02-01)
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 ...
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...
On construction of recursion operators from Lax representation
Gurses, M; Karasu, Atalay; Sokolov, VV (1999-12-01)
In this work we develop a general procedure for constructing the recursion operators for nonlinear integrable equations admitting Lax representation. Several new examples are given. In particular, we find the recursion operators for some KdV-type systems of integrable equations. (C) 1999 American Institute of Physics. [S0022-2488(99)03212-0].
On characterization of a Riesz homomorphism on C(X)-space
AKKAR ERCAN, ZÜBEYDE MÜGE; Önal, Süleyman (Informa UK Limited, 2007-06-01)
Let X be a realcompact space. We present a very simple and elementary proof of the well known fact that every Riesz homomorphism pi : C(X) -> R is point evaluated. Moreover, the proof is given in ZF.
ON THE NUMERICAL EVALUATION OF AN OSCILLATING INFINITE SERIES-III
Tezer, Münevver (Informa UK Limited, 1990-01-01)
An oscillating infinite series involving product of Bessel function J o(x) and an oscillating infinite series involving trigonometric function sin(x) were evaluated and computed numerically in [1] and [2] respectively. In this paper, an oscillating infinite series involving product of exponential, Bessel and trigonometric functions is evaluated. The series is transformed first into the sum of two infinite integrals by using contour integration and then the infinite integral with oscillating integrand is tra...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
F. Özbudak and O. Yayla, “On Verification of Restricted Extended Affine Equivalence of Vectorial Boolean Functions,” 2014, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/83540.