Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Advances in Cryptology — EUROCRYPT 1988 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings |
| Editors | Christoph G. Gunther |
| Publisher | Springer |
| Pages | 325-330 |
| Number of pages | 6 |
| ISBN (Print) | 9783540502517 |
| DOIs | |
| Publication status | Published - 1988 |
| Event | 6th European Workshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1988 - Davos, Switzerland Duration: 1988 May 25 → 1988 May 27 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 330 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 6th European Workshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1988 |
|---|---|
| Country/Territory | Switzerland |
| City | Davos |
| Period | 1988/05/25 → 1988/05/27 |
Bibliographical note
Funding Information:Part of this work was supported by the National Swedish Board for Technical Development under grant 863759 at the University of Lund.
Publisher Copyright:
© 1988, Springer-Verlag Berlin Heidelberg.
Subject classification (UKÄ)
- Mathematical Analysis