Wilfried Meidl

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 47

Top Topics

Boolean Functions

Top Venues

IEEE Trans. Inf. Theory

Cryptogr. Commun.

Des. Codes Cryptogr.

Publications

Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl
Amorphic association schemes from bent partitions. Discret. Math. 347 (1) (2024)
Nurdagül Anbar, Sadmir Kudin, Wilfried Meidl, Enes Pasalic, Alexandr Polujan
Vectorial Negabent Concepts: Similarities, Differences, and Generalizations. CoRR (2024)
Sezel Alkan, Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl
Bent Partitions and LP-Packings. IEEE Trans. Inf. Theory 70 (7) (2024)
Wilfried Meidl, Alexandr A. Polujan, Alexander Pott
Linear codes and incidence structures of bent functions and their generalizations. Discret. Math. 346 (1) (2023)
Lilya Budaghyan, Claude Carlet, Tor Helleseth, Wilfried Meidl
Editorial: Special issue on Boolean functions and their applications 2022. Cryptogr. Commun. 15 (6) (2023)
Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl
On generalized spread bent partitions. Cryptogr. Commun. 15 (6) (2023)
Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl
Generalized semifield spreads. Des. Codes Cryptogr. 91 (2) (2023)
Nurdagül Anbar, Tekgül Kalyci, Wilfried Meidl, Constanza Riera, Pantelimon Stanica
P℘N functions, complete mappings and quasigroup difference sets. CoRR (2022)
Wilfried Meidl
A survey on p-ary and generalized bent functions. Cryptogr. Commun. 14 (4) (2022)
Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl
Bent Partitions and Partial Difference Sets. IEEE Trans. Inf. Theory 68 (10) (2022)
Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl, László Mérai
On a Class of Functions With the Maximal Number of Bent Components. IEEE Trans. Inf. Theory 68 (9) (2022)
Nurdagül Anbar, Wilfried Meidl
Bent partitions. Des. Codes Cryptogr. 90 (4) (2022)
Ayça Çesmelioglu, Wilfried Meidl, Isabel Pirsic
Vectorial bent functions and partial difference sets. Des. Codes Cryptogr. 89 (10) (2021)
Wilfried Meidl, Isabel Pirsic
Bent and ${{\mathbb {Z}}}_{2^k}$-Bent functions from spread-like partitions. Des. Codes Cryptogr. 89 (1) (2021)
Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl
Analysis of (n, n)-Functions Obtained From the Maiorana-McFarland Class. IEEE Trans. Inf. Theory 67 (7) (2021)
Nurdagül Anbar, Canan Kasikci, Wilfried Meidl, Alev Topuzoglu
Shifted plateaued functions and their differential properties. Cryptogr. Commun. 12 (6) (2020)
Shuxing Li, Wilfried Meidl, Alexandr Polujan, Alexander Pott, Constanza Riera, Pantelimon Stanica
Vanishing Flats: A Combinatorial Viewpoint on the Planarity of Functions and Their Application. CoRR (2020)
Wilfried Meidl, Isabel Pirsic
-bent functions from spread-like partitions. CoRR (2020)
Shuxing Li, Wilfried Meidl, Alexandr Polujan, Alexander Pott, Constanza Riera, Pantelimon Stanica
Vanishing Flats: A Combinatorial Viewpoint on the Planarity of Functions and Their Application. IEEE Trans. Inf. Theory 66 (11) (2020)
Ayça Çesmelioglu, Wilfried Meidl, Alexander Pott
Vectorial bent functions in odd characteristic and their components. Cryptogr. Commun. 12 (5) (2020)
Wilfried Meidl, Alexandr A. Polujan, Alexander Pott
Linear codes and incidence structures of bent functions and their generalizations. CoRR (2020)
Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl, László Mérai
On functions with the maximal number of bent components. CoRR (2020)
Nurdagül Anbar, Wilfried Meidl, Alexander Pott
Equivalence for negabent functions and their relative difference sets. Discret. Appl. Math. 270 (2019)
Wilfried Meidl, Alexander Pott
Generalized bent functions into ℤ p k $\mathbb {Z}_{p^{k}}$ from the partial spread and the Maiorana-McFarland class. Cryptogr. Commun. 11 (6) (2019)
Nurdagül Anbar, Tekgül Kalayci, Wilfried Meidl
Determining the Walsh spectra of Taniguchi's and related APN-functions. Finite Fields Their Appl. 60 (2019)
Ayça Çesmelioglu, Wilfried Meidl
Bent and vectorial bent functions, partial difference sets, and strongly regular graphs. Adv. Math. Commun. 12 (4) (2018)
Thor Martinsen, Wilfried Meidl, Alexander Pott, Pantelimon Stanica
On Symmetry and Differential Properties of Generalized Boolean Functions. WAIFI (2018)
Nurdagül Anbar, Wilfried Meidl
Modified planar functions and their components. Cryptogr. Commun. 10 (2) (2018)
Wilfried Meidl
A secondary construction of bent functions, octal gbent functions and their duals. Math. Comput. Simul. 143 (2018)
Samir Hodzic, Wilfried Meidl, Enes Pasalic
Full Characterization of Generalized Bent Functions as (Semi)-Bent Spaces, Their Dual, and the Gray Image. IEEE Trans. Inf. Theory 64 (7) (2018)
Wilfried Meidl, Isabel Pirsic
On the normality of p-ary bent functions. Cryptogr. Commun. 10 (6) (2018)
Thor Martinsen, Wilfried Meidl, Sihem Mesnager, Pantelimon Stanica
Decomposing Generalized Bent and Hyperbent Functions. IEEE Trans. Inf. Theory 63 (12) (2017)
Nurdagül Anbar, Wilfried Meidl
spectra of Boolean functions over finite fields. Finite Fields Their Appl. 46 (2017)
Thor Martinsen, Wilfried Meidl, Pantelimon Stanica
Partial spread and vectorial generalized bent functions. Des. Codes Cryptogr. 85 (1) (2017)
Nurdagül Anbar, Wilfried Meidl, Alev Topuzoglu
Idempotent and p-potent quadratic functions: distribution of nonlinearity and co-dimension. Des. Codes Cryptogr. 82 (1-2) (2017)
Thor Martinsen, Wilfried Meidl, Pantelimon Stanica
Generalized Bent Functions and Their Gray Images. WAIFI (2016)
Canan Kasikci, Wilfried Meidl, Alev Topuzoglu
Spectra of a class of quadratic functions: Average behaviour and counting functions. Cryptogr. Commun. 8 (2) (2016)
Wilfried Meidl, Harald Niederreiter
Multisequences with high joint nonlinear complexity. Des. Codes Cryptogr. 81 (2) (2016)
Ayça Çesmelioglu, Wilfried Meidl, Alexander Pott
There Are Infinitely Many Bent Functions for Which the Dual Is Not Bent. IEEE Trans. Inf. Theory 62 (9) (2016)
Thor Martinsen, Wilfried Meidl, Sihem Mesnager, Pantelimon Stanica
Decomposing generalized bent and hyperbent functions. CoRR (2016)
Wilfried Meidl
Generalized Rothaus construction and non-weakly regular bent functions. J. Comb. Theory, Ser. A 141 (2016)
Samir Hodzic, Wilfried Meidl, Enes Pasalic
Full characterization of generalized bent functions as (semi)-bent spaces, their dual, and the Gray image. CoRR (2016)
Thor Martinsen, Wilfried Meidl, Pantelimon Stanica
Partial Spread and Vectorial Generalized Bent Functions. CoRR (2015)
Ayça Çesmelioglu, Wilfried Meidl, Alexander Pott
There are infinitely many bent functions for which the dual is not bent. CoRR (2015)
Ayça Çesmelioglu, Wilfried Meidl, Alexander Pott
Bent Functions, Spreads, and o-Polynomials. SIAM J. Discret. Math. 29 (2) (2015)
Nurdagül Anbar, Wilfried Meidl
More on quadratic functions and maximal Artin-Schreier curves. Appl. Algebra Eng. Commun. Comput. 26 (5) (2015)
Thor Martinsen, Wilfried Meidl, Pantelimon Stanica
Generalized bent functions and their Gray images. CoRR (2015)
Wilfried Meidl, Sankhadip Roy, Alev Topuzoglu
Enumeration of Quadratic Functions With Prescribed Walsh Spectrum. IEEE Trans. Inf. Theory 60 (10) (2014)
Wilfried Meidl, Harald Niederreiter
Multisequences with high joint nonlinear complexity. CoRR (2014)
Nurdagül Anbar, Wilfried Meidl
Quadratic functions and maximal Artin-Schreier curves. Finite Fields Their Appl. 30 (2014)
Ayça Çesmelioglu, Wilfried Meidl, Alev Topuzoglu
Permutations of finite fields with prescribed properties. J. Comput. Appl. Math. 259 (2014)
Ayça Çesmelioglu, Wilfried Meidl, Alexander Pott
Generalized Maiorana-McFarland class and normality of p-ary bent functions. Finite Fields Their Appl. 24 (2013)
Nina Brandstätter, Wilfried Meidl, Arne Winterhof
Addendum to Sidel'nikov sequences over nonprime fields. Inf. Process. Lett. 113 (9) (2013)
Wilfried Meidl, Alev Topuzoglu
Quadratic functions with prescribed spectra. Des. Codes Cryptogr. 66 (1-3) (2013)
Ayça Çesmelioglu, Wilfried Meidl
A construction of bent functions from plateaued functions. Des. Codes Cryptogr. 66 (1-3) (2013)
Ayça Çesmelioglu, Wilfried Meidl, Alexander Pott
On the dual of (non)-weakly regular bent functions and self-dual bent functions. Adv. Math. Commun. 7 (4) (2013)
Ayça Çesmelioglu, Wilfried Meidl
Bent Functions of Maximal Degree. IEEE Trans. Inf. Theory 58 (2) (2012)
Ayça Çesmelioglu, Gary McGuire, Wilfried Meidl
A construction of weakly and non-weakly regular bent functions. J. Comb. Theory, Ser. A 119 (2) (2012)
Ayça Çesmelioglu, Gary McGuire, Wilfried Meidl
A Construction of Weakly and Non-Weakly Regular Bent Functions CoRR (2010)
Ayça Çesmelioglu, Wilfried Meidl
A General Approach to Construction and Determination of the Linear Complexity of Sequences Based on Cosets. SETA (2010)
Wilfried Meidl, Ferruh Özbudak
for linear recurring sequences. Finite Fields Their Appl. 15 (1) (2009)
Wilfried Meidl
Remarks on a cyclotomic sequence. Des. Codes Cryptogr. 51 (1) (2009)
Esen Aksoy, Ayça Çesmelioglu, Wilfried Meidl, Alev Topuzoglu
On the Carlitz rank of permutation polynomials. Finite Fields Their Appl. 15 (4) (2009)
Wilfried Meidl
-error linear complexity in some classes of linear recurring sequences. Cryptogr. Commun. 1 (1) (2009)
Ayça Çesmelioglu, Wilfried Meidl, Alev Topuzoglu
On the cycle structure of permutation polynomials. Finite Fields Their Appl. 14 (3) (2008)
Nina Brandstätter, Wilfried Meidl
On the linear complexity of Sidel'nikov sequences over nonprime fields. J. Complex. 24 (5-6) (2008)
Wilfried Meidl, Ferruh Özbudak
Generalized Joint Linear Complexity of Linear Recurring Multisequences. SETA (2008)
Wilfried Meidl
-periodic binary sequences to Games-Chan algorithm. Des. Codes Cryptogr. 46 (1) (2008)
Hassan Aly, Wilfried Meidl, Arne Winterhof
On the k-error linear complexity of cyclotomic sequences. J. Math. Cryptol. 1 (3) (2007)
Hassan Aly, Wilfried Meidl
of the d-ary Sidel'nikov Sequence. IEEE Trans. Inf. Theory 53 (12) (2007)
Wilfried Meidl, Harald Niederreiter, Ayineedi Venkateswarlu
Error linear complexity measures for multisequences. J. Complex. 23 (2) (2007)
Wilfried Meidl, Arne Winterhof
On the linear complexity profile of nonlinear congruential pseudorandom number generators with Rédei functions. Finite Fields Their Appl. 13 (3) (2007)
Wilfried Meidl, Ayineedi Venkateswarlu
-periodic sequences. Des. Codes Cryptogr. 42 (2) (2007)
Wilfried Meidl
Enumeration results on linear complexity profiles and lattice profiles. J. Complex. 22 (2) (2006)
Wilfried Meidl
Continued fraction for formal laurent series and the lattice structure of sequences. Appl. Algebra Eng. Commun. Comput. 17 (1) (2006)
Nina Brandstätter, Wilfried Meidl
. SETA (2006)
Wilfried Meidl, Arne Winterhof
Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences. Des. Codes Cryptogr. 38 (2) (2006)
Wilfried Meidl
-periodic binary sequences. IEEE Trans. Inf. Theory 51 (3) (2005)
Wilfried Meidl, Arne Winterhof
On the joint linear complexity profile of explicit inversive multisequences. J. Complex. 21 (3) (2005)
Wilfried Meidl
Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences. SETA (2004)
Wilfried Meidl
How Many Bits have to be Changed to Decrease the Linear Complexity?. Des. Codes Cryptogr. 33 (2) (2004)
Wilfried Meidl, Arne Winterhof
On the linear complexity profile of some new explicit inversive pseudorandom numbers. J. Complex. 20 (2-3) (2004)
Gerhard Dorfer, Wilfried Meidl, Arne Winterhof
Counting functions and expected values for the lattice profile at n. Finite Fields Their Appl. 10 (4) (2004)
Wilfried Meidl
Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences. Theor. Comput. Sci. 290 (3) (2003)
Wilfried Meidl, Arne Winterhof
On the linear complexity profile of explicit nonlinear pseudorandom numbers. Inf. Process. Lett. 85 (1) (2003)
Wilfried Meidl, Harald Niederreiter
The expected value of the joint linear complexity of periodic multisequences. J. Complex. 19 (1) (2003)
Wilfried Meidl, Arne Winterhof
On the Autocorrelation of Cyclotomic Generators. International Conference on Finite Fields and Applications (2003)
Wilfried Meidl, Harald Niederreiter
Periodic Sequences with Maximal Linear Complexity and Large k-Error Linear Complexity. Appl. Algebra Eng. Commun. Comput. 14 (4) (2003)
Wilfried Meidl, Harald Niederreiter
-Error Linear Complexity, and the Discrete Fourier Transform. J. Complex. 18 (1) (2002)
Wilfried Meidl, Arne Winterhof
A Polynomial Representation of the Diffie-Hellman Mapping. Appl. Algebra Eng. Commun. Comput. 13 (4) (2002)
Wilfried Meidl, Harald Niederreiter
On the expected value of the linear complexity and the k-error linear complexity ofperiodic sequences. IEEE Trans. Inf. Theory 48 (11) (2002)
Wilfried Meidl, Arne Winterhof
Lower bounds on the linear complexity of the discrete logarithm in finite fields. IEEE Trans. Inf. Theory 47 (7) (2001)