Wilfried Meidl

Discret. Math., January, 2024

Vectorial Negabent Concepts: Similarities, Differences, and Generalizations.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Editorial: Special issue on Boolean functions and their applications 2022.

[BibT_eX]

[DOI]

Cryptogr. Commun., December, 2023

On generalized spread bent partitions.

[BibT_eX]

[DOI]

Cryptogr. Commun., December, 2023

Generalized semifield spreads.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., February, 2023

Linear codes and incidence structures of bent functions and their generalizations.

[BibT_eX]

[DOI]

Alexandr A. Polujan

Discret. Math., 2023

2022

On a Class of Functions With the Maximal Number of Bent Components.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Bent Partitions and Partial Difference Sets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Bent partitions.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2022

P℘N functions, complete mappings and quasigroup difference sets.

[BibT_eX]

[DOI]

CoRR, 2022

A survey on p-ary and generalized bent functions.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2022

2021

Analysis of (n, n)-Functions Obtained From the Maiorana-McFarland Class.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Bent and ${{\mathbb {Z}}}_{2^k}$-Bent functions from spread-like partitions.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2021

Vectorial bent functions and partial difference sets.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2021

2020

Vanishing Flats: A Combinatorial Viewpoint on the Planarity of Functions and Their Application.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

On functions with the maximal number of bent components.

[BibT_eX]

[DOI]

CoRR, 2020

Bent and Z2k-bent functions from spread-like partitions.

[BibT_eX]

[DOI]

CoRR, 2020

Vectorial bent functions in odd characteristic and their components.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2020

Shifted plateaued functions and their differential properties.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2020

2019

Determining the Walsh spectra of Taniguchi's and related APN-functions.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2019

Equivalence for negabent functions and their relative difference sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

Generalized bent functions into ℤ p k $\mathbb {Z}_{p^{k}}$ from the partial spread and the Maiorana-McFarland class.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2019

2018

Full Characterization of Generalized Bent Functions as (Semi)-Bent Spaces, Their Dual, and the Gray Image.

[BibT_eX]

[DOI]

Samir Hodzic

Enes Pasalic

IEEE Trans. Inf. Theory, 2018

A secondary construction of bent functions, octal gbent functions and their duals.

[BibT_eX]

[DOI]

Math. Comput. Simul., 2018

On the normality of p-ary bent functions.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2018

Modified planar functions and their components.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2018

Bent and vectorial bent functions, partial difference sets, and strongly regular graphs.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2018

On Symmetry and Differential Properties of Generalized Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Arithmetic of Finite Fields - 7th International Workshop, 2018

2017

Decomposing Generalized Bent and Hyperbent Functions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Bent and bent4 spectra of Boolean functions over finite fields.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2017

Partial spread and vectorial generalized bent functions.

[BibT_eX]

[DOI]

Thor Martinsen

Pantelimon Stanica

Des. Codes Cryptogr., 2017

Idempotent and p-potent quadratic functions: distribution of nonlinearity and co-dimension.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2017

2016

There Are Infinitely Many Bent Functions for Which the Dual Is Not Bent.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Generalized Rothaus construction and non-weakly regular bent functions.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2016

Multisequences with high joint nonlinear complexity.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2016

Spectra of a class of quadratic functions: Average behaviour and counting functions.

[BibT_eX]

[DOI]

Canan Kasikci

Cryptogr. Commun., 2016

Generalized Bent Functions and Their Gray Images.

[BibT_eX]

[DOI]

Thor Martinsen

Pantelimon Stanica

Proceedings of the Arithmetic of Finite Fields - 6th International Workshop, 2016

2015

Bent Functions, Spreads, and o-Polynomials.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2015

More on quadratic functions and maximal Artin-Schreier curves.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2015

2014

Enumeration of Quadratic Functions With Prescribed Walsh Spectrum.

[BibT_eX]

[DOI]

Sankhadip Roy

IEEE Trans. Inf. Theory, 2014

Permutations of finite fields with prescribed properties.

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2014

Quadratic functions and maximal Artin-Schreier curves.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2014

Partially bent functions and their properties.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra and Number Theory, 2014

2013

Addendum to Sidel'nikov sequences over nonprime fields.

[BibT_eX]

[DOI]

Nina Brandstätter

Inf. Process. Lett., 2013

Generalized Maiorana-McFarland class and normality of p-ary bent functions.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2013

Quadratic functions with prescribed spectra.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2013

A construction of bent functions from plateaued functions.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2013

On the dual of (non)-weakly regular bent functions and self-dual bent functions.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2013

Linear complexity of sequences and multisequences.

[BibT_eX]

Proceedings of the Handbook of Finite Fields., 2013

2012

Bent Functions of Maximal Degree.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

A construction of weakly and non-weakly regular bent functions.

[BibT_eX]

[DOI]

Gary McGuire

J. Comb. Theory, Ser. A, 2012

2010

A General Approach to Construction and Determination of the Linear Complexity of Sequences Based on Cosets.

[BibT_eX]

[DOI]

Proceedings of the Sequences and Their Applications - SETA 2010, 2010

2009

Linear complexity over Fq and over Fqm for linear recurring sequences.

[BibT_eX]

[DOI]

Ferruh Özbudak

Finite Fields Their Appl., 2009

On the Carlitz rank of permutation polynomials.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2009

Remarks on a cyclotomic sequence.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2009

How to determine linear complexity and k-error linear complexity in some classes of linear recurring sequences.

[BibT_eX]

[DOI]

Cryptogr. Commun., 2009

2008

On the linear complexity of Sidel'nikov sequences over nonprime fields.

[BibT_eX]

[DOI]

Nina Brandstätter

J. Complex., 2008

On the cycle structure of permutation polynomials.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2008

Reducing the calculation of the linear complexity of u 2 v -periodic binary sequences to Games-Chan algorithm.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2008

Generalized Joint Linear Complexity of Linear Recurring Multisequences.

[BibT_eX]

[DOI]

Ferruh Özbudak

Proceedings of the Sequences and Their Applications, 2008

2007

On the Linear Complexity and k-Error Linear Complexity Over BBFp of the d-ary Sidel'nikov Sequence.

[BibT_eX]

[DOI]

Hassan Aly

IEEE Trans. Inf. Theory, 2007

On the k-error linear complexity of cyclotomic sequences.

[BibT_eX]

[DOI]

Hassan Aly

J. Math. Cryptol., 2007

Error linear complexity measures for multisequences.

[BibT_eX]

[DOI]

Ayineedi Venkateswarlu

J. Complex., 2007

On the linear complexity profile of nonlinear congruential pseudorandom number generators with Rédei functions.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2007

Remarks on the k-error linear complexity of pn-periodic sequences.

[BibT_eX]

[DOI]

Ayineedi Venkateswarlu

Des. Codes Cryptogr., 2007

2006

Enumeration results on linear complexity profiles and lattice profiles.

[BibT_eX]

[DOI]

J. Complex., 2006

Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2006

Continued fraction for formal laurent series and the lattice structure of sequences.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2006

On the Linear Complexity of Sidel'nikov Sequences over Fd.

[BibT_eX]

[DOI]

Nina Brandstätter

Proceedings of the Sequences and Their Applications, 2006

2005

On the stability of 2n-periodic binary sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

On the joint linear complexity profile of explicit inversive multisequences.

[BibT_eX]

[DOI]

J. Complex., 2005

2004

On the linear complexity profile of some new explicit inversive pseudorandom numbers.

[BibT_eX]

[DOI]

J. Complex., 2004

Counting functions and expected values for the lattice profile at n.

[BibT_eX]

[DOI]

Gerhard Dorfer

Finite Fields Their Appl., 2004

How Many Bits have to be Changed to Decrease the Linear Complexity?.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2004

Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences.

[BibT_eX]

[DOI]

Proceedings of the Sequences and Their Applications, 2004

2003

Extended Games-Chan algorithm for the 2-adic complexity of FCSR-sequences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

The expected value of the joint linear complexity of periodic multisequences.

[BibT_eX]

[DOI]

J. Complex., 2003

On the linear complexity profile of explicit nonlinear pseudorandom numbers.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

Periodic Sequences with Maximal Linear Complexity and Large k-Error Linear Complexity.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2003

On the Autocorrelation of Cyclotomic Generators.

[BibT_eX]

[DOI]

Proceedings of the Finite Fields and Applications, 2003

2002

On the expected value of the linear complexity and the k-error linear complexity ofperiodic sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Linear Complexity, k-Error Linear Complexity, and the Discrete Fourier Transform.

[BibT_eX]

[DOI]

J. Complex., 2002

A Polynomial Representation of the Diffie-Hellman Mapping.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2002

2001

Lower bounds on the linear complexity of the discrete logarithm in finite fields.

[BibT_eX]

[DOI]