Lower bounds on the linear complexity of the discrete logarithm in finite fields. - Wilfried Meidl; Arne Winterhof (IEEE Trans. Inf. Theory, 2001)

A Polynomial Representation of the Diffie-Hellman Mapping. - Wilfried Meidl; Arne Winterhof (Appl. Algebra Eng. Commun. Comput., 2002)

Linear Complexity, k-Error Linear Complexity, and the Discrete Fourier Transform. - Wilfried Meidl; Harald Niederreiter (J. Complex., 2002)

On the expected value of the linear complexity and the k-error linear complexity ofperiodic sequences. - Wilfried Meidl; Harald Niederreiter (IEEE Trans. Inf. Theory, 2002)

On the Autocorrelation of Cyclotomic Generators. - Wilfried Meidl; Arne Winterhof (International Conference on Finite Fields and Applications, 2003)

Periodic Sequences with Maximal Linear Complexity and Large k-Error Linear Complexity. - Wilfried Meidl; Harald Niederreiter (Appl. Algebra Eng. Commun. Comput., 2003)

On the linear complexity profile of explicit nonlinear pseudorandom numbers. - Wilfried Meidl; Arne Winterhof (Inf. Process. Lett., 2003)

The expected value of the joint linear complexity of periodic multisequences. - Wilfried Meidl; Harald Niederreiter (J. Complex., 2003)

Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences. - Wilfried Meidl (Theor. Comput. Sci., 2003)

Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences. - Wilfried Meidl (SETA, 2004)

How Many Bits have to be Changed to Decrease the Linear Complexity?. - Wilfried Meidl (Des. Codes Cryptogr., 2004)

Counting functions and expected values for the lattice profile at n. - Gerhard Dorfer; Wilfried Meidl; Arne Winterhof (Finite Fields Their Appl., 2004)

On the linear complexity profile of some new explicit inversive pseudorandom numbers. - Wilfried Meidl; Arne Winterhof (J. Complex., 2004)

On the joint linear complexity profile of explicit inversive multisequences. - Wilfried Meidl; Arne Winterhof (J. Complex., 2005)

On the stability of 2n-periodic binary sequences. - Wilfried Meidl (IEEE Trans. Inf. Theory, 2005)

On the Linear Complexity of Sidel'nikov Sequences over Fd. - Nina Brandstätter; Wilfried Meidl (SETA, 2006)

Continued fraction for formal laurent series and the lattice structure of sequences. - Wilfried Meidl (Appl. Algebra Eng. Commun. Comput., 2006)

Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences. - Wilfried Meidl; Arne Winterhof (Des. Codes Cryptogr., 2006)

Enumeration results on linear complexity profiles and lattice profiles. - Wilfried Meidl (J. Complex., 2006)

Remarks on the k-error linear complexity of pn-periodic sequences. - Wilfried Meidl; Ayineedi Venkateswarlu (Des. Codes Cryptogr., 2007)

On the linear complexity profile of nonlinear congruential pseudorandom number generators with Rédei functions. - Wilfried Meidl; Arne Winterhof (Finite Fields Their Appl., 2007)

Error linear complexity measures for multisequences. - Wilfried Meidl; Harald Niederreiter; Ayineedi Venkateswarlu (J. Complex., 2007)

On the k-error linear complexity of cyclotomic sequences. - Hassan Aly; Wilfried Meidl; Arne Winterhof (J. Math. Cryptol., 2007)

On the Linear Complexity and k-Error Linear Complexity Over BBFp of the d-ary Sidel'nikov Sequence. - Hassan Aly; Wilfried Meidl (IEEE Trans. Inf. Theory, 2007)

Generalized Joint Linear Complexity of Linear Recurring Multisequences. - Wilfried Meidl; Ferruh Özbudak (SETA, 2008)

Reducing the calculation of the linear complexity of u 2 v -periodic binary sequences to Games-Chan algorithm. - Wilfried Meidl (Des. Codes Cryptogr., 2008)

On the cycle structure of permutation polynomials. - Ayça Çesmelioglu; Wilfried Meidl; Alev Topuzoglu (Finite Fields Their Appl., 2008)

On the linear complexity of Sidel'nikov sequences over nonprime fields. - Nina Brandstätter; Wilfried Meidl (J. Complex., 2008)

How to determine linear complexity and k-error linear complexity in some classes of linear recurring sequences. - Wilfried Meidl (Cryptogr. Commun., 2009)

Remarks on a cyclotomic sequence. - Wilfried Meidl (Des. Codes Cryptogr., 2009)

On the Carlitz rank of permutation polynomials. - Esen Aksoy; Ayça Çesmelioglu; Wilfried Meidl; Alev Topuzoglu (Finite Fields Their Appl., 2009)

Linear complexity over Fq and over Fqm for linear recurring sequences. - Wilfried Meidl; Ferruh Özbudak (Finite Fields Their Appl., 2009)

A General Approach to Construction and Determination of the Linear Complexity of Sequences Based on Cosets. - Ayça Çesmelioglu; Wilfried Meidl (SETA, 2010)

A construction of weakly and non-weakly regular bent functions. - Ayça Çesmelioglu; Gary McGuire; Wilfried Meidl (J. Comb. Theory A, 2012)

Bent Functions of Maximal Degree. - Ayça Çesmelioglu; Wilfried Meidl (IEEE Trans. Inf. Theory, 2012)

Linear complexity of sequences and multisequences. - Wilfried Meidl; Arne Winterhof (Handbook of Finite Fields, 2013)

On the dual of (non)-weakly regular bent functions and self-dual bent functions. - Ayça Çesmelioglu; Wilfried Meidl; Alexander Pott (Adv. Math. Commun., 2013)

A construction of bent functions from plateaued functions. - Ayça Çesmelioglu; Wilfried Meidl (Des. Codes Cryptogr., 2013)

Quadratic functions with prescribed spectra. - Wilfried Meidl; Alev Topuzoglu (Des. Codes Cryptogr., 2013)

Generalized Maiorana-McFarland class and normality of p-ary bent functions. - Ayça Çesmelioglu; Wilfried Meidl; Alexander Pott (Finite Fields Their Appl., 2013)

Addendum to Sidel'nikov sequences over nonprime fields. - Nina Brandstätter; Wilfried Meidl; Arne Winterhof (Inf. Process. Lett., 2013)

Partially bent functions and their properties. - Ayça Çesmelioglu; Wilfried Meidl; Alev Topuzoglu (Applied Algebra and Number Theory, 2014)

Quadratic functions and maximal Artin-Schreier curves. - Nurdagül Anbar; Wilfried Meidl (Finite Fields Their Appl., 2014)

Permutations of finite fields with prescribed properties. - Ayça Çesmelioglu; Wilfried Meidl; Alev Topuzoglu (J. Comput. Appl. Math., 2014)

Enumeration of Quadratic Functions With Prescribed Walsh Spectrum. - Wilfried Meidl; Sankhadip Roy; Alev Topuzoglu (IEEE Trans. Inf. Theory, 2014)

More on quadratic functions and maximal Artin-Schreier curves. - Nurdagül Anbar; Wilfried Meidl (Appl. Algebra Eng. Commun. Comput., 2015)

Bent Functions, Spreads, and o-Polynomials. - Ayça Çesmelioglu; Wilfried Meidl; Alexander Pott (SIAM J. Discret. Math., 2015)

Generalized Bent Functions and Their Gray Images. - Thor Martinsen; Wilfried Meidl; Pantelimon Stanica (WAIFI, 2016)

Spectra of a class of quadratic functions: Average behaviour and counting functions. - Canan Kasikci; Wilfried Meidl; Alev Topuzoglu (Cryptogr. Commun., 2016)

Multisequences with high joint nonlinear complexity. - Wilfried Meidl; Harald Niederreiter (Des. Codes Cryptogr., 2016)

Generalized Rothaus construction and non-weakly regular bent functions. - Wilfried Meidl (J. Comb. Theory A, 2016)

There Are Infinitely Many Bent Functions for Which the Dual Is Not Bent. - Ayça Çesmelioglu; Wilfried Meidl; Alexander Pott (IEEE Trans. Inf. Theory, 2016)

Idempotent and p-potent quadratic functions: distribution of nonlinearity and co-dimension. - Nurdagül Anbar; Wilfried Meidl; Alev Topuzoglu (Des. Codes Cryptogr., 2017)

Partial spread and vectorial generalized bent functions. - Thor Martinsen; Wilfried Meidl; Pantelimon Stanica (Des. Codes Cryptogr., 2017)

Bent and bent4 spectra of Boolean functions over finite fields. - Nurdagül Anbar; Wilfried Meidl (Finite Fields Their Appl., 2017)

Decomposing Generalized Bent and Hyperbent Functions. - Thor Martinsen; Wilfried Meidl; Sihem Mesnager; Pantelimon Stanica (IEEE Trans. Inf. Theory, 2017)

On Symmetry and Differential Properties of Generalized Boolean Functions. - Thor Martinsen; Wilfried Meidl; Alexander Pott; Pantelimon Stanica (WAIFI, 2018)

Bent and vectorial bent functions, partial difference sets, and strongly regular graphs. - Ayça Çesmelioglu; Wilfried Meidl (Adv. Math. Commun., 2018)

Modified planar functions and their components. - Nurdagül Anbar; Wilfried Meidl (Cryptogr. Commun., 2018)

On the normality of p-ary bent functions. - Wilfried Meidl; Isabel Pirsic (Cryptogr. Commun., 2018)

A secondary construction of bent functions, octal gbent functions and their duals. - Wilfried Meidl (Math. Comput. Simul., 2018)

Full Characterization of Generalized Bent Functions as (Semi)-Bent Spaces, Their Dual, and the Gray Image. - Samir Hodzic; Wilfried Meidl; Enes Pasalic (IEEE Trans. Inf. Theory, 2018)

Generalized bent functions into ℤ p k $ mathbb {Z}_{p^{k}}$ from the partial spread and the Maiorana-McFarland class. - Wilfried Meidl; Alexander Pott (Cryptogr. Commun., 2019)

Equivalence for negabent functions and their relative difference sets. - Nurdagül Anbar; Wilfried Meidl; Alexander Pott (Discret. Appl. Math., 2019)

Determining the Walsh spectra of Taniguchi's and related APN-functions. - Nurdagül Anbar; Tekgül Kalayci; Wilfried Meidl (Finite Fields Their Appl., 2019)

Shifted plateaued functions and their differential properties. - Nurdagül Anbar; Canan Kasikci; Wilfried Meidl; Alev Topuzoglu (Cryptogr. Commun., 2020)

Vectorial bent functions in odd characteristic and their components. - Ayça Çesmelioglu; Wilfried Meidl; Alexander Pott (Cryptogr. Commun., 2020)

Bent and Z2k-bent functions from spread-like partitions. - Wilfried Meidl; Isabel Pirsic (CoRR, 2020)

On functions with the maximal number of bent components. - Nurdagül Anbar; Tekgül Kalayci; Wilfried Meidl; László Mérai (CoRR, 2020)

Vanishing Flats: A Combinatorial Viewpoint on the Planarity of Functions and Their Application. - Shuxing Li; Wilfried Meidl; Alexandr Polujan; Alexander Pott; Constanza Riera; Pantelimon Stanica (IEEE Trans. Inf. Theory, 2020)

Vectorial bent functions and partial difference sets. - Ayça Çesmelioglu; Wilfried Meidl; Isabel Pirsic (Des. Codes Cryptogr., 2021)

Bent and ${{ mathbb {Z}}}_{2^k}$-Bent functions from spread-like partitions. - Wilfried Meidl; Isabel Pirsic (Des. Codes Cryptogr., 2021)

Analysis of (n, n)-Functions Obtained From the Maiorana-McFarland Class. - Nurdagül Anbar; Tekgül Kalayci; Wilfried Meidl (IEEE Trans. Inf. Theory, 2021)

A survey on p-ary and generalized bent functions. - Wilfried Meidl (Cryptogr. Commun., 2022)

P℘N functions, complete mappings and quasigroup difference sets. - Nurdagül Anbar; Tekgül Kalyci; Wilfried Meidl; Constanza Riera; Pantelimon Stanica (CoRR, 2022)

Bent partitions. - Nurdagül Anbar; Wilfried Meidl (Des. Codes Cryptogr., 2022)

Bent Partitions and Partial Difference Sets. - Nurdagül Anbar; Tekgül Kalayci; Wilfried Meidl (IEEE Trans. Inf. Theory, 2022)

On a Class of Functions With the Maximal Number of Bent Components. - Nurdagül Anbar; Tekgül Kalayci; Wilfried Meidl; László Mérai (IEEE Trans. Inf. Theory, 2022)

Linear codes and incidence structures of bent functions and their generalizations. - Wilfried Meidl; Alexandr A. Polujan; Alexander Pott (Discret. Math., 2023)

Generalized semifield spreads. - Nurdagül Anbar; Tekgül Kalayci; Wilfried Meidl (Des. Codes Cryptogr., 2023)

On generalized spread bent partitions. - Nurdagül Anbar; Tekgül Kalayci; Wilfried Meidl (Cryptogr. Commun., 2023)

Editorial: Special issue on Boolean functions and their applications 2022. - Lilya Budaghyan; Claude Carlet; Tor Helleseth; Wilfried Meidl (Cryptogr. Commun., 2023)

Equivalence for generalized Boolean functions. - Ayça Çesmelioglu; Wilfried Meidl (Adv. Math. Commun., 2024)

Generalized bent functions with large dimension. - Wilfried Meidl (Adv. Math. Commun., 2024)

Amorphic association schemes from bent partitions. - Nurdagül Anbar; Tekgül Kalayci; Wilfried Meidl (Discret. Math., 2024)

Bent Partitions and LP-Packings. - Sezel Alkan; Nurdagül Anbar; Tekgül Kalayci; Wilfried Meidl (IEEE Trans. Inf. Theory, 2024)

Vectorial Bent Functions With Non-Weakly Regular Components. - Ayça Çesmelioglu; Wilfried Meidl (IEEE Trans. Inf. Theory, 2024)

(2p + 1)-class association schemes from the generalized Maiorana-McFarland class. - Nurdagül Anbar; Tekgül Kalayci; Wilfried Meidl; Ferruh Özbudak (Finite Fields Their Appl., 2025)

Bent Partition, Vectorial Dual-Bent Function, and LP-Packing Constructions. - Sezel Alkan; Nurdagül Anbar; Tekgül Kalayci; Wilfried Meidl (IEEE Trans. Inf. Theory, 2025)

Vectorial negabent concepts: similarities, differences, and generalizations. - Nurdagül Anbar; Sadmir Kudin; Wilfried Meidl; Enes Pasalic; Alexandr Polujan (Des. Codes Cryptogr., 2025)