scientific article; zbMATH DE number 1866875

zbMATH Open1053.11089MaRDI QIDQ4792309FDOQ4792309

Authors: Wilfried Meidl, Arne Winterhof 

Publication date: 6 February 2004

Title of this publication is not available (Why is that?)

Recommendations

• The complexity of linear problems in fields
• Linearized polynomials over finite fields revisited
• Polynomial multiplication over finite fields: from quadratic to straight-line complexity
• Multiplicative complexity of polynomial multiplication over finite fields
• True complexity of polynomial progressions in finite fields
• scientific article; zbMATH DE number 2221549
• Complexity of computation in finite fields
• Nonlinearity of functions over finite fields
• Complexity of function systems over a finite field in the class of polarized polynomial forms

Mathematics Subject Classification ID

Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Cited In (5)

• Title not available (Why is that?)
• Complexity theoretic lower bounds on cryptographic functions.
• Linear complexity of the discrete logarithm
• On the linear complexity profile of explicit nonlinear pseudorandom numbers.
• Expansion complexity and linear complexity of sequences over finite fields

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4792309)