The following pages link to E. Pasalic (Q477606):
Displaying 50 items.
- (Q323070) (redirect page) (← links)
- Infinite classes of vectorial plateaued functions, permutations and complete permutations (Q323073) (← links)
- On multiple output bent functions (Q456135) (← links)
- A note on nonexistence of vectorial bent functions with binomial trace representation in the \(\mathcal{PS}^-\) class (Q477607) (← links)
- A note on non-splitting \(\mathbb Z\)-bent functions (Q509876) (← links)
- On derivatives of polynomials over finite fields through integration (Q516828) (← links)
- (Q662197) (redirect page) (← links)
- A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation (Q662198) (← links)
- Collisions for variants of the BLAKE hash function (Q765485) (← links)
- Efficient design methods of low-weight correlation-immune functions and revisiting their basic characterization (Q777373) (← links)
- New constructions of resilient functions with strictly almost optimal nonlinearity via non-overlap spectra functions (Q778439) (← links)
- Generalized bent functions -- some general construction methods and related necessary and sufficient conditions (Q892507) (← links)
- Construction methods for generalized bent functions (Q1701107) (← links)
- Design methods for semi-bent functions (Q1711436) (← links)
- Bent functions from nonlinear permutations and conversely (Q1733976) (← links)
- On derivatives of planar mappings and their connections to complete mappings (Q1801070) (← links)
- Some results concerning cryptographically significant mappings over \(\text{GF}(2^{n})\) (Q1960215) (← links)
- A general framework for secondary constructions of bent and plateaued functions (Q2004962) (← links)
- Wide minimal binary linear codes from the general Maiorana-Mcfarland class (Q2035453) (← links)
- Quadratic almost bent functions -- their partial characterization and design in the spectral domain (Q2081487) (← links)
- Constructing new superclasses of bent functions from known ones (Q2096652) (← links)
- Several classes of minimal binary linear codes violating the Ashikhmin-Barg bound (Q2120998) (← links)
- Constructions of (vectorial) bent functions outside the completed Maiorana-McFarland class (Q2127623) (← links)
- Permutations without linear structures inducing bent functions outside the completed Maiorana-McFarland class (Q2130030) (← links)
- Phase orthogonal sequence sets for (QS)CDMA communications (Q2132441) (← links)
- Minimal binary linear codes: a general framework based on bent concatenation (Q2132451) (← links)
- On characterization of transparency order for \((n, m)\)-functions (Q2151315) (← links)
- Transparency order of \((n, m)\)-functions -- its further characterization and applications (Q2154041) (← links)
- A complete characterization of \(\mathcal{D}_0 \cap\mathcal{M}^\#\) and a general framework for specifying bent functions in \(\mathcal{C}\) outside \(\mathcal{M}^\#\) (Q2161421) (← links)
- Frobenius linear translators giving rise to new infinite classes of permutations and bent functions (Q2179495) (← links)
- Further analysis of bent functions from \(\mathcal{C}\) and \(\mathcal{D}\) which are provably outside or inside \(\mathcal{M}^{\#} \) (Q2197458) (← links)
- Proving the conjecture of O'Donnell in certain cases and disproving its general validity (Q2217489) (← links)
- A new method for secondary constructions of vectorial bent functions (Q2234461) (← links)
- Three classes of balanced vectorial semi-bent functions (Q2243890) (← links)
- Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria (Q2282303) (← links)
- Efficient probabilistic algorithm for estimating the algebraic properties of Boolean functions for large \(n\) (Q2293177) (← links)
- Generic constructions of \(\mathbb{Z}\)-bent functions (Q2302160) (← links)
- Permutations via linear translators (Q2396747) (← links)
- Generalized bent functions -- sufficient conditions and related constructions (Q2408284) (← links)
- A note on complete polynomials over finite fields and their applications in cryptography (Q2434410) (← links)
- The higher-order meet-in-the-middle attack and its application to the Camellia block cipher (Q2437779) (← links)
- On generalized bent functions with Dillon's exponents (Q2445913) (← links)
- A Maiorana--McFarland type construction for resilient Boolean functions on \(n\) variables (\(n\) even) with nonlinearity \(>2^{n-1}-2^{n/2}+2^{n/2-2}\) (Q2489931) (← links)
- Highly nonlinear resilient functions through disjoint codes in projective spaces. (Q2572996) (← links)
- Vectorial bent functions weakly/strongly outside the completed Maiorana-McFarland class (Q2656963) (← links)
- A design and flexible assignment of orthogonal binary sequence sets for (QS)-CDMA systems (Q2698335) (← links)
- New constructions of resilient and correlation immune Boolean functions achieving upper bound on nonlinearity (Q2741405) (← links)
- On algebraic properties of S-boxes designed by means of disjoint linear codes (Q2804866) (← links)
- The Higher-Order Meet-in-the-Middle Attack and Its Application to the Camellia Block Cipher (Q2876936) (← links)
- Optimizing the Placement of Tap Positions (Q2947098) (← links)
