Selected Works of Prof. Jennifer R. Seberry

Professor Seberry is Director of the Centre for Computer Security Research at the University of Wollongong. She graduated PhD in Computation Mathematics from La Trobe University in 1971 and subsequently held positions at the Australian National University, the University of Sydney and University College, the Australian Defence Force Academy and the University of New South Wales. She has published extensively in Discrete Mathematics and is world renown for her new discoveries on Hadamard matrices, orthogonal designs and statistical designs. In 1970 she co-founded the series of conferences known as the XXth Australian Conference on Combinatorial Mathematics and Combinatorial Computing.

Documents by Subject Area

No subject area

A Construction Technique for Generalized Complex Orthogonal Designs and Applications to Wireless Communications
A Cryptographic Solution for General Access Control
A generalized algorithm for the generation of correlated Rayleigh fading envelopes
A Generalized Algorithm for the Generation of Correlated Rayleigh Fading Envelopes in Radio Channels
A Minimal Critical Set of a Class of Youden Squares
A new algorithm for computer searches for orthogonal designs
A New Cryptanalytic Method Using the Distribution Characteristics of Substitution Distances
A new method for constructing T-matrices
A Search for Hadamard Matrices constructed from Williamson Matrices
Access Policy Sheet for Access Control in Fine-Grained XML
Amicable Orthogonal Designs of Order 8 for Complex Space-Time Block Codes
An Algorithm to find Formulae and Values of Minors for Hadamard Matrices
An Algorithm to find Formulae and Values of Minors for Hadamard matrices: II
An exposure property of block designs
An infinite family of Goethals-Seidel arrays
An infinite family of Hadamard matrices with fourth last pivot n/2
Application of the Discrete Fourier Transform to the Search for Generalised Legendre Pairs and Hadamard Matrices
Back circulant Latin squares and the influence of a set
Bose's Method of Differences Applied to Construct Bhaskar Rao Designs
Bounds on the Maximum Determinant for (1, –1) Matrices
Codes Identifying Bad Signatures in Batches
Combinatorial Constructions of 3- and 4-Secure Codes
Combinatorial structures for Design of Wireless Sensor Networks
Complex orthogonal sequences from amicable Hadamard matrices
Complex Orthogonal Spreading Sequences Using Mutually Orthogonal Complementary Sets
Construction of highly non-linear cubic homogeneous Boolean functions on GF2n+l (2)
Covert Distributed Computing Using Java Through Web Spoofing
Critical sets for a pair of mutually orthogonal cyclic latin squares of odd order greater than 9
Critical sets in orthogonal arrays with 7 and 9 levels
Crypto Topics And Applications I
Crypto Topics And Applications II
Delegatable Access Control for Fine-Grained XML
Delegatable Access Control for Fine-Grained XML
Design and Implementation of Personal Firewalls for Handheld Devices
Equitability in Retroactive Key Confiscation versus Proactive Key Escrow
Equitable Key Escrow with Limited Time Span (or, How to Enforce Time Expiration Cryptographically)
Forensic Computing
Further Observations on the Structure of the AES Algorithm
Further Results on Strongbox Secured Secret Sharing Schemes
Generalized Bhaskar Rao Designs with Block Size 4 Signed over Elementary Abelian Groups
Generalized orthogonal designs
Generalized Williamson and Wallis-Whiteman Constructions for Improved Square Order-8 CO STBCs
Golay Sequences for DS CDMA Applications
Group Divisible Designs, GBRSDS And Generalized Weighing Matrices
Growth in Gaussian Elimination for Weighing Matrices, W (n, n — 1)
Hadamard ideals and Hadamard matrices with circulant core
Hadamard matrices, orthogonal designs and construction algorithms
Homogeneous Bent Functions
Homogeneous bent functions of degree n in 2n variables do not exist for n > 3
Identification of Bad Signatures in Batches
Inequivalence of Nega-cyclic ±1 Matrices
Infinite Families of Orthogonal Designs : I
Necessary and sufficient conditions for some two variable orthogonal designs in order 44
Necessary and Sufficient Conditions for Three and Four Variable Orthogonal Designs in Order 36
Necessary and sufficient conditions for two variable orthogonal designs in order 44: Addendum
New D-optimal Designs of Order 110
New orthogonal designs and sequences with two and three variables in order 28
New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function - a review
On A Use Of Golay Sequences For Asynchronous DS CDMA Applications
On Amicable Orthogonal Designs of Order 8
On amicable sequences and orthogonal designs
On circulant best matrices and their applications
On Circulant Weighing Matrices
On F-Squares and their Critical Sets
On Full Orthogonal Designs in Order 56
On Full Orthogonal Designs in Order 72
On Infinite Families of Sequences with One and Two Valued Autocorrelation and Two Valued Crosscorrelation Function
On New Families of Supplementary Difference Sets over Rings with Short Orbits
On Orthogonal Designs in Order 48
On Ternary Complementary Pairs
On the (10, 5, λ)-Family of Bhaskar Rao Designs
On the (v,5,λ)-Family of Bhaskar Rao Designs
On the complete pivoting conjecture for Hadamard matrices of small orders
On the growth problem for skew and symmetric conference matrices
On Using Fast Exponentiation Algorithm in PDAs (or: How Secure is the Discrete Logarithm Problem Assumption in PDAs?)
Orthogonal Designs from Negacyclic Matrices
Orthogonal Designs of Kharaghani Type: I
Orthogonal Designs of Kharaghani Type: II
Orthogonal Designs with Quaternion Elements
Perfect Secret Sharing Schemes from Room Squares
Py (Roo): A Fast and Secure Stream Cipher
Regular Hadamard Matrices, Maximum Excess and SBIBD
Secure Computations on Handheld Devices with the Help of an Untrusted Server
Short Amicable Sets
Short amicable sets and Kharaghani type orthogonal designs
Some new results of regular Hadamard matrices and SBIBD II
Some results on Kharaghani type orthogonal designs
Some results on self-orthogonal and self-dual codes
Strongbox Secured Secret Sharing Schemes
The Analysis of Zheng-Seberry Scheme
The Maximal Determinant and Subdeterminants of ±1 Matrices
The power and influence in some Youden squares and secret sharing
Two complex orthogonal space-time codes for eight transmit antennas
Two new complex orthogonal space time codes for 8 transmit antennas
Values of Minors of (1, 1) Incidence Matrices of SBIBDs and Their Application to the Growth Problem
Values of Minors of an Infinite Family of D-Optimal Designs and Their Application to the Growth Problem
Values of Minors of Some Infinite Families of Matrices Constructed from Supplementary Difference Sets and Their Application to the Growth Problem
Weighing Matrices and Self-Orthogonal Quaternary Codes
When the necessary conditions are not sufficient: sequences with zero autocorrelation function