| 1. |
|
|
| 2. |
- Dybjer, Peter, 1953
(författare)
-
Program Verification In A Logical Theory Of Constructions
- 1985
-
Ingår i: Lecture Notes in Computer Science (Functional Programming Languages and Computer Architecture, Nancy, France, September 16-19, 1985, Proceedings.; Jean-Pierre Jouannaud (Ed.). - 0302-9743 .- 1611-3349. - 3540159754 ; 201, s. 334-349
-
Konferensbidrag (refereegranskat)
|
|
| 3. |
- Dybjer, Peter, 1953
(författare)
-
Using Domain Algebras To Prove The Correctness Of A Compiler
- 1985
-
Ingår i: Lecture Notes in Computer Science (STACS 85, 2nd Symposium of Theoretical Aspects of Computer Science, Saarbrücken, Germany, January 3-5, 1985, Proceedings; Kurt Mehlhorn (Ed.)). - 0302-9743 .- 1611-3349. ; 182, s. 98-108
-
Konferensbidrag (refereegranskat)
|
|
| 4. |
- Smeets, Ben, et al.
(författare)
-
A Comment on Niederreiter’s Public Key Cryptosystem
- 1986
-
Ingår i: Advances in Cryptology — EUROCRYPT’ 85. EUROCRYPT 1985 : Proceedings of a Workshop on the Theory and Application of Cryptographic Techniques Linz, Austria, April 1985 - Proceedings of a Workshop on the Theory and Application of Cryptographic Techniques Linz, Austria, April 1985. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1611-3349 .- 0302-9743. - 9783540164685 - 9783540398059 ; 219, s. 40-42
-
Konferensbidrag (refereegranskat)abstract
- In this comment we show that a recently proposed public key cryptosystem is not safe for most of the practical cases. Furthermore, it is shown that the security of this system is closely connected with the problem of computing logarithms over a finite field.
|
|
| 5. |
- Smeets, B. J.M., et al.
(författare)
-
Windmill generators a generalization and an observation of how many there are
- 1988
-
Ingår i: Advances in Cryptology — EUROCRYPT 1988 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. - Berlin, Heidelberg : Springer Berlin Heidelberg. - 1611-3349 .- 0302-9743. - 9783540502517 ; 330 LNCS, s. 325-330
-
Konferensbidrag (refereegranskat)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.
|
|
