Sammanfattning
The windmill technique has several practical advantageous over other techniques for high-speed generation or blockwise generation of pn-sequences. In this paper we generalize previous results by showing that if f(t)=α(t v) − β(t −v)t L is the minimal polynomial of a pn-sequence, then the sequence can be generated by a windmill generator. For L = 1,..127, and ν = 4, 8, 16 such that L ≡ ±3 mod 8 no irreducible polynomials f(t) were found. When L ≡ ±1 mod 8 the number of primitive f(t)’s was found to be approximately twice the expected number.
| Originalspråk | engelska |
|---|---|
| Titel på värdpublikation | Advances in Cryptology — EUROCRYPT 1988 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings |
| Redaktörer | Christoph G. Gunther |
| Förlag | Springer |
| Sidor | 325-330 |
| Antal sidor | 6 |
| ISBN (tryckt) | 9783540502517 |
| DOI | |
| Status | Published - 1988 |
| Evenemang | 6th European Workshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1988 - Davos, Schweiz Varaktighet: 1988 maj 25 → 1988 maj 27 |
Publikationsserier
| Namn | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volym | 330 LNCS |
| ISSN (tryckt) | 0302-9743 |
| ISSN (elektroniskt) | 1611-3349 |
Konferens
| Konferens | 6th European Workshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1988 |
|---|---|
| Land/Territorium | Schweiz |
| Ort | Davos |
| Period | 1988/05/25 → 1988/05/27 |
Bibliografisk information
Publisher Copyright:© 1988, Springer-Verlag Berlin Heidelberg.
Ämnesklassifikation (UKÄ)
- Matematisk analys