Search All Sites
RSS Feed
Print this page
File
D-optimal experimental designs.
Dataset shows discoveries made by the author relating to Hadamard matrices.
Husain's SBIBD(16,6,2) (16,6,2) SBIBD(4k^2,2k^2+k,k^2+k) and regular symmetric Hadamard matrices of order 4k^2 and maximal excess...
Hadamard mathematical matrices for weighing.
PDF
In this paper, we study two digital signature algorithms, the DSA and ECDSA, which have...
Recently, quaternion orthogonal designs (QODs) were introduced as a mathematical construct with the potential for...
We employ theoretical and computational techniques to construct new weighing matrices constructed from two circulants....
In this note we use combinatorial methods to show that the unique, up to equivalence,...
Constructions of square, maximum rate complex orthogonal space–time block codes (CO STBCs) are well known,...
Over the past several years, there has been a renewed interest in complex orthogonal designs...
C. Koukouvinos, M. Mitrouli and Jennifer Seberry, in "Growth in Gaussian elimination for weighing matrices,...
In this paper we prove that there exist 4—{k2; ½k(k–1); k(k–2)} SDS, regular Hadamard matrices...
We show that if G is a finite Abelian group and the block size is...
In a large system, XML documents associated with it can be large and complicated. To...
We investigate subsets of critical sets of some Youden squares in the context of secret...
We consider the Youden square formed by deleting one row of a v x v...
Computational Algebra methods have been used successfully in various problems in many fields of Mathematics....
We apply Computational Algebra methods to the construction of Hadamard matrices with two circulant cores,...
New amicable orthogonal designs AODs(8; 1; 1; 1; 2; 2; 2), AODs(8; 1; 1; 4;...
We study nega-cyc1ic ±1 matrices. We obtain preliminary results which are then used to decrease...
We study nega-cyclic ±1 matrices. We obtain preliminary results which are then used to decrease...
For every prime power q ≡ 7 mod 16, we obtain the (q; a, b,...
Some new amicable orthogonal designs of order 8 are found as part of a complete...
We introduce a construction technique for generalized complex linear processing orthogonal designs, which are p...
An exposure property of block designs is defined and investigated in this paper. The families...
In this paper we construct an infinite family of Goethals-Seidel arrays and prove the theorem:...
To date investigations on critical sets for a set of mutually orthogonal latin squares (MOLS)...
To date very few results are known on the critical sets for a set of...
We show that all 3164 possible OD(48; s1, s2,s3) exist. In addition to the use...
We obtain explicit formulae for the values of the 2v - j minors, j =...
For every prime power q = 3 (mod 8) we prove the existence of (q;...
For every prime power q ≡1 (mod 4) we prove the existence of (q; x,...
Modern communications systems are heavily reliant on statistical techniques to recover information in the presence...
Two new constructions of complex orthogonal space-time block codes of order 8 based on the...
We extend our earlier work on ways in which defining sets of combinatorial designs can...
We prove that homogeneous bent functions f : GF(2)2n —> GF(2) of degree n do...
We study the use of negacyclic matrices to form orthogonal designs and hence Hadamard matrices....
H. Kharaghani, in "Arrays for orthogonal designs", J. Combin. Designs, 8 (2000), 166-173, showed how...
Orthogonal designs and their special cases such as weighing matrices and Hadamard matrices have many...
Technology is rapidly changing the speed and manner in which people interact with each other...
de Launey and Seberry have looked at the existence of Generalized Bhaskar Rao designs with...
We use generator matrices G satisfying GGT = aI+bJ over Zk to obtain linear self-orthogonal...
In this paper we study the maximal absolute values of determinants and subdeterminants of ±1...
An algorithm computing the (n — j) x (n — j ) , j =...
Abstract. We present our further observations on the structure of the AES algorithm relating to...
We find new full orthogonal designs in order 72 and show that of 2700 possible...
We use an array given in H. Kharaghani, Arrays for orthogonal designs, J. Combin. Designs,...
When k = q1, q2, q1q2, q1q4, q2q3N, q3q4N, q1, q2 and q3 are prime...
In this paper we give a general theorem which can be used to multiply the...
We consider families of linear self-orthogonal and self-dual codes over the ring Z4 which are...
Orthogonal bipolar spreading sequences are used in direct sequence code division multiple acces (DS-CDMA) systems...
We find new full orthogonal designs in order 56 and show that of 1285 possible...
We use a new algorithm to find new sets of sequences with entries from {0,...
We establish that the necessary conditions for the existence of Bhaskar Rao designs of block...
We describe the implementation of a distributed computer search that uses Williamson's construction for Hadamard...
We show that the equivalence class of Sylvester Hadamard matrices give an infinite family of...
Abstract: A pair of matrices X and Y are said to be amicable if XYT...
The Zheng-Seberry (ZS) encryption scheme was published in 1993 and was one of the first...
We generalize a method inspired by Kharaghani and Holzmann to obtain infinite families of 6-variables...
Call four type 1 (1, -1) matrices, X1, X2, X3, X4, of the same group...
We introduce Legendre sequences and generalised Legendre pairs (GL-pairs). We show how to construct a...
We give two new D-optimal designs of order 110.
We show how to construct infinite families of sequences that have one and two valued...
Let A = {a0, ... aℓ-1 }, B = {b0, . . . , bℓ-1...
We present a new algorithm for computer searches for orthogonal designs. Then we use this...
We give an algorithm to obtain formulae and values for minors of Hadamard matrices. One...
We introduce Legendre sequences and generalised Legendre pairs (GL-pairs). We show how to construct an...
We generalise a method inspired by Kharaghani and Holzmann to obtain infinite families of 6-variables...
The purpose of this paper is to give an overview of existing constructions and techniques...
In this paper we study explicitly the pivot structure of Hadamard matrices of small orders...
Short amicable sets were introduced recently and have many applications. The construction of short amicable...
We obtain explicit formulae for the values of the v j minors, j = 0,...
We obtain explicit formulae for the values of the v - j minors, j =...
We obtain explicit formulae for the values of the 2v — j minors, j =...
We prove that cubic homogeneous bent functions f : V2n → GF(2) exist for all...
Given an F-square of some type F(n; αo, αl, ..., αv-1) what critical set sizes...
Security of ordinary digital signature schemes relies on a computational assumption. Fail-stop signature schemes provide...
We suppose the Hadamard conjecture is true and an Hadamard matrix of order 4t, exists...
We consider the values for large minors of a skew-Hadamard matrix or conference matrix W...
This paper discusses homogeneous bent functions. The space of homogeneous functions of degree three in...
We establish the notions of influence, power and strong box in the critical sets of...
We consider structures which have rules for completion such as balanced incomplete block designs, Latin...
In our recent paper Necessary and sufficient conditions for some two variable orthogonal designs in...
We give new sets of sequences with entries from {0, ±a, ±b, ±c} on the...
We present one way in which combinatorial designs can be used to give conditionally perfect...
We define the notions of nest and influence of a subset of a critical set...
Recently K. T. Arasu (personal communication) and Yoseph Strassler, in his PhD thesis, The Classification...
We define the notion of critical set of an F-square, following the definition of critical...
The book, Orthogonal Designs: Quadratic Forms and Hadamard Matrices, Marcel Dekker, New York-Basel, 1979, by...
Algebraic techniques are employed to obtain necessary conditions for the existence of certain circulant weighing...
We give new constructions for regular group divisible designs, pairwise balanced designs, generalized Bhaskar Rao...
Cyclotomy can be used to construct a variety of combinatorial designs, for example, supplementary difference...
In this paper we show that BIBD(v,b,r,k,λ) where v = pq or pq + 1,...
In this paper we show that BIBD(v, b, r, k, λ), where v = pq...
We show that GBRD(p,1/2(p-1), 1/8(p-1)(p-3);EA(1/2p-1)) exist for all prime powers p ≡ 3 (mod 4)....
We give a new algorithm which allows us to construct new sets of sequences with...
We discuss difference sets (DS) and supplementary difference sets (SDS) over rings. We survey some...
We prove a theorem for BRD(10,5,Lambda)s and give thirteen (13) inequivalent BRD(10,5,4)s.
We prove a theorem for BRD(10,5,λ)s and give thirteen (13) inequivalent BRD(10,5,4)s
Secret sharing schemes are one of the most important primitives in distributed systems. In perfect...
The Mathematical Family Tree of Hans Rademacher (with A. Whiteman branch)
A modified protocol is proposed which prevents cheating in the Online multiple secret sharing scheme...
A Room square R of order r is an r x r array each of...
We give an overview on the existence of 4-NPAF (1,2w) sequences. We sketch some construction...
The Smith normal forms (SNF) of weighing matrices are studied. We show that for all...
We investigate multipliers of 2 - {v; q2, q2; λ} supplementary difference sets where cyclotomy...
Three major applications of weighing matrices are discussed. New weighing matrices and skew weighing matrices...
Reliable authentication of communicating entities is essential for achieving security in a distributed computing environment....
Algebraic techniques are employed to obtain necessary conditions for the existence of certain families of...
We present a computer-search method for concatenating or "multiplying" binary or ternary complementary pairs. All...
We give new sets of sequences with entries from {0, ±a, ±b, ±c, ±d} on...
New weighing matrices and skew weighing matrices are given for many orders 4t ≤ 100....
The Smith normal forms (SNF) of V-optimal designs of size < 100 are determined by...
During the last decade the decrease in the size of computing machinery, coupled with the...
We propose a novel quantum cryptographic protocol without using polarized photons. The protocol consists of...
In this paper we describe a practical solution towards anonymous and verifiable databases based on...
In this paper we establish a number of new lower bounds on the size of...
Three important criteria for cryptographically strong Boolean functions are balance, nonlinearity, and the propogation criterion....
The connections among the various nonlinearity criteria is currently an important topic in the area...
We give algorithms and constructions for mathematical and computer searches which allow us to establish...
It has been conjectured by Dinesh Sarvate and Jennifer Seberry, that, when p is an...
We conjecture that p specified sets of p elements are enough to define an SBIBD(2p+...
We prove that the conjecture on bent sequences stated in"Generating and counting bent sequences". IEEE...
A (1, -1)-matrix will be called a bent type matrix if each row and each...
For any integers n,m, 2n > m > n we construct a set of boolean...
Database authentication via cryptographic checksums represents an important approach to achieving an affordable safeguard of...
This paper presents a simple yet effective method for transforming Boolean functions that do not...
Near normal sequences of new lengths n = 4m + 1 = 49,53,57 are constructed....
We construct new TW -sequences, weighing matrices and orthogonal designs using near-Yang sequences. In particular...
Three of the most important criteria for cryptographically strong Boolean functions are the balancedness, the...
Normal sequences of lengths n = 18, 19 are constructed. It is proved through an...
Some theoretical results and computational algorithms are described which verify previous calculations, prove some theoretical...
Two significant recent advances in cryptanalysis, namely the differential attack put forward by Biham and...
A (t, w) threshold scheme is a method for sharing a secret among w shareholders...
A critical set in a latin square is a partial latin square which has a...
The strong Kronecker product has proved a powerful new multiplication tool for orthogonal matrices. This...
New series of balanced ternary designs and partially balanced ternary designs are obtained. Some of...
This paper presents three methods for strengthening public key cryptosystems in such a way that...
G-matrices for the new orders 21, 23, 25 and 27 are constructed. Some constructions for...
We show that M-structures can be extended to Hadamard matrices of generalized quaternion type and...
We give new sets of {0, 1, -1} sequences with zero autocorrelation function, new constructions...
Suppose A1,....,As are (1, -1) matrices of order m satisfying
AiAj=J, i,jє{1,...,s}
AtiAj=AtjAi=J, i≠j, i,jє{1,...,s}
We verify the skew weighing matrix conjecture for orders 2t.13, t ≥ 5, and give...
Strong Kronecker multiplication of two matrices is useful for constructing new orthogonal matrices from those...
A complex Hadamard matrix, C, of order n has elements 1, -1, i, - i...
The RSA public-key encryption system of Rivest, Shamir, and Adelman can be broken if the...
The Hadamard conjecture is that Hadamard matrices exist for all orders 1,2, 4t where t...
One hundred years ago, in 1893, Jacques Hadamard [31] found square matrices of orders 12...
We conjecture that 2t - 1 specified sets of 2t - 1 elements are enough...
We prove that if there exist Hadamard matrices of order 4m, 4n, 4p, and 4q...
We consider certain resolvable designs which have application to doubly perfect cartesian authentication schemes. These...
Professor Stanton has had a very illustrious career. His contributions to mathematics are varied and...
Four (1, -1, 0)-matrices of order m, X = (Xij), Y = (Yij), Z =...
How to present a research talk which will be remembered for a long(!) time for...
With the recent development of a number of new ciphers, especially block ciphers, there is...
New constructions for amicable orthogonal designs are given. These new designs then give new amicable...
The application of coding theory to security scenarios is studied. Authentication systems are introduced that...
It is shown that SBIBD( 4k2, 2k2 ± k, k2 ± k) and Hadamard matrices...
A necessary condition is given for the existence of some Generalised Bhaskar Rao designs (GBRDs)...
Kounias and Farmakis, in 'On the excess of Hadamard matrices', Discrete Math. 68 (1988) 59-69,...
This paper discusses critical sets for latin squares. We give the cardinality of the minimal...
We prove that if there exist Hadamard matrices of order h and n divisible by...
D-optimal designs of order n = 2v ≡ 2 (mod 4), where q is a...
We obtain new base sequences, that is four sequences of lengths m + p, m...
This paper reviews some possible design criteria for the key schedule in a DES style...
This paper provides an overview of the LOKI encryption primitive which may be used to...
This paper reviews some possible design criteria for the permutation P in a DES style...
The new concept of M-structures is used to unify and generalize a number of concepts...
Brickell, Simmons and others have discussed doubly perfect authentication systems in which an opponent's chance...
We survey the existence of base sequences, that is four sequences of lengths m +...
This paper describes a user authentication system based around the user's type signature, a statistical...
Stream ciphers use the output of a Pseudo-Random (PR) generator to mask the information stream....
Statistical databases are databases in which only statistical type of queries are allowed. The results...
We show that an SBIBD(4k², 2k² + k, k² + k) is equivalent to a...
We show that for each of the groups S3, D4, Q4, Z4 x Z2 and...
We give a formulation, via (1, - 1) matrices, of Mathon's construction for conference matrices...
We give a new construction for a known family of weighing matrices using the 2-adjugate...
We give some results on the excess of Hadamard matrices. We give a list for...
We show how orthogonal designs OD(48p²t;16p²t, 16p²t,16p²t) can be constructed from an Hadamard matrix of...
We extend a method of Kharaghani and obtain some new constructions for weighing matrices and...
Many new families of group divisible designs, balanced incomplete block designs and pairwise balanced designs...
Orthogonal designs were created to give a unifying approach to the construction of Hadamard matrices....
The Australia wide eftpos systems was developed by the Australian Retail Banks to meet Australian...
Generalized Hadamard matrices and colourable designs are used to construct many new group divisible designs.
We prove a new result for orthogonal designs showing if all full orthogonal designs, OD...
We show how Vanstone's construction, given in his paper "A note on a construction for...
It is shown that if q is a prime power then there are Williamson-type matrices...
Recently, Seberry proposed a method for subliminal message transmission over an insecure channel in the...
We explore the use of some combinatorial designs for possible use as secret codes. We...
A weighing matrix W = W(n,k) of order n and weight k is a square...
G.J. Simmons has advanced the concept of using authentication in an open channel to actually...
We show that the necessary conditions (i) 2tv(v-l) ≡ O(mod 3) (ii) v ≥ 3...
We show that the necessary conditions λ = 0 (mod IGI), λ(v-l)=0 (mod2), λv(v 1)...
Generalized Bhaskar Rao designs with non-zero elements from an abelian group G are constructed. In...
The analogue of Plotkin's bound is developed for ternary codes with high distance relative to...
Some recursive constructions are given for Bhaskar Rao designs. Using examples of these designs found...
A directed packing is a maximal collection of k-subsets, called blocks, of a set of...
In connection with the problem of finding the best projections of k-dimensional spaces embedded in...
Bhaskar Rao designs with elements from abelian groups are defined and it is shown how...
Some permanents of circulant (0,1) matrices are computed. Three methods are used. First, the permanent...
We review the history of the skew-weighing matrix conjecture and show that there exist skew-symmetric...
When n2 elements are given, they can be arranged in the form of a square;...
When n2 elements are given they can be arranged in the form of a square,...
We prove that if pv and pr -1 are both prime powers then there is...
A directed balanced incomplete block design with parameters (v,b,r,k,λ*), is a balanced incomplete block design...
A directed BIBD with parameters (v,b,r,k,λ*) is a BIBD with parameters (v, b, r, k,...
We show that orthogonal designs of type (l,k) exist for all k = 0,1,...,2 .15-1,...
Galois fields G,F(q2) are used to obtain a new infinite family of complex weighing matrices....
A recursive method of A. C. Mukhopadhay is used to obtain several new infinite classes...
We present some new results on amicable orthogonal designs. We obtain amicable Hadamard matrices of...
It is shown that Graeco-Latin block designs which have treatments totally balanced with respect to...
Some results are obtained on the permanent of cyclic (0,1) matrices which support the conjecture...
We consider the set of ordered partitions of n into m parts acted upon by...
Constructions are given for generalised Hadamard matrices and weighing matrices with entries from abelian groups....
Many people believe women cannot "do" mathematics. This is not true, Tables 1, 2 and...
Some improved upper and lower bounds are given for the excess of Hadamard matrices. The...
Recently I have proved that for every odd integer q there exists integers t and...
The structure is determined for the existence of some amicable weighing matrices. This is then...
In a recent manuscript "Some asymptotic results for orthogonal designs" Peter Eades showed that for...
The permanent of an n x n matrix A = (a;j) is the matrix function...
Repeat designs are introduced and it is shown how they may be used to give...
This is a short note showing the existence of all twovariable designs in order 80...
Several constructions are given which show how to construct orthogonal designs from sequences of commuting...
We verify the skew weighing matrix conjecture for orders 2t.7, t ~ 3 a positive...
In this note we use the theory of cyclotomy to help us construct initial blccks...
George Szekcres was born in Budapest on 29th May, 1911 the second of three sons...
Given any natural number q > 3 we show there exists an integer t ≤...
Constructions are given for orthogonal designs in orders divisible by eight. These are then used...
In perturbation calculations using basis states defined in terms of spherically symmetric potentials it is...
We give three new constructions for orthogonal designs using amicable orthogonal designs. These are then...
An orthogonal design of order n and type (s1, S2) on the commuting variables x1,...
Infinite families of amicable orthogonal designs are constructed with
(i) both of type (1, q)...
Recent advances in the construction of Hadamard matrices have depended on the existence of Baumert-Hall...
Four circulant (or type 1) (0,1,-1) matrices X1, X2, X3, X4 of order t with...
Orthogonal designs of special type have been extensively studied, and it is the existence of...
In [5] Raghavarao showed that if n = 2 (mod 4) and A is a...
Orthogonal designs are a natural generalization of the Baumert-Hall arrays which have been used to...
It is shown that if q is a prime power then there exists a circulant...
Let S1, S2,···, Sn be subsets of G, a finite abelian group of order v,...
A weighing matrix is an n x n matrix W = W(n, k) with entries...
The existence of Szekeres difference sets, X and Y, of size 2f with y E...
A balanced incomplete block design or BlBD is defined as an arrangement of v objects...
R. J. Turyn introduced complex Hadamard matrices and showed that if there is a complex...
We show that if four suitable matrices of order m exist then there are Hadamard...
Recursive constructions are given which permit, under conditions described in the paper, a (v, b,...
Let S1,S2 ,... ,Sn be subsets of V, a finite abelian group of order v...
We give a construction for Hadamard arrays and exhibit the arrays of orders 4t ,...
We discuss integer matrices B of odd order v which satisfy
Br = ± B,...
Given a finite abelian group V and subsets S1, S2, ... ,Sn of V, write...
The concepts of circulant and back circulant matrices are generalized to obtain incidence matrices of...
Previously the smallest order for which a skew-Hadamard matrix was not known was 92. We...
If X is a symmetric Hadamard matrix, Y is a skew-Hadamard matrix, and XYT is...
We investigate the existence of integer matrices B satisfying the equation BBT = rI +...
We consider integer matrices obeying certain generalizations of the incidence equations for (v, k, lambda)-configurations...
We define an n-type (1, -1) matrix N = 1 + R of order n...
A (v, k, lambda) configuration is conjectured to exist for every v, k and lambda...
In this paper it is shown that an Hadamard design with each letter repeated once...
(v, k, lambda) Configirations and Hadamard matrics
Whenever there exists a quasi-skew Hadamard matrix of order 4m and (4n - I, k,...
An Hadamard matrix H is a matrix of order n all of whose elements are...
Suppose In is a square-free odd integer, and A and B are any two Hadamard...
In this note the matrices W, X. Y, and Z are the incidence matrices of...
This paper presents a new family of complex spreading sequences designed using mutually orthogonal(MO) complementary...
Golay complementary sequences, often referred to as Golay pairs, are characterised by the property that...
We discuss algorithms for the construction of Hadamard matrices. We include discussion of construction using...
In this chapter we discuss four related areas of cryptology, namely: Authentication, Hashing, Message Authentication...
In this chapter we continue our exposition of the crypto topics which was begun in...
LEX is a stream cipher based on the round transformation of the AES block cipher,...
IP spoofing remains a problem today in the Internet. In this paper, a new system...
ALPHA-MAC is a MAC function which uses the building blocks of AES. This paper studies...
Combinatorial designs are very effective tools for managing keys in an infrastructure where power and...
With ubiquitous computer use and networking, concerns about security breaches have intensified. However the human...
We propose an access control scheme for developing authorization rules for XML documents, allowing flexible...
As one of the most popular information safeguarding mechanisms, access control is widely deployed in...
Constructions of square, maximum rate Complex Orthogonal Space-Time Block Codes (CO STBCs) are well known,...
The access control mechanisms are critical to ensure security in XML (eXtensible Markup Language). Several...
We introduce orthogonal designs with quaternion elements and show their existence. In future work we...
Although the generation of correlated Rayleigh fading envelopes has been intensively considered in the literature,...
Py (pronounced Roo, a shorthand for Kangaroo) is a new stream cipher designed especially for...
Although generation of correlated Rayleigh fading envelopes has been intensively considered in the literature, all...
This paper surveys the security of the message integrity code used in the IEEE802.11 Wireless...
The paper deals with the novel technique of designing complex spreading sequences with only four...
In this paper, 3- and 4-secure codes are constructed from combinatorial designs. Both constant weight...
Personal Digital Assistants (PDAs) have become one of the important tools in our life. Their...
Recently, handheld devices have become one of the most popular computing tools. Although handheld devices...
The work studies highly nonlinear Boolean functions in GF2n+1(2), i.e. for the dimensions where bent...
Personal Digital Assistants (PDAs) are the miniature of normal size PCs, with a very limited...
In the paper, we present a new class of orthogonal bipolar spreading sequences designed based...
In this paper, we suggest a new method for cryptanalysis of the basic structures of...
The British Regulations of Investigatory Powers (RIP) Act 2000 is one of the first modern...
The work is concerned with identification of bad signatures in a sequence which is validated...
The paper addresses the problem of bad signature identification in batch verification of digital signatures....
We study the relations between boolean functions and symmetric groups. We consider elements of a...
We use the Web Spoofing attack reported by Cohen and also the Secure Internet Programming...
With equitable key escrow the control of society over the individual and the control of...
Numerical algorithms for the computation of the Smith normal form of integral matrices are described....
Computer viruses pose a considerable problem for users of personal computers. The recent emergence of...
Two protocols for access to electronic strongbox are described in the context of electronic commerce....
This paper presents and discusses some design and security issues surrounding electronic strongboxes as an...
In this paper we introduce critical sets in Room squares. We give the cardinality of...
In this paper, we describe secret sharing schemes. We discuss Room squares and their critical...
As electronic commerce becomes a reality, additional services related to electronic commerce will also emerge....
An introduction to binary sequences, combinatorial designs and how they are related to communication theory...
An important question in designing cryptographic functions including substitution boxes (S-boxes) is the relationships among...
This paper studies the properties and constructions of non linear functions, which are a core...
The subject of this paper is the authentication services as found in the Kuperee3 server....
Kerberos-type authentication protocols have more to offer when they are founded upon public key cryptosystems....
A Boolean function is said to be correlation immune if its output leaks no information...
This paper studies the properties and constructions of nonlinear Boolean functions, which are a core...
A one-way hashing algorithm is a deterministic algorithm that compresses an arbitrary long message into...
Nonlinearity, 0-1 balancedness and strict avalanche criterion (SAC) are important criteria for cryptographic functions. Bent...
Differential Cryptanalysis is currently the most powerful tool available for analysing block ciphers, and new...
Proven secure signature schemes and unconditionally secure authentication schemes with arbiter have been proposed. The...
Substitution boxes (S-boxes) are a crucial component of DES-like block ciphers. This research addresses problems...
It is known that if there are base sequences of lengths m + p, m...
This paper suggests an improvement to the scheme by Bayer and Metzger for the encipherment...
An encryption scheme is proposed which allows a hierarchical organization of keys used to encrypt...
The public key cryptosystem published by Diffie and Hellman in 1976 is still of great...
Traditionally, users have been authenticated by asking them to provide some form of password. This...
We are going to devote most of our attention in this talk to the RSA...
We show that Bhaskar Rao designs of type BRD(v, b, r, 4, 6) exist for...
Higher-dimensional orthogonal designs of type (l,l)n are used to obtain higher-dimensional weighing matrices of type...
Some properties of a new class of codes constructed using circulant matrices over GF(3) will...
A computer has been used to list all known Hadamard matrices of order less than...
In general it is a difficult if not impossible task to find a latin square...
In a recent manuscript « Some asymptotic results for orthogonal designs » Peter Eades showed...
Let A =(si) be an n-tuple of positive integers such that Esi = 2k. We...
This paper surveys orthogonal designs which are an overview of Baumert-Hall arrays, Hadamard matrices and...
A balanced incomplete block design consists of a set of v elements arranged into b...
Sloane and Seidel have constructed (n,2n,1/2(n-2)) and (n-1,2n,1/2(n-2)) codes whenever n = 1 + a2...
In the past few years exciting new discoveries have been made in constructing Hadamard matrices....
A 4n x 4n Hadamard array, H, is a square matrix of order 4n with...
We study the conjecture: There exists a square (0,l,-l)-matrix W = W(w,k) of order w...
This letter proposes a simple but highly efficient technique to jointly utilize space, time, and...
In the letter we describe signal transmitted between two dual-polarized antennas using a quaternion notation....
