Enes Pasalic
Enes Pasalic
Verified email at upr.si
Title
Cited by
Cited by
Year
Algebraic attacks and decomposition of Boolean functions
W Meier, E Pasalic, C Carlet
International Conference on the Theory and Applications of Cryptographic …, 2004
6442004
Further constructions of resilient Boolean functions with very high nonlinearity
S Maitra, E Pasalic
Sequences and their Applications, 265-280, 2002
1432002
On bent and semi-bent quadratic Boolean functions
P Charpin, E Pasalic, C Tavernier
IEEE Transactions on Information Theory 51 (12), 4286-4298, 2005
1352005
New constructions of resilient and correlation immune Boolean functions achieving upper bound on nonlinearity
E Pasalic, S Maitra, T Johansson, P Sarkar
Electronic Notes in Discrete Mathematics 6, 158-167, 2001
1242001
A construction of resilient functions with high nonlinearity
T Johansson, E Pasalic
IEEE Transactions on Information Theory 49 (2), 494-501, 2003
952003
Linear codes in generalized construction of resilient functions with very high nonlinearity
E Pasalic, S Maitra
IEEE Transactions on Information Theory 48 (8), 2182-2191, 2002
572002
Further results on the relation between nonlinearity and resiliency for Boolean functions
E Pasalic, T Johansson
IMA International Conference on Cryptography and Coding, 35-44, 1999
571999
On propagation characteristics of resilient functions
P Charpin, E Pasalic
International Workshop on Selected Areas in Cryptography, 175-195, 2002
472002
On guess and determine cryptanalysis of LFSR-based stream ciphers
E Pasalic
IEEE Transactions on Information Theory 55 (7), 3398-3406, 2009
412009
Generalized Maiorana–McFarland construction of resilient Boolean functions with high nonlinearity and good algebraic properties
WG Zhang, E Pasalic
IEEE Transactions on Information Theory 60 (10), 6681-6695, 2014
402014
Constructions of resilient S-boxes with strictly almost optimal nonlinearity through disjoint linear codes
WG Zhang, E Pasalic
IEEE Transactions on Information Theory 60 (3), 1638-1651, 2014
352014
Almost fully optimized infinite classes of Boolean functions resistant to (fast) algebraic cryptanalysis
E Pasalic
International Conference on Information Security and Cryptology, 399-414, 2008
352008
A note on complete polynomials over finite fields and their applications in cryptography
A Muratović-Ribić, E Pasalic
Finite Fields and Their Applications 25, 306-315, 2014
332014
Highly nonlinear balanced S-boxes with good differential properties
WG Zhang, E Pasalic
IEEE Transactions on Information Theory 60 (12), 7970-7979, 2014
272014
Generalized bent functions-some general construction methods and related necessary and sufficient conditions
S Hodžić, E Pasalic
Cryptography and Communications 7 (4), 469-483, 2015
252015
Vectorial bent functions from multiple terms trace functions
A Muratović-Ribić, E Pasalic, S Bajrić
IEEE transactions on information theory 60 (2), 1337-1347, 2013
252013
Constructions of bent—negabent functions and their relation to the completed Maiorana—MCFArland class
F Zhang, Y Wei, E Pasalic
IEEE Transactions on Information Theory 61 (3), 1496-1506, 2015
242015
A note on generalized bent criteria for Boolean functions
S Gangopadhyay, E Pasalic, P Stănică
IEEE transactions on information theory 59 (5), 3233-3236, 2012
222012
Maiorana–McFarland class: Degree optimization and algebraic properties
E Pasalic
IEEE Transactions on Information Theory 52 (10), 4581-4594, 2006
222006
Degree optimized resilient Boolean functions from Maiorana-McFarland class
E Pasalic
IMA International Conference on Cryptography and Coding, 93-114, 2003
212003
The system can't perform the operation now. Try again later.
Articles 1–20