nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An Efficient Protocol for Authenticated Key Agreement
|
Laurie Law |
|
2003 |
28 |
2 |
p. 119-134 16 p. |
artikel |
2 |
An Efficient Protocol for Authenticated Key Agreement
|
Law, Laurie |
|
2003 |
28 |
2 |
p. 119-134 |
artikel |
3 |
Extremal Self-Dual Codes over \Bbb{F}2 × \Bbb{F}2
|
Koichi Betsumiya |
|
2003 |
28 |
2 |
p. 171-186 16 p. |
artikel |
4 |
Extremal Self-Dual Codes over $$\mathbb{F}$$2 × $$\mathbb{F}$$2
|
Betsumiya, Koichi |
|
2003 |
28 |
2 |
p. 171-186 |
artikel |
5 |
Extremal Self-Dual [50, 25, 10] Codes with Automorphisms of Order 3 and Quasi-Symmetric 2-(49, 9,6) Designs
|
Stefka Bouyuklieva |
|
2003 |
28 |
2 |
p. 163-169 7 p. |
artikel |
6 |
Extremal Self-Dual [50, 25, 10] Codes with Automorphisms of Order 3 and Quasi-Symmetric 2-(49, 9,6) Designs
|
Bouyuklieva, Stefka |
|
2003 |
28 |
2 |
p. 163-169 |
artikel |
7 |
Improvement of the Delsarte Bound for -Designs When It Is Not the Best Bound Possible
|
Svetla Nikova |
|
2003 |
28 |
2 |
p. 201-222 22 p. |
artikel |
8 |
Improvement of the Delsarte Bound for τ-Designs When It Is Not the Best Bound Possible
|
Nikova, Svetla |
|
2003 |
28 |
2 |
p. 201-222 |
artikel |
9 |
Linear Complexity of the Discrete Logarithm
|
Sergei Konyagin |
|
2003 |
28 |
2 |
p. 135-146 12 p. |
artikel |
10 |
Linear Complexity of the Discrete Logarithm
|
Konyagin, Sergei |
|
2003 |
28 |
2 |
p. 135-146 |
artikel |
11 |
On the Security of Digital Signature Schemes Based on Error-Correcting Codes
|
Sheng-bo Xu |
|
2003 |
28 |
2 |
p. 187-199 13 p. |
artikel |
12 |
On the Security of Digital Signature Schemes Based on Error-Correcting Codes
|
Xu, Sheng-bo |
|
2003 |
28 |
2 |
p. 187-199 |
artikel |
13 |
Quasi-Symmetric Designs with Good Blocks and Intersection Number One
|
V. C. Mavron |
|
2003 |
28 |
2 |
p. 147-162 16 p. |
artikel |
14 |
Quasi-Symmetric Designs with Good Blocks and Intersection Number One
|
Mavron, V. C. |
|
2003 |
28 |
2 |
p. 147-162 |
artikel |