Enes Pasalic
Orcid: 0000-0001-6343-8796
According to our database1,
Enes Pasalic
authored at least 124 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
Vectorial Boolean functions with the maximum number of bent components beyond the Nyberg's bound.
Des. Codes Cryptogr., March, 2024
Novel Optimized Implementations of Lightweight Cryptographic S-Boxes via SAT Solvers.
IEEE Trans. Circuits Syst. I Regul. Pap., January, 2024
CoRR, 2024
2023
Cryptogr. Commun., May, 2023
IEEE Trans. Inf. Theory, April, 2023
A design and flexible assignment of orthogonal binary sequence sets for (QS)-CDMA systems.
Des. Codes Cryptogr., February, 2023
IACR Cryptol. ePrint Arch., 2023
Explicit infinite families of bent functions outside the completed Maiorana-McFarland class.
Des. Codes Cryptogr., 2023
Bent functions satisfying the dual bent condition and permutations with the A<sub>m</sub> property.
CoRR, 2023
2022
Int. J. Distributed Sens. Networks, 2022
Applications of the indirect sum in the design of several special classes of bent functions outside the completed <i>MM</i> class.
IACR Cryptol. ePrint Arch., 2022
IACR Cryptol. ePrint Arch., 2022
Des. Codes Cryptogr., 2022
Des. Codes Cryptogr., 2022
Des. Codes Cryptogr., 2022
A complete characterization of ${\mathcal {D}}_0 \cap {\mathcal {M}}^\#$ and a general framework for specifying bent functions in <i>C</i> outside <i>M</i><sup>#</sup>.
Des. Codes Cryptogr., 2022
Quadratic almost bent functions - Their partial characterization and design in the spectral domain.
Discret. Appl. Math., 2022
Constructions of (vectorial) bent functions outside the completed Maiorana-McFarland class.
Discret. Appl. Math., 2022
Permutations without linear structures inducing bent functions outside the completed Maiorana-McFarland class.
Cryptogr. Commun., 2022
Cryptogr. Commun., 2022
2021
Characterization of Basic 5-Value Spectrum Functions Through Walsh-Hadamard Transform.
IEEE Trans. Inf. Theory, 2021
Secur. Commun. Networks, 2021
Constructions of balanced Boolean functions on even number of variables with maximum absolute value in autocorrelation spectra 2n2<sup>☆</sup>.
Inf. Sci., 2021
Des. Codes Cryptogr., 2021
Des. Codes Cryptogr., 2021
Vectorial bent functions weakly/strongly outside the completed Maiorana-McFarland class.
Discret. Appl. Math., 2021
Proving the conjecture of O'Donnell in certain cases and disproving its general validity.
Discret. Appl. Math., 2021
Cryptogr. Commun., 2021
Transparency Order of (n, m)-Functions - Its Further Characterization and Applications.
Proceedings of the Information Security - 24th International Conference, 2021
Impossible Differential Cryptanalysis and Integral Cryptanalysis of the ACE-Class Permutation.
Proceedings of the Information Security Practice and Experience: 16th International Conference, 2021
Proceedings of the Information Security and Cryptology - 17th International Conference, 2021
2020
Further study on constructing bent functions outside the completed Maiorana-McFarland class.
IET Inf. Secur., 2020
A huge class of infinite sequences of minimal binary linear codes with or without crossing the Ashikhmin-Barg's bound.
IACR Cryptol. ePrint Arch., 2020
Bent functions stemming from Maiorana-McFarland class being provably outside its completed version.
IACR Cryptol. ePrint Arch., 2020
IACR Cryptol. ePrint Arch., 2020
Several classes of minimal binary linear codes violating the Aschikhmin-Barg's bound.
IACR Cryptol. ePrint Arch., 2020
Specifying cycles of minimal length for commonly used linear layers in block ciphers.
IACR Cryptol. ePrint Arch., 2020
Des. Codes Cryptogr., 2020
Further analysis of bent functions from C and D which are provably outside or inside M#.
Discret. Appl. Math., 2020
Efficient design methods of low-weight correlation-immune functions and revisiting their basic characterization.
Discret. Appl. Math., 2020
2019
Improved Security Evaluation of SPN Block Ciphers and its Applications in the Single-key Attack on SKINNY.
IACR Trans. Symmetric Cryptol., 2019
Correction to "Large Sets of Orthogonal Sequences Suitable for Applications in CDMA Systems".
IEEE Trans. Inf. Theory, 2019
IEEE Trans. Inf. Theory, 2019
IEEE Trans. Inf. Theory, 2019
IET Inf. Secur., 2019
Cryptogr. Commun., 2019
Frobenius linear translators giving rise to new infinite classes of permutations and bent functions.
Cryptogr. Commun., 2019
2018
Generalized Nonlinear Invariant Attack and a New Design Criterion for Round Constants.
IACR Trans. Symmetric Cryptol., 2018
Large Sets of Disjoint Spectra Plateaued Functions Inequivalent to Partially Linear Functions.
IEEE Trans. Inf. Theory, 2018
IEEE Trans. Inf. Theory, 2018
Full Characterization of Generalized Bent Functions as (Semi)-Bent Spaces, Their Dual, and the Gray Image.
IEEE Trans. Inf. Theory, 2018
Discret. Appl. Math., 2018
2017
Constructing Bent Functions Outside the Maiorana-McFarland Class Using a General Form of Rothaus.
IEEE Trans. Inf. Theory, 2017
Efficient implementation of generalized Maiorana-McFarland class of cryptographic functions.
J. Cryptogr. Eng., 2017
Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria.
Inf. Sci., 2017
New constructions of resilient functions with strictly almost optimal nonlinearity via non-overlap spectra functions.
Inf. Sci., 2017
Efficient probabilistic algorithm for estimating the algebraic properties of Boolean functions for large n.
Inf. Sci., 2017
Construction of resilient S-boxes with higher-dimensional vectorial outputs and strictly almost optimal non-linearity.
IET Inf. Secur., 2017
Discret. Appl. Math., 2017
An analysis of root functions - A subclass of the Impossible Class of Faulty Functions (ICFF).
Discret. Appl. Math., 2017
Adv. Math. Commun., 2017
Proceedings of the Codes, Cryptology and Information Security, 2017
2016
IEEE Trans. Inf. Theory, 2016
Int. J. Comput. Math., 2016
A GMM type construction for resilient S-boxes with higher-dimensional vectorial outputs and strictly almost optimal nonlinearity.
IACR Cryptol. ePrint Arch., 2016
Infinite classes of vectorial plateaued functions, permutations and complete permutations.
Discret. Appl. Math., 2016
Optimizing the placement of tap positions and guess and determine cryptanalysis with variable sampling.
CoRR, 2016
2015
Constructions of Bent - Negabent Functions and Their Relation to the Completed Maiorana - McFarland Class.
IEEE Trans. Inf. Theory, 2015
On cross-correlation properties of S-boxes and their design using semi-bent functions.
Secur. Commun. Networks, 2015
Corrigendum to "A note on nonexistence of vectorial bent functions with binomial trace representation in the PS<sup>-</sup> class" [Information Processing Letters 115 (2) (2015) 139-140].
Inf. Process. Lett., 2015
A note on nonexistence of vectorial bent functions with binomial trace representation in the PS<sup>-</sup> class.
Inf. Process. Lett., 2015
Generalized Bent Functions - Some General Construction Methods and Related Necessary and Sufficient Conditions.
Cryptogr. Commun., 2015
2014
IEEE Trans. Inf. Theory, 2014
Generalized Maiorana-McFarland Construction of Resilient Boolean Functions With High Nonlinearity and Good Algebraic Properties.
IEEE Trans. Inf. Theory, 2014
Constructions of Resilient S-Boxes With Strictly Almost Optimal Nonlinearity Through Disjoint Linear Codes.
IEEE Trans. Inf. Theory, 2014
Vectorial Hyperbent Trace Functions From the ℙ𝕊<sub>ap</sub> Class - Their Exact Number and Specification.
IEEE Trans. Inf. Theory, 2014
IEEE Trans. Inf. Theory, 2014
The higher-order meet-in-the-middle attack and its application to the Camellia block cipher.
Theor. Comput. Sci., 2014
Key recovery attacks on Grain family using BSW sampling and certain weaknesses of the filtering function.
IACR Cryptol. ePrint Arch., 2014
A note on complete polynomials over finite fields and their applications in cryptography.
Finite Fields Their Appl., 2014
Proceedings of the Cryptography and Information Security in the Balkans, 2014
2013
IEEE Trans. Inf. Theory, 2013
IET Inf. Secur., 2013
Generic related-key and induced chosen IV attacks using the method of key differentiation.
IACR Cryptol. ePrint Arch., 2013
2012
IEEE Trans. Inf. Theory, 2012
On the Construction of Cryptographically Significant Boolean Functions Using Objects in Projective Geometry Spaces.
IEEE Trans. Inf. Theory, 2012
A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation.
Cryptogr. Commun., 2012
Proceedings of the Advances in Information and Computer Security, 2012
2011
IEEE Trans. Inf. Theory, 2011
2010
Some results concerning cryptographically significant mappings over GF(2<sup><i>n</i></sup>).
Des. Codes Cryptogr., 2010
2009
Probabilistic versus deterministic algebraic cryptanalysis: a performance comparison.
IEEE Trans. Inf. Theory, 2009
IEEE Trans. Inf. Theory, 2009
2008
Proceedings of the Arithmetic of Finite Fields, 2nd International Workshop, 2008
Almost Fully Optimized Infinite Classes of Boolean Functions Resistant to (Fast) Algebraic Cryptanalysis.
Proceedings of the Information Security and Cryptology, 2008
2006
IEEE Trans. Inf. Theory, 2006
A Maiorana-McFarland type construction for resilient Boolean functions on <i>n</i> variables (<i>n</i> even) with nonlinearity >2<sup><i>n</i>-1</sup>-2<sup><i>n</i>/2</sup>+2<sup><i>n</i>/2-2</sup>.
Discret. Appl. Math., 2006
2005
Des. Codes Cryptogr., 2005
2004
Proceedings of the Advances in Cryptology, 2004
2003
IEEE Trans. Inf. Theory, 2003
Proceedings of the Cryptography and Coding, 2003
2002
Linear codes in generalized construction of resilient functions with very high nonlinearity.
IEEE Trans. Inf. Theory, 2002
IEEE Trans. Inf. Theory, 2002
Proceedings of the Selected Areas in Cryptography, 2002
2001
Proceedings of the Selected Areas in Cryptography, 8th Annual International Workshop, 2001
2000
New Constructions of Resilent and Correlation Immune Boolean Functions achieving Upper Bounds on Nonlinearity.
IACR Cryptol. ePrint Arch., 2000
1999
Further Results on the Relation Between Nonlinearity and Resiliency for Boolean Functions.
Proceedings of the Cryptography and Coding, 1999