Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Nina Brandstätter is active.

Publication


Featured researches published by Nina Brandstätter.


IEEE Transactions on Information Theory | 2005

Some notes on the two-prime generator of order 2

Nina Brandstätter; Arne Winterhof

The two-prime generator of order 2 has several desirable randomness properties if the two primes are chosen properly. In particular, Ding deduced exact formulas for the (periodic) autocorrelation and the linear complexity of these sequences. In this note, we analyze parts of the period of the two-prime generator of order 2 and obtain bounds on the aperiodic autocorrelation and linear complexity profile.


Periodica Mathematica Hungarica | 2006

Linear complexity profile of binary sequences with small correlation measure

Nina Brandstätter; Arne Winterhof

SummaryA high linear complexity profile is a desirable feature of sequences used for cryptographical purposes. For a given binary sequence we estimate its linear complexity profile in terms of the correlation measure, which was introduced by Mauduit and Sárközy. We apply this result to certain periodic sequences including Legendre sequences, Sidelnikov sequences and other sequences related to the discrete logarithm.


Designs, Codes and Cryptography | 2011

Correlation of the two-prime Sidel'nikov sequence

Nina Brandstätter; Gottlieb Pirsic; Arne Winterhof

Motivated by the concepts of Sidel’nikov sequences and two-prime generator (or Jacobi sequences) we introduce and analyze some new binary sequences called two-prime Sidel’nikov sequences. In the cases of twin primes and cousin primes equivalent 3 modulo 4 we show that these sequences are balanced. In the general case, besides balancedness we also study the autocorrelation, the correlation measure of order k and the linear complexity profile of these sequences showing that they have many nice pseudorandom features.


Journal of Mathematical Cryptology | 2009

-error linear complexity over p of subsequences of Sidelnikov sequences of period (pr – 1)/3

Nina Brandstätter; Arne Winterhof

Abstract Subsequences of Sidelnikov sequences have several desirable cryptographic features such as high linear complexity over 𝔽2 and small aperiodic autocorrelation. Here we analyse the k-error linear complexity over 𝔽 p of subsequences of Sidelnikov sequences of length (q –1)/3. The proofs are based on results on equations with binomial coefficients modulo p partly obtained using character sum techniques.


Journal of Applied Mechanics-transactions of The Asme | 2006

On the non-linearity and sparsity of Boolean functions related to the discrete logarithm in finite fields of characteristic two

Nina Brandstätter; Tilman Lange; Arne Winterhof


SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications | 2006

On the linear complexity of Sidel'nikov sequences over F d

Nina Brandstätter; Wilfried Meidl


Archivum Mathematicum | 2006

APPROXIMATION OF THE DISCRETE LOGARITHM IN FINITE FIELDS OF EVEN CHARACTERISTIC BY REAL POLYNOMIALS

Nina Brandstätter; Arne Winterhof


Journal of Complexity | 2008

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

Nina Brandstätter; Wilfried Meidl


Information Processing Letters | 2013

Addendum to Sidel'nikov sequences over nonprime fields

Nina Brandstätter; Wilfried Meidl; Arne Winterhof


Lecture Notes in Computer Science | 2006

On the Linear Complexity of Sidel'nikov Sequences over Fd

Nina Brandstätter; Wilfried Meidl

Collaboration


Dive into the Nina Brandstätter's collaboration.

Top Co-Authors

Avatar

Arne Winterhof

Austrian Academy of Sciences

View shared research outputs
Top Co-Authors

Avatar

Wilfried Meidl

Austrian Academy of Sciences

View shared research outputs
Top Co-Authors

Avatar

Gottlieb Pirsic

Johannes Kepler University of Linz

View shared research outputs
Top Co-Authors

Avatar

Tanja Lange

Eindhoven University of Technology

View shared research outputs
Researchain Logo
Decentralizing Knowledge