• Publications
  • Influence
Orthogonal Designs: Quadratic Forms and Hadamard Matrices
  • 487
  • 37
HAVAL - A One-Way Hashing Algorithm with Variable Length of Output
A one-way hashing algorithm is a deterministic algorithm that compresses an arbitrary long message into a fingerprint of 128, 160, 192, 224 or 256 bits. Expand
  • 207
  • 18
Fundamentals of Computer Security
From the Publisher: The book studies modern concepts of Computer Security. Expand
  • 257
  • 16
Hadamard matrices, Sequences, and Block Designs
One hundred years ago, in 1893, Jacques Hadamard [31] found square matrices of orders 12 and 20, with entries ±1, which had all their rows (and columns) pairwise orthogonal. These matrices, X =Expand
  • 301
  • 14
Nonlinearity and Propagation Characteristics of Balanced Boolean Functions
We show that concatenating, splitting, modifying, and multiplying (in the sense of Kronecker) sequences can yield balanced Boolean functions with a very high nonlinearity. Expand
  • 99
  • 13
  • PDF
Identification of Bad Signatures in Batches
The paper addresses the problem of bad signature identification in batch verification of digital signatures. Expand
  • 52
  • 9
  • PDF
Nonlinearly Balanced Boolean Functions and Their Propagation Characteristics (Extended Abstract)
This paper studies systematic methods for constructing Boolean functions satisfying some or all of the three criteria. Expand
  • 93
  • 8
  • PDF
Public Key Cryptography
  • J. Seberry
  • Computer Science
  • Lecture Notes in Computer Science
  • 2000
We are going to devote most of our attention in this talk to the RSA Public Key Cryptosystem because it not only remains unbroken but it has some other useful features for digital signatures and authentication. Expand
  • 175
  • 6
LOKI - A Cryptographic Primitive for Authentication and Secrecy Applications
This paper provides an overview of the LOKI encryption primitive which may be used to encrypt and decrypt a 64-bit block of data using a64-bit key. Expand
  • 128
  • 6
Secret sharing schemes arising from latin squares
A critical set in a latin square is a partial latin square which has a unique completion. In this paper we demonstrate how critical sets can be used in the design of secret sharing schemes.Expand
  • 63
  • 6