Designs, Codes and Cryptography
, Volume 12, 1997
Volume 12, Number 1, September 1997
Iliya Boukliev
: Some New Optimal Ternary Linear Codes. 5-11
BibTeX
Mike Burmester
,
Yvo Desmedt
,
Fred Piper
,
Michael Walker
: A General Zero-Knowledge Scheme. 13-37
BibTeX
Stefka Buyuklieva
: On the Binary Self-Dual Codes with an Automorphism of Order 2. 39-48
BibTeX
Robert Craigen
,
Hadi Kharaghani
: Hadamard Matrices from Weighing Matrices via Signed Groups. 49-58
BibTeX
F. Franek
,
Alexander Rosa
,
Terry S. Griggs
: Large Sets of Mutually Almost Disjoint Steiner Triple Systems Not From Steiner Quadruple Systems. 59-67
BibTeX
John L. Hayden
: Generalized Hadamard Matrices. 69-73
BibTeX
Xiang-dong Hou
: The Reed-Muller Code R(1, 7) Is Normal. 75-82
BibTeX
Tatsuya Maruta
: On the Achievement of the Griesmer Bound. 83-87
BibTeX
Leo Storme
: Normal Rational Curves over Prime Fields. 89-96
BibTeX
Volume 12, Number 2, October 1997
Hanno Lefmann
,
Pavel Pudlák
,
Petr Savický
: On Sparse Parity Check Matrices. 107-130
BibTeX
Vladimir I. Levenshtein
: Split Orthogonal Arrays and Maximum Independent Resilient Systems of Functions. 131-160
BibTeX
Marten van Dijk
: A Linear Construction of Secret Sharing Schemes. 161-201
BibTeX
Volume 12, Number 3, November 1997
Special Issue: Selected Areas in Cryptography
Evangelos Kranakis
,
Paul C. van Oorschot
: Special Issue: Selected Areas in Cryptography - Introduction. 213
BibTeX
Douglas R. Stinson
: On Some Methods for Unconditionally Secure Key Distribution and Broadcast Encryption. 215-243
BibTeX
N. Rogier
,
Pascal Chauvaud
: MD2 Is not Secure without the Checksum Byte. 245-251
BibTeX
Vincent Rijmen
,
Bart Preneel
,
Erik De Win
: On Weaknesses of Non-surjective Round Functions. 253-266
BibTeX
J. Lee
,
Howard M. Heys
,
Stafford E. Tavares
: Resistance of a CAST-Like Encryption Algorithm to Linear and Differential Cryptanalysis. 267-282
BibTeX
Carlisle M. Adams
: Constructing Symmetric Ciphers Using the CAST Design Procedure. 283-316
BibTeX
Copyright ©
Sat May 16 23:56:26 2009 by
Michael Ley
(
ley@uni-trier.de
)