Arne Winterhof

Orcid: 0000-0002-3863-1110

According to our database1, Arne Winterhof authored at least 109 papers between 2000 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Cross-Correlation of Golomb Costas Permutations.
IEEE Trans. Inf. Theory, November, 2024

Maximum-Order Complexity and 2-Adic Complexity.
IEEE Trans. Inf. Theory, August, 2024

Primitive elements of finite fields Fqr avoiding affine hyperplanes for q = 4 and q = 5.
Finite Fields Their Appl., 2024

2023
Pseudorandom Binary Sequences: Quality Measures and Number-Theoretic Constructions.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., December, 2023

2022
Arithmetic Crosscorrelation of Pseudorandom Binary Sequences of Coprime Periods.
IEEE Trans. Inf. Theory, 2022

Pseudorandom sequences derived from automatic sequences.
Cryptogr. Commun., 2022

Binary sequences derived from differences of consecutive quadratic residues.
Adv. Math. Commun., 2022

On the index of the Diffie-Hellman mapping.
Appl. Algebra Eng. Commun. Comput., 2022

2021
Binary Sequences Derived From Differences of Consecutive Primitive Roots.
IEEE Trans. Inf. Theory, 2021

2020
A Note on the Cross-Correlation of Costas Permutations.
IEEE Trans. Inf. Theory, 2020

A Note on Hall's Sextic Residue Sequence: Correlation Measure of Order $k$ and Related Measures of Pseudorandomness.
IEEE Trans. Inf. Theory, 2020

The Spherical Kakeya Problem in Finite Fields.
SIAM J. Discret. Math., 2020

2019
On the maximum order complexity of subsequences of the Thue-Morse and Rudin-Shapiro sequence along squares.
Int. J. Comput. Math. Comput. Syst. Theory, 2019

Conical Kakeya and Nikodym sets in finite fields.
Finite Fields Their Appl., 2019

Codes correcting restricted errors.
Des. Codes Cryptogr., 2019

r-th order nonlinearity, correlation measure and least significant bit of the discrete logarithm.
Cryptogr. Commun., 2019

2018
On the 2-Adic Complexity of the Two-Prime Generator.
IEEE Trans. Inf. Theory, 2018

Non-existence of Some Nearly Perfect Sequences, Near Butson-Hadamard Matrices, and Near Conference Matrices.
Math. Comput. Sci., 2018

Editorial.
Math. Comput. Simul., 2018

Packing Sets over Finite Abelian Groups.
Integers, 2018

Carlitz rank and index of permutation polynomials.
Finite Fields Their Appl., 2018

On the pseudorandomness of automatic sequences.
Cryptogr. Commun., 2018

Hamming correlation of higher order.
Adv. Math. Commun., 2018

2017
On the pseudorandomness of quaternary sequences derived from sequences over \(\mathbb F_4\).
Period. Math. Hung., 2017

Complete mappings and Carlitz rank.
Des. Codes Cryptogr., 2017

Maximum-Order Complexity and Correlation Measures.
Cryptogr., 2017

Expansion complexity and linear complexity of sequences over finite fields.
Cryptogr. Commun., 2017

On the arithmetic autocorrelation of the Legendre sequence.
Adv. Math. Commun., 2017

2016
On the linear complexity profile of some sequences derived from elliptic curves.
Des. Codes Cryptogr., 2016

Linear Complexity and Expansion Complexity of Some Number Theoretic Sequences.
Proceedings of the Arithmetic of Finite Fields - 6th International Workshop, 2016

2015
Linear complexity profile and correlation measure of interleaved sequences.
Cryptogr. Commun., 2015

2014
Covering Sets for Limited-Magnitude Errors.
IEEE Trans. Inf. Theory, 2014

Interpolation of Fermat Quotients.
SIAM J. Discret. Math., 2014

Generalizations of complete mappings of finite fields and some applications.
J. Symb. Comput., 2014

Two Combinatorial Geometric Problems involving Modular Hyperbolas.
Integers, 2014

On discrete Fourier transform, ambiguity, and Hamming-autocorrelation of pseudorandom sequences.
Des. Codes Cryptogr., 2014

Some highlights of Harald Niederreiter's work.
Proceedings of the Applied Algebra and Number Theory, 2014

2013
Addendum to Sidel'nikov sequences over nonprime fields.
Inf. Process. Lett., 2013

Distribution of values of polynomial Fermat quotients.
Finite Fields Their Appl., 2013

Finite fields in quantum information theory.
Proceedings of the Handbook of Finite Fields., 2013

Some applications of character sums.
Proceedings of the Handbook of Finite Fields., 2013

Linear complexity of sequences and multisequences.
Proceedings of the Handbook of Finite Fields., 2013

2012
Multiplicative character sums of Fermat quotients and pseudorandom sequences.
Period. Math. Hung., 2012

Correlation Measure of Order <i>k</i> and Linear Complexity Profile of Legendre-Sidelnikov Sequences.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2012

Boolean Functions Derived from Pseudorandom Binary Sequences.
Proceedings of the Sequences and Their Applications - SETA 2012, 2012

2011
Correlation of the two-prime Sidel'nikov sequence.
Des. Codes Cryptogr., 2011

Boolean functions derived from Fermat quotients.
Cryptogr. Commun., 2011

Correlation measure of order k and linear complexity profile of Legendre-Sidelnikov sequences.
Proceedings of the Fifth International Workshop on Signal Design and its Applications in Communications, 2011

2010
Autocorrelation of Legendre-Sidelnikov sequences.
IEEE Trans. Inf. Theory, 2010

On the pseudorandomness of binary and quaternary sequences linked by the gray mapping.
Period. Math. Hung., 2010

On the structure of digital explicit nonlinear and inversive pseudorandom number generators.
J. Complex., 2010

Permutations of finite fields for check digit systems.
Des. Codes Cryptogr., 2010

On the generalized joint linear complexity profile of a class of nonlinear pseudorandom multisequences.
Adv. Math. Commun., 2010

Structure of Pseudorandom Numbers Derived from Fermat Quotients.
Proceedings of the Arithmetic of Finite Fields, Third International Workshop, 2010

Recent Results on Recursive Nonlinear Pseudorandom Number Generators - (Invited Paper).
Proceedings of the Sequences and Their Applications - SETA 2010, 2010

2009
-error linear complexity over p of subsequences of Sidelnikov sequences of period (pr - 1)/3.
J. Math. Cryptol., 2009

Measures of pseudorandomness for binary sequences constructed using finite fields.
Discret. Math., 2009

Noisy Interpolation of Multivariate Sparse Polynomials in Finite Fields.
Proceedings of the Applied Algebra, 2009

2008
Exponential sums for nonlinear recurring sequences.
Finite Fields Their Appl., 2008

Exponential sums of nonlinear congruential pseudorandom number generators with Rédei functions.
Finite Fields Their Appl., 2008

Interpolation of the Double Discrete Logarithm.
Proceedings of the Arithmetic of Finite Fields, 2nd International Workshop, 2008

Multiplicative Character Sums of Recurring Sequences with Rédei Functions.
Proceedings of the Sequences and Their Applications, 2008

On the Average Distribution of Power Residues and Primitive Elements in Inversive and Nonlinear Recurring Sequences.
Proceedings of the Sequences and Their Applications, 2008

2007
On the k-error linear complexity of cyclotomic sequences.
J. Math. Cryptol., 2007

Quantum period reconstruction of approximate sequences.
Inf. Process. Lett., 2007

On the linear complexity profile of nonlinear congruential pseudorandom number generators with Rédei functions.
Finite Fields Their Appl., 2007

On the Structure of Inversive Pseudorandom Number Generators.
Proceedings of the Applied Algebra, 2007

2006
On the Lower Bound of the Linear Complexity Over BBF_p of Sidelnikov Sequences.
IEEE Trans. Inf. Theory, 2006

Linear complexity profile of binary sequences with small correlation measure.
Period. Math. Hung., 2006

Polynomial representations of the Lucas logarithm.
Finite Fields Their Appl., 2006

Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences.
Des. Codes Cryptogr., 2006

On the <i>k</i>-error linear complexity over \mathbb<i>F</i><sub><i>p</i></sub> of Legendre and Sidelnikov sequences.
Des. Codes Cryptogr., 2006

On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials.
Des. Codes Cryptogr., 2006

Polynomial interpolation of cryptographic functions related to Diffie-Hellman and discrete logarithm problem.
Discret. Appl. Math., 2006

On the nonlinearity of linear recurrence sequences.
Appl. Math. Lett., 2006

On the Discrepancy and Linear Complexity of Some Counter-Dependent Recurrence Sequences.
Proceedings of the Sequences and Their Applications, 2006

Constructions of Approximately Mutually Unbiased Bases.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Quantum Period Reconstruction of Binary Sequences.
Proceedings of the Applied Algebra, 2006

2005
Some notes on the two-prime generator of order 2.
IEEE Trans. Inf. Theory, 2005

A hidden number problem in small subgroups.
Math. Comput., 2005

On the joint linear complexity profile of explicit inversive multisequences.
J. Complex., 2005

On the linear complexity of bounded integer sequences over different moduli.
Inf. Process. Lett., 2005

Cyclotomic R-orthomorphisms of finite fields.
Discret. Math., 2005

On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders.
Appl. Algebra Eng. Commun. Comput., 2005

Noisy interpolation of sparse polynomials in finite fields.
Appl. Algebra Eng. Commun. Comput., 2005

On the Non-linearity and Sparsity of Boolean Functions Related to the Discrete Logarithm in Finite Fields of Characteristic Two.
Proceedings of the Coding and Cryptography, International Workshop, 2005

Interpolation of Functions Related to the Integer Factoring Problem.
Proceedings of the Coding and Cryptography, International Workshop, 2005

2004
On the linear complexity profile of some new explicit inversive pseudorandom numbers.
J. Complex., 2004

Counting functions and expected values for the lattice profile at n.
Finite Fields Their Appl., 2004

On the Distribution of Some New Explicit Nonlinear Congruential Pseudorandom Numbers.
Proceedings of the Sequences and Their Applications, 2004

A Nonuniform Algorithm for the Hidden Number Problem in Subgroups.
Proceedings of the Public Key Cryptography, 2004

2003
On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators.
IEEE Trans. Inf. Theory, 2003

On the linear complexity profile of explicit nonlinear pseudorandom numbers.
Inf. Process. Lett., 2003

Interpolation of the Discrete Logarithm in F<sub>q</sub> by Boolean Functions and by Polynomials in Several Variables Modulo a Divisor of Q-1.
Discret. Appl. Math., 2003

Lattice Structure and Linear Complexity Profile of Nonlinear Pseudorandom Number Generators.
Appl. Algebra Eng. Commun. Comput., 2003

On the Autocorrelation of Cyclotomic Generators.
Proceedings of the Finite Fields and Applications, 2003

Interpolation of the Elliptic Curve Diffie-Hellman Mapping.
Proceedings of the Applied Algebra, 2003

2002
Polynomial Interpolation of the Discrete Logarithm.
Des. Codes Cryptogr., 2002

On the hardness of approximating the permanent of structured matrices.
Comput. Complex., 2002

On the Non-Existence of (g, g\lambda-1;lambda)-Difference matrices.
Ars Comb., 2002

Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers.
Appl. Algebra Eng. Commun. Comput., 2002

A Polynomial Representation of the Diffie-Hellman Mapping.
Appl. Algebra Eng. Commun. Comput., 2002

Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
Lower bounds on the linear complexity of the discrete logarithm in finite fields.
IEEE Trans. Inf. Theory, 2001

On a new class of inversive pseudorandom numbers for parallelized simulation methods.
Period. Math. Hung., 2001

Interpolation of the Discrete Logarithm in Finite Fields by Boolean Functions.
Electron. Notes Discret. Math., 2001

Some Estimates for Character Sums and Applications.
Des. Codes Cryptogr., 2001

On the Lattice Structure of Pseudorandom Numbers Generated over Arbitrary Finite Fields.
Appl. Algebra Eng. Commun. Comput., 2001

2000
Factoring polynomials over arbitrary finite fields.
Theor. Comput. Sci., 2000


  Loading...