Jennifer Seberry

Q: What Schools Are Affiliated With Jennifer Seberry

Jennifer Seberry is affiliated with the following schools: La Trobe University, University of Wollongong

Jennifer Seberry's AcademicInfluence.com Rankings

Jennifer Seberry

Computer Science

#1207

World Rank

#1247

Historical Rank

computer-science Degrees

Jennifer Seberry

Mathematics

#3129

World Rank

#4680

Historical Rank

Measure Theory

#1161

World Rank

#1481

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Why Is Jennifer Seberry Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jennifer Roma Seberry is an Australian cryptographer, mathematician, and computer scientist, currently a professor at the University of Wollongong, Australia. She was formerly the head of the Department of Computer Science and director of the Centre for Computer Security Research at the university.

(See a Problem?)

Jennifer Seberry's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Orthogonal Designs: Quadratic Forms and Hadamard Matrices (1979) (490)
Hadamard matrices, Sequences, and Block Designs (1992) (307)
Fundamentals of Computer Security (2003) (274)
Public Key Cryptography (2000) (245)
HAVAL - A One-Way Hashing Algorithm with Variable Length of Output (1992) (219)
Cryptography - an introduction to computer security (1991) (182)
Advances in Cryptology — AUSCRYPT '92 (1992) (163)
LOKI - A Cryptographic Primitive for Authentication and Secrecy Applications (1990) (132)
Nonlinearity and Propagation Characteristics of Balanced Boolean Functions (1995) (99)
Nonlinearly Balanced Boolean Functions and Their Propagation Characteristics (Extended Abstract) (1993) (94)
Improving Resistance to Differential Cryptanalysis and the Redesign of LOKI (1991) (92)
On Constructions and Nonlinearity of Correlation Immune Functions (Extended Abstract) (1994) (89)
D-optimal designs (2011) (79)
Identity-Based Proxy Signature from Pairings (2007) (77)
On some applications of Hadamard matrices (2005) (77)
The Theory of Quaternion Orthogonal Designs (2008) (77)
Immunizing Public Key Cryptosystems Against Chosen Ciphertext Attacks (1993) (77)
Secret sharing schemes arising from latin squares (1994) (68)
Complex Hadamard matrices (1973) (68)
Systematic generation of cryptographically robust S-boxes (1993) (66)
Py (Roo): A Fast and Secure Stream Cipher using Rolling Arrays (2005) (63)
Adaptively Secure Identity-Based Broadcast Encryption With a Constant-Sized Ciphertext (2015) (63)
Application of the discrete Fourier transform to the search for generalised Legendre pairs and Hadamard matrices (2001) (60)
On the Existence of Hadamard Matrices (1976) (59)
Practical Approaches to Attaining Security Against Adaptively Chosen Ciphertext Attacks (Extended Abstract) (1992) (58)
New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function – a review (1999) (54)
Identification of Bad Signatures in Batches (2000) (52)
Latin squares and critical sets of minimal size (1991) (50)
Hadamard matrices, orthogonal designs and construction algorithms (2003) (48)
Relationships among nonlinearity criteria (1994) (47)
A construction for generalized hadamard matrices (1980) (46)
Weighing matrices and their applications (1997) (44)
Advances in Cryptology — AUSCRYPT '90 (1990) (43)
Orthogonal designs (2014) (41)
Highly Nonlinear 0-1 Balanced Boolean Functions Satisfying Strict Avalanche Criterion (1992) (41)
Circulant weighing matrices (2010) (40)
Supplementary difference sets and optimal designs (1991) (39)
Some classes of Hadamard matrices with constant diagonal (1972) (38)
Some remarks on supplementary difference sets (1973) (37)
Regular group divisible designs and Bhaskar Rao designs with block size three (1984) (37)
Equitable Key Escrow with Limited Time Span (or, How to Enforce Time Expiration Cryptographically) (1998) (35)
New Hadamard matrices and conference matrices obtained via Mathon's construction (1988) (35)
A review and new symmetric conference matrices (2014) (35)
Reusing Shares in Secret Sharing Schemes (1994) (34)
Hadamard ideals and Hadamard matrices with two circulant cores (2006) (34)
Orthogonal Designs: Hadamard Matrices, Quadratic Forms and Algebras (2017) (34)
All Directed BIBDs with k = 3 Exist (1980) (33)
All DBIBDs with block size four exist (1980) (33)
The Strong Kronecker Product (1994) (31)
Key Scheduling In Des Type Cryptosystems (1990) (31)
Homogeneous bent functions of degree n in 2n variables do not exist for nge3 (2004) (31)
New Solutions to the Problem of Access Control in a Hierarchy (1993) (30)
Generalized Bhaskar Rao designs (1984) (30)
Construction of Williamson type matrices (1975) (30)
On the Design of Permutation P in DES Type Cryptosystems (1990) (28)
Homogeneous bent functions (2000) (28)
On the products of Hadamard matrices, Williamson matrices and other orthogonal matrices using M-structures (1990) (27)
Construction of bent functions from two known bent functions (1994) (27)
Orthogonal (0,1,-1) matrices (1972) (27)
On inequivalent weighing matrices (1986) (27)
Relative Compromise of Statistical Databases (1990) (27)
Some remarks on generalised Hadamard matrices and theorems of Rajkundlia on SBIBDs (1979) (27)
Latin squares: critical sets and their lower bounds (1995) (26)
On sequences with zero autocorrelation (1994) (26)
Modeling dual polarization wireless fading channels using quaternions (2006) (25)
Error-correcting codes for authentication and subliminal channels (1991) (25)
A Generalized Algorithm for the Generation of Correlated Rayleigh Fading Envelopes in Wireless Channels (2005) (24)
Extended cubes: enhancing the cube attack by extracting low-degree non-linear equations (2011) (24)
Generalized Bhaskar Rao designs of block size three (1985) (24)
An algorithm to find formulae and values of minors for Hadamard matrices: II (2001) (24)
Improving the Strict Avalanche Characteristics of Cryptographic Functions (1994) (24)
Orthogonal designs III: Weighing matrices (1974) (24)
On the Symmetric Property of Homogeneous Boolean Functions (1999) (24)
Product of Four Hadamard Matrices (1992) (23)
Multiplication of sequences with zero autocorrelation (1994) (23)
Higher dimensional orthogonal designs and applications (1981) (23)
An experimental search and new combinatorial designs via a generalisation of cyclotomy (1998) (22)
Bhaskar Rao designs over small groups (1988) (22)
A New and Efficient Fail-stop Signature Scheme (2000) (21)
A remark on the excess of Hadamard matrices and orthogonal designs (1978) (21)
Secret Sharing Schemes Based on Room Squares (1996) (21)
A survey of base sequences, disjoint complementary sequences and OD(4t; t, t, t, t) (1989) (21)
Families of weighing matrices (1974) (20)
Perfect Secret Sharing Schemes from Room Squares (1998) (20)
Novel Constructions of Improved Square Complex Orthogonal Designs for Eight Transmit Antennas (2009) (20)
Encryption methods based on combinatorial designs (1986) (20)
A construction technique for generalized complex orthogonal designs and applications to wireless communications (2005) (20)
Combinatorial Structures for Design of Wireless Sensor Networks (2006) (20)
On the Security of NOEKEON against Side Channel Cube Attacks (2010) (20)
A skew-Hadamard matrix of order 92 (1971) (20)
A multistage protocol for aggregated queries in distributed cloud databases with privacy protection (2019) (19)
Bounds on the maximum determinant for (1,-1) matrices (2000) (19)
Two complex orthogonal space-time codes for eight transmit antennas (2004) (18)
Weighing Matrices and String Sorting (2009) (18)
On supplementary difference sets (1972) (18)
On Bhaskar Rao designs of block size four (1984) (18)
The Maximal Determinant and Subdeterminants of ±1 Matrices (2003) (18)
Circulant weighing designs (1996) (18)
On A Use Of Golay Sequences For Asynchronous DS CDMA Applications (2002) (18)
Orthogonal Designs IV: Existence Questions (1975) (18)
Some families of partially balanced incomplete block designs (1982) (17)
On G-matrices (1993) (17)
Security Analysis of Michael: The IEEE 802.11i Message Integrity Code (2005) (17)
Shared cryptographic bits via quantized quadrature phase amplitudes of light (1996) (17)
Addendum to further results on base sequences, disjoint complementary sequences, OD(4t; t, t, t, t) and the excess of Hadamard matrices (1991) (17)
Hadamard ideals and Hadamard matrices with circulant core (2003) (17)
Information security issues in mobile computing (1995) (16)
Cyclotomy, Hadamard arrays and supplementary difference sets (1972) (16)
Key Predistribution Schemes Using Block Designs in Wireless Sensor Networks (2009) (16)
Some matrices of Williamson type (1973) (16)
Pitfalls in Designing Substitution Boxes (Extended Abstract) (1994) (15)
A cubic RSA code equivalent to factorization (1992) (15)
Applications of Hadamard matrices (2003) (15)
A note on orthogonal Graeco-Latin designs (1979) (14)
Generalized Bhaskar Rao Designs with Block Size 3 over Finite Abelian Groups (2007) (14)
Remarks on extremal and maximum determinant matrices with moduli of real entries ≤ 1 (2014) (14)
A Cryptographic Solution for General Access Control (2005) (14)
Maximal ternary codes and Plotkin's bound (1984) (14)
Optimal designs, supplementary difference sets and multipliers (1997) (14)
Growth in Gaussian elimination for weighing matrices W(n,n-1) (2000) (14)
SBIBD(4k2, 2k2 +k,k2 +k) and Hadamard matrices of order 4k2 with maximal excess are equivalent (1989) (14)
New skew-Hadamard matrices of order 4cdot59 and new D-optimal designs of order 2cdot59 (2004) (14)
On ternary complementary pairs (2001) (13)
How to prevent cheating in Pinch's scheme (1997) (13)
The Analysis of Zheng-Seberry Scheme (2002) (13)
Regular Hadamard Matrices, Maximum Excess and SBIBD (2003) (13)
A generalized algorithm for the generation of correlated Rayleigh fading envelopes in radio channels (2005) (12)
Structures of Cryptographic Functions with Strong Avalanche Characteristics (Extended Abstract) (1994) (12)
Generalized Bhaskar Rao Designs with Block Size 4 Signed over Elementary Abelian Groups (2003) (12)
Group divisible designs, GBRDSDS and generalized weighing matrices (1998) (12)
Orthogonal designs V: Orders divisible by eight (1976) (12)
On orthogonal matrices with constant diagonal (1982) (12)
On the Internal Structure of Alpha-MAC (2006) (12)
Efficient Semi-static Secure Broadcast Encryption Scheme (2013) (12)
A Simple Orthogonal Space-Time-Polarization Block Code (2007) (12)
Two new complex orthogonal space time codes for 8 transmit antennas (2003) (12)
Strongbox secured secret sharing schemes (2000) (11)
The excess of complex Hadamard matrices (1993) (11)
Codes Identifying Bad Signature in Batches (2000) (11)
On the (v,5,λ)-Family of Bhaskar Rao Designs (2002) (11)
A Search for Hadamard Matrices constructed from Williamson Matrices (2002) (11)
Ordered Partitions and Codes Generated by Circulant Matrices (1979) (11)
The Relationship Between Propagation Characteristics and Nonlinearity of Cryptographic Functions (1995) (11)
Existence of SBIBD(4k2, 2k2±k, k2±k) and Hadamard matrices with maximal excess (1991) (11)
Two infinite families of symmetric hadamard matrices (2017) (11)
A new construction for Williamson-type matrices (1986) (11)
Generalized Williamson and Wallis-Whiteman constructions for improved square order-8 CO STBCs (2005) (10)
Williamson-Hadamard spreading sequences for DS-CDMA applications (2003) (10)
Amicable orthogonal designs of order 8 for complex space-time block codes (2006) (10)
A note on amicable Hadamard matrices (1973) (10)
A note on supplementary difference sets (1974) (10)
New Complex Orthogonal Space-Time Block Codes of Order Eight (2005) (10)
On sufficient conditions for some orthogonal designs and sequences with zero autocorrelation function (1996) (10)
Some orthogonal designs and complex Hadamard matrices by using two Hadamard matrices (1991) (10)
The skew - weighing matrix conjecture (1982) (9)
On skew Hadamard matrices (1978) (9)
Fault Analysis of the KATAN Family of Block Ciphers (2012) (9)
An infinite family of Goethals-Seidel arrays (2005) (9)
Further Observations on the Structure of the AES Algorithm (2003) (9)
On weighing matrices (1993) (9)
Necessary and sufficient conditions for some two variable orthogonal designs in order 36 (1996) (9)
Some orthogonal matrices constructed by strong Kronecker multiplication (1993) (8)
Efficient Trapdoor-Based Client Puzzle Against DoS Attacks (2010) (8)
Higher dimensional orthogonal designs and hadamard matrices (1980) (8)
A New Method for Constructing Williamson Matrices (2005) (8)
Database authentication revisited (1994) (8)
Generalised Cycling Attacks on RSA and Strong RSA Primes (1999) (8)
On F-squares and their critical sets (1999) (8)
On the existence of Turyn sequences of length less than 43 (1994) (8)
On circulant best matrices and their applications (2001) (8)
New orthogonal designs and sequences with two and three variables in order 28 (1999) (8)
On the Smith normal form of D-optimal designs (1996) (8)
Minimal Critical Set of a Room Square of order 7 (1997) (8)
A multilevel encryption scheme for database security (1989) (8)
On the growth problem for skew and symmetric conference matrices (2005) (8)
Public-Key Cryptosystems (2003) (8)
On the weighing matrices of order 4n and weight 4n-2 and 2n-1 (1995) (8)
Some Results on Configurations (1971) (8)
Further results on strongbox secured secret sharing schemes (2004) (8)
On New Families of Supplementary Difference Sets over Rings with Short Orbits (1998) (8)
Constructions of balanced ternary designs based on generalized Bhaskar Rao designs (1993) (7)
On small defining sets for some SBIBD(4t-1, 2t-1, t-1) (1992) (7)
Some results on the excesses of Hadamard matrices (1988) (7)
Authentication without secrecy (1986) (7)
New D-optimal designs of order 110 (2001) (7)
Orthogonal Designs with Quaternion Elements (2005) (7)
Regular Hadamard matrix, maximum excess and SBIBD (2003) (7)
Multiplications of ternary complementary pairs (1996) (7)
On circulant and two-circulant weighing matrices (2010) (7)
Williamson matrices of even order (1974) (7)
New constructing of regular Hadamard matrices (2006) (7)
Generalized Hadamard matrices and colourable designs in the construction of regular GDDs with two and three association classes (1986) (7)
Quaternion orthogonal designs from complex companion designs (2008) (7)
Highly nonlinear balanced Boolean functions satisfying high degree propagation criterion (1993) (6)
Computer Viruses An Introduction (1997) (6)
The Propus Construction for Symmetric Hadamard Matrices (2015) (6)
Comments on 'Generating and counting binary Bent sequences' (1994) (6)
A note on BIBDS (1973) (6)
Key Establishment Protocols (2003) (6)
Orthogonal Designs in powers of two (1977) (6)
A class of group divisible designs (1978) (6)
Cryptographic Boolean functions via group Hadamard matrices (1994) (6)
Strongboxes for electronic commerce (1996) (6)
Construction of cubic homogeneous boolean bent functions (2000) (6)
The directed packing numbersDD(t, v, v), t≧4 (1984) (6)
Hadamard matrices of order =8 (mod 16) with maximal excess (1991) (6)
Complex Orthogonal Spreading Sequences using Mutually Orthogonal Complementary Sets (2006) (6)
On amicable orthogonal designs of order 8 (2006) (6)
On the distribution of the permanent of cyclic (0,1) matrices (1979) (6)
A new method for constructing T-matrices (2005) (6)
Applications of smartcards for anonymous and verifiable databases (1995) (6)
Covert Distributed Computing Using Java Through Web Spoofing (1998) (6)
Back circulant Latin squares and the influence of a set (1999) (5)
Observations on the Message Integrity Code in IEEE802.11Wireless LANs (2004) (5)
On the Complete Pivoting Conjecture for Hadamard Matrices of Small Orders (2001) (5)
Access Policy Sheet for Access Control in Fine-Grained XML (2005) (5)
Application of nega-cyclic matrices to generate spreading sequences (2003) (5)
Generalised Bhaskar Rao designs of block size 3 over the group Z4 (1985) (5)
On the pivot structure for the weighing matrix W(12,11) (2007) (5)
ICT professionals’ perceptions of responsibility for breaches of computer security (2006) (5)
A class of codes generated by circulant weighing matrices (1978) (5)
Jacket matrices constructed from Hadamard matrices and generalized Hadamard matrices (2006) (5)
A note on using sequences to construct orthogonal designs (1976) (5)
Practical Proven Secure Authentication with Arbitration (1992) (5)
On orthogonal designs in order 48 (2005) (5)
Constructing Hadamard matrices from orthogonal designs (1992) (5)
Some remarks on Hadamard matrices (2010) (5)
Golay Sequences for DS CDMA Applications (2002) (5)
New weighing matrices of order 2n and weight 2n-9 (2010) (5)
Beacon Based Authentication (1994) (5)
Complex orthogonal sequences from amicable Hadamard matrices (2004) (5)
Some Remarks on Authentication Systems (1990) (4)
Some new weighing matrices using sequences with zero autocorrelation function (1993) (4)
Necessary and sufficient conditions for three and four variable orthogonal designs in order 36 (2002) (4)
Generalized orthogonal designs (2004) (4)
Two-level Cretan matrices constructed using SBIBD (2015) (4)
Proceedings of the 7th Australian Conference on Information Security and Privacy (2002) (4)
Experience of using a type signature password system for user authentication in a heavily used computing environment (1989) (4)
Delegatable Access Control for Fine-Grained XML (2005) (4)
A note on orthogonal designs (1987) (4)
Repeated Differential Properties of the AES-128 and AES-256 Key Schedules (2011) (4)
A few more small defining sets for SBIBD(4t-1, 2t-1, t-1) (1994) (4)
Authentication via Multi-Service Tickets in the Kuperee Server (1994) (4)
Cretan(4t+1) Matrices (2015) (4)
Minimal and Maximal Critical Sets in Room Squares (1996) (4)
User unique identification (1989) (4)
A computer listing of hadamard matrices (1978) (4)
Proceedings of the Second International Workshop on Information Security (1997) (4)
On the structure and existence of some amicable orthogonal designs (1978) (4)
Inter-Domain Routing Validator Based Spoofing Defence System (2010) (4)
A subliminal channel in codes for authentication without secrecy (1985) (3)
New weighing matrices constructed from two circulant submatrices (2012) (3)
Replicating the Kuperee authentication server for increased security and reliability (1996) (3)
Generalised Bhaskar Rao designs with elements from cyclic groups of even order (1991) (3)
Using cyclotomy to construct orthogonal designs (1976) (3)
On the Smith normal form of weighing matrices (1997) (3)
Recent advances in the construction of Hadamard matrices (1973) (3)
Values of Minors of (1, −1) Incidence Matrices of SBIBDs and Their Application to the Growth Problem (2001) (3)
Values of Minors of an Infinite Family of D-Optimal Designs and Their Application to the Growth Problem: II (2002) (3)
Resolvable designs applicable to cryptographic authentication schemes (1992) (3)
Structures of Highly Nonlinear Cryptographic Functions (1994) (3)
Some new results of regular Hadamard matrices and SBIBD II (2007) (3)
Multiple-Input Multiple-Output Systems with Space-Time Codes (2006) (3)
Short Amicable Sets (2002) (3)
TWO LEVEL CRETAN MATRICES CONSTRUCTED VIA SINGER DIFFERENCE SETS (2014) (3)
On Hadamard Matrices (2020) (3)
Amicable Hadamard matrices and amicable orthogonal designs (1991) (3)
A Five-Round Algebraic Property of the Advanced Encryption Standard (2008) (3)
Information security and privacy : 8th Australasian Conference, ACISP 2003, Wollongong, Australia, July 9-11, 2003 : proceedings (2003) (3)
On Full Orthogonal Designs in Order 56 (2002) (3)
Kuperee: An Approach to Authentication using Public Keys (1994) (3)
Relationships Among Nonlinear Criteria (Extended Abstract) (1994) (3)
An eigenvalue approach evaluating minors for weighing matrices W(n,n − 1) (2012) (3)
Hadamard matrices, orthogonal designs and clifford-gastineau-hills algebras (2018) (3)
Pitfalls in Designing Substitution (1994) (3)
A survey of orthogonal designs (1974) (3)
Pseudo-random sequence generators using structured noise (1991) (2)
Pitfalls in designing substitution boxes (2020) (2)
New classes of orthogonal designs constructed from complementary sequences with given spread (2010) (2)
Coloured designs, new group divisible designs and pairwise balanced designs (1986) (2)
Some remarks on the permanents of circulant (0,1) matrices (1982) (2)
A generalised testbed for analysing block and stream ciphers (1991) (2)
Equitability in Retroactive Data Confiscation versus Proactive Key Escrow (2001) (2)
Semi Williamson type matrices and the W(2n, n) conjecture (1992) (2)
Gastineau-Hills Schemes: Product Designs and Repeat Designs (2017) (2)
Some asymptotic results for orthogonal designs: II (1976) (2)
Discrete algorithms and methods for security of statistical databases related to the work of Mirka Miller (2018) (2)
Constructions for Orthogonal Designs via Plug in and Plug into Matrices (2017) (2)
Consistent Differential Patterns of Rijndael (2002) (2)
Advances in Cryptology - AUSCRYPT '92, Workshop on the Theory and Application of Cryptographic Techniques, Gold Coast, Queensland, Australia, December 13-16, 1992, Proceedings (1993) (2)
Systematic Generation of Cryptographically Robust S-boxes ( Extended Abstract ) * (2017) (2)
Vizualizing Hadamard Matrices : the Propus Construction (2014) (2)
Necessary and sufficient conditions for two variable orthogonal designs in order 44: Addendum (2000) (2)
Construction of amicable orthogonal designs of quaternions (2009) (2)
A note on asymptotic existence results for orthogonal designs (1977) (2)
Circles on lattices and Hadamard matrices (2019) (2)
Encryption Exponent 3 and the Security of RSA (1986) (2)
A new generic digital signature algorithm (2011) (2)
When the necessary conditions are not sufficient: sequences with zero autocorrelation function (1999) (2)
A five-round algebraic property of AES and its application to the ALPHA-MAC (2009) (2)
New results with near- Yang sequences (1994) (2)
Three-level Cretan matrices constructed via conference matrices (2015) (2)
Some infinite classes of Hadamard matrices (1980) (2)
Complex weighing matrices and orthogonal designs (1980) (2)
Orthogonal Designs of Kharaghani Type: II (2004) (2)
On weighing matrices with square weights (1988) (2)
The cryptographic significance of the knapsack problem (1988) (2)
Crypto Topics and Applications II (1999) (2)
A New Family of Amicable Hadamard Matrices (2013) (2)
Performance comparison of sequences designed from the Hall Difference Set and Orthogonal Gold Sequences of Length 32 (2005) (2)
A new algorithm for computer searches for orthogonal designs (2001) (2)
World's toughest encryption scheme is 'vulnerable' ...so what about you? (2011) (2)
Some remarks on amicable orthogonal designs (1980) (2)
The effect of imperfect carrier recovery on the performance of the diversity antenna selection technique in wireless channels utilizing DSTM (2004) (2)
A Life's Work on Hadamard Matrices, Statistical Designs, Bent Functions and Their Application to Computer and Information Security in Networks and Telecommunications (2007) (2)
Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology (1992) (2)
Bose's Method of Differences Applied to Construct Bhaskar Rao Designs (1998) (2)
Construction of Highly Non-Linear Cubic Homogeneous Boolean Functions on GF2n+1(2) (2003) (2)
Hadamard matrices constructed by circulant and negacyclic matrices (2006) (2)
Search Key Substitution in the Encipherment of B-Trees (1990) (2)
Regular sets of matrices and applications (1993) (2)
On Good Matrices and Skew Hadamard Matrices (2015) (2)
Beacons for Authentication in Distributed Systems (1996) (2)
The power and influence in some Youden squares and secret sharing (2007) (1)
Design and security issues in strongbox systems for the internet (1996) (1)
Generation of a frequency square orthogonal to a 10×10 latin square (1978) (1)
Using digital tickets to protect personal privacy (2005) (1)
Reduction of angular momentum expressions by matrix arithmetic (1976) (1)
A Generalized Policy Support System and Its Hierarchy Semantics (2004) (1)
On 4-NPAF(1,2w) sequences (1997) (1)
Information Security in Mobile Databases (1995) (1)
On Generalized Hadamard Matrices and Difference Matrices: $Z_6$ (2015) (1)
Companion Viruses and the Macintosh: Threats and Countermeasures (1999) (1)
Vanstone's construction applied to Bhaskar Rao designs (1987) (1)
Combinatorial Constructions of 3- and 4-Secure Codes (2003) (1)
Space-Time-Polarization Block Codes from Quaternionic Orthogonal Designs (2007) (1)
Equivalence of the Existence of Hadamard Matrices and Cretan$(4t-1,2)$-Mersenne Matrices (2015) (1)
On Constructions and Nonlinearity of Correlation Immune Functions (cid:0) (2009) (1)
TWO-VARIABLE ORTHOGONAL MATRICES FROM SBIBD (2015) (1)
Weighing Matrices and Self-Orthogonal Quaternary Codes (2003) (1)
New weighing matrices (1996) (1)
Some results on self-orthogonal and self-dual codes (2003) (1)
Efficient authentication and integrity protection for the border gateway protocol (2014) (1)
Combinatorial Mathematics: Proceedings of the International Conference on Combinatorial Theory, Canberra, August 16-27, 1977 (1978) (1)
Orthogonal designs from negacyclic matrices (2004) (1)
Transmitter diversity antenna selection techniques for wireless channels utilizing differential space-time block codes (2006) (1)
On Using Fast Exponentiation Algorithm in PDAs (or: How Secure is the Discrete Logarithm Problem Assumption in PDAs?) (2003) (1)
An Infinite Family of Hadamard Matrices with Fourth Last Pivot n /2 (2002) (1)
Information Security and Privacy (2002) (1)
SBIBD ( 4 k 2 , 2 k 2 + k , k 2 + k ) and Hadamard matrices of order 4 k 2 with maximal excess are equivalent (2020) (1)
Some necessary and sufficient conditions for two variable orthogonal designs in order 44 (1998) (1)
Construction of amicable orthogonal designs (1975) (1)
Differential Fault Analysis of LEX (2010) (1)
An algorithm for orthogonal designs (1975) (1)
Critical sets in orthogonal arrays with 7 and 9 levels (2005) (1)
Electronic Funds Transfer Point of Sale in Australia (1986) (1)
Role-based Privacy Control for Health Information Systems (2003) (1)
On multi-modulation schemes to increase the rate of space-time block codes (2004) (1)
Selected Papers in Combinatorics: A Volume Dedicated to R.G. Stanton (1992) (1)
A Construction for 0, 1, -1 Orthogonal Matrices Visualized (2017) (1)
Influence of entries in critical sets of Room squares (2000) (1)
A construction for orthogonal designs with three variables (1987) (1)
Counting Techniques Specifying the Existence of Submatrices in Weighing Matrices (2005) (1)
A New Cryptanalytic Method Using the Distribution Characteristics of Substitution Distances (2001) (1)
Remarks on extremal and maximum determinant matrices with moduli of real entries less than or equal to 1 (2014) (1)
The Construction of Regular Hadamard Matrices by Cyclotomic Classes (2020) (1)
Short Amicable sets and Kharaghani type orthogonal designs (2001) (1)
Infinite families of orthogonal designs : I (2001) (1)
How to Recycle Shares in Secret Sharing Schemes 1 (2006) (1)
Multi-modulation schemes to increase the rate space-time block codes in Rayleigh fading channels (2004) (1)
The Impact of Number Theory and Computer-Aided Mathematics on Solving the Hadamard Matrix Conjecture (2013) (1)
Critical sets for a pair of mutually orthogonal cyclic latin squares of odd order greater than 9 (2005) (1)
A Search for Hadamard Matrices constructed from (2002) (1)
A note on orthogonal designs in order eighty (1976) (1)
Bounds on the Maximum Determinant for (2000) (1)
Forensic Computing (2003) (1)
Numerical algorithms for the computation of the Smith normal form of integral matrices (1998) (1)
A list of balanced incomplete block designs for r < 30 (1973) (1)
Design and Implementation of Personal Firewalls for Handheld Devices (2003) (1)
SOME GOOD ORTHOGONAL BIPOLAR SPREADING SEQUENCES OF LENGTHS 12 AND 20 (2002) (1)
North-Holland 49 Supplementary difference sets and optimal designs (2014) (1)
On the multiplication theorems of Hadamard matrices of generalized quaternion type using M- structures (1993) (1)
Circles on lattices and maximum determinant matrices (2020) (1)
Higher-dimensional orthogonal designs and Hadamard matrices II (2014) (1)
Some Constructions of Mutually Orthogonal Latin Squares and Superimposed Codes (2012) (1)
Secure Computations on Handheld Devices with the Help of an Untrusted Server (2003) (1)
Some results on Kharaghani type orthogonal designs (2003) (1)
On the (10,5,$\lambda$)-family of Bhaskar Rao designs (1998) (1)
Information Security and Privacy, 13th Australasian Conference, ACISP 2008, Wollongong, Australia, July 7-9, 2008, Proceedings (2008) (1)
On the spectrum of an F-square (2000) (1)
Robinson’s Theorem (2017) (0)
The Truth on TPy (2008) (0)
Amicable Orthogonal Designs (2017) (0)
Boolean Functions with Good Properties (2004) (0)
New weighing matrices constructed from two circulant submatrices (2010) (0)
A Multilevel Encryption Scheme for Database Security Abstract (2017) (0)
On Hadamard matrices of order 2t pq:I (1987) (0)
Electronic Elections and Digital Money (2003) (0)
Proceedings of the 13th Australasian conference on Information Security and Privacy (2008) (0)
Combinatorial Algorithms and Methods for Security of Statistical Databases Related to the Work of Mirka Miller (2017) (0)
Proceedings of the 4th Australasian Conference on Information Security and Privacy (1999) (0)
Performance of Diversity Antenna Selection Techniques in Imperfect Channels (2006) (0)
Inequivalence of Nega-cyclic ±1 Matrices (2006) (0)
Codes Identifying Bad Signatures in Bat hesJaros (2006) (0)
Information security and privacy : First Australasian Conference, ACISP '96, Wollongong, NSW, Australia, June 24-26, 1996 : proceedings (1996) (0)
Multi-Modulation Schemes to Achieve Higher Data Rate (2006) (0)
Strongly amicable orthogonal designs and amicable Hadamard matrices (2013) (0)
Secure Access to Electronic Strongboxes in Electronic Commerce (1997) (0)
Multi-modulation Schemes to Increase the Rate of Space-Time Block Codes in Rayleigh Fading C hanne 1 s (2014) (0)
Complex Orthogonal Sequences from Amicable (2004) (0)
Shared Cryptographic Bits Via Quantized Quadrature PhaseAmplitudes of (1996) (0)
Construction of New Hadamard Matrices with Maximal Excess and Infinitely Many New SBIBD (4/c2, 2k 2 +k,k 2 +k) (2017) (0)
‘”Suggestions for presentation of a twenty-minute talk”’ (1992) (0)
Orthogonal Designs of Kharaghani Type: I (2003) (0)
Database Protection and Security (2003) (0)
Anonymous and verifiable databases: towards a practical solution (1994) (0)
Advances in Cryptology - AUSCRYPT '90, International Conference on Cryptology, Sydney, Australia, January 8-11, 1990, Proceedings (1990) (0)
On crystal sets (2012) (0)
Cryptographic techniques (2020) (0)
Strongboxes for Electronic Commerce ( Extended Abstract ) (2017) (0)
Some new constructions of orthogonal designs (2013) (0)
Integer matrices obeying generalized incidence equations (1971) (0)
The Construction of Regular Hadamard Matrices by Cyclotomic Classes (2020) (0)
Vanstone's construction applied to Bhaskar Rao (1987) (0)
Existence of Hadamard Matrices and Asymptotic Existence Results for Orthogonal Designs (2017) (0)
New normal sequences of length 25 (1995) (0)
How to improve the SAC (1994) (0)
An exposure property of block designs (2005) (0)
On Ternary Complementary (2006) (0)
Values of minors of some infinite families of matrices constructed from supplementary difference sets and their application to the growth problem (2005) (0)
Group-Oriented Cryptography (2003) (0)
Proceedings of the 17th Australasian conference on Information Security and Privacy (2012) (0)
Cracking bin Laden's computer code: unlikely (2011) (0)
On amicable sequences and orthogonal designs (2000) (0)
Conference Matrices with Two Borders and Four Circulants (2014) (0)
Proceedings of the international conference on cryptology on Advances in cryptology (1990) (0)
Critical Sets in Orthogonal Arrays (2003) (0)
Ralph Gordon Stanton (1991) (0)
Product of four Hadamard matrices R (2017) (0)
Information Security and Privacy : 17th Australasian Conference, ACISP 2012, Wollongong, NSW, Australia, July 9-11, 2012. Proceedings (2012) (0)
The amicable-Kronecker construction of quaternion orthogonal designs (2011) (0)
Proceedings of the 8th Australasian conference on Information security and privacy (2003) (0)
Zero-Knowledge Proof Systems (2003) (0)
Two Novel Construction Classes for Improved, Square CO STBCs (2006) (0)
Complex, Quaternion and Non Square Orthogonal Designs (2017) (0)
Verifiable Databases : Towards a Practical Solution ( Extended Abstract ) (2017) (0)
On The Complexity Structure Of Binary Sequences Of Odd Length (1991) (0)
Evaluation of minors for weighing matrices W(n;n 1) having zeros on the diagonal (2007) (0)
Research Online Research Online A construction for Hadamard arrays A construction for Hadamard arrays (2020) (0)
Inner Product Vectors for Skew-Hadamard Matrices (2015) (0)
Kerbie: Kerberos-type authentication using public-keys (1994) (0)
Proceedings of the First Australasian Conference on Information Security and Privacy (1996) (0)
Relationships between boolean functions and symmetric groups (2000) (0)
Generalised Cycling Attacks on Rsa (0)
Husain's SBIBD (2011) (0)
Research Online Research Online (2020) (0)
Weighing matrices and sequences (2011) (0)
Private-Key Cryptosystems (2003) (0)
Infinite families of generalized Bhaskar Rao designs (1998) (0)
Zero-Free and Redundant Quaternion Orthogonal Designs (2006) (0)
Generalized WilliamsonandWallis-Whiteman Constructions forImprovedSquareOrder-8 COISsTBC (2005) (0)
An Infinite Family of Quasi Orthogonal Matrices with Two Levels Constructed via SBIBD (2014) (0)
"Albert Leon Whiteman (1915-1995)" (1997) (0)
Constructing Hadamard matrices via orthogonal designs (2014) (0)
An almost optimal fail-stop signature scheme (2000) (0)
Transmitter Diversity Antenna Selection Techniques for Mimo Systems (2006) (0)
Information Security and Privacy: 4th Australasian Conference, ACISP'99, Wollongong, NSW, Australia, April 7-9, 1999, Proceedings (1999) (0)
Construction of amicable orthogonal design (2009) (0)
Collusion-resistant protocols for private processing of aggregated queries in distributed databases (2020) (0)
10 PSEUDO-RANDOM SEQUENCE GENERATORS USING STRUCTURED NOISE (2017) (0)
Research Online Combinatorial matrices (2014) (0)
On the matrices used to construct baumert-hall arrays (1975) (0)
Women in mathematics in Australia (1979) (0)
(v, k, lambda)-configurations and Hadamard matrices (1970) (0)
Security issues in mobile information networks (1996) (0)
Security Issues in Mobile Information Networks (Special Section on Multi-dimensional Mobile Information Network) (1996) (0)
Information security : third international workshop, ISW 2000, Wollongong, Australia, December 20-21, 2000 : proceedings (2000) (0)
New orthogonal designs from weighing matrices (2008) (0)
Temporal Authorizations Scheme for XML Documents (2014) (0)
Algebraic Theory of Orthogonal Designs (2017) (0)
Collusion-resistant protocols for private processing of aggregated queries in distributed databases (2020) (0)
Three-LeveL CreT an Ma TriCes Cons Tr UCTed via ConferenCe Ma TriCes (2015) (0)
Some classes of Hadamard matrices with constant (1972) (0)
Strong boxes for electronic commerce (1996) (0)
Temporal authorizations scheme for XML document (2006) (0)
Families of codes from orthogonal (0,1,-1)-matrices (1973) (0)
New Square, Complex Orthogonal Space-Time Block Codes for Eight Transmitter Antennas (2006) (0)
1975 Orthogonal designs (2011) (0)
Research Online Research Online Kerbie: Kerberos-type authentication using public-keys Kerbie: Kerberos-type authentication using public-keys (2020) (0)
A study and testbed for the Australian Standard AS7799 Compliance and Management (2006) (0)
A Note on the Exposure Property of SBIBD (2003) (0)
Computer construction conjecture for symmetric hadamard matrices (2018) (0)
Secure IP Multicast for DMS (2004) (0)
A New Very Fast Stream Cipher : Tpy (2008) (0)
Overview of the Book (2006) (0)
CRETAN ( 4 t + 1 ) MATRICES (2016) (0)
CRC for smart internet technology: an overview (2001) (0)
DASC 2011: message from the chairs (2011) (0)
Embedding and Extension Properties of Hadamard Matrices Revisited (2018) (0)
Some Algebraic and Combinatorial Non-existence Results (2017) (0)
On infinite families of sequences with one and two valued autocorrelation and two valued crosscorrelation function (2001) (0)
Crypto Topics and Applications I (1999) (0)
Recent advances in the construction of Hadamard (1973) (0)
Two-level Cretan Matrices Constructed Theoretically and Computationally using SBIBD (2015) (0)
Three-LeveL CreT an Ma TriCes of order 37 (2015) (0)
A Construction for Quaternion Orthogonal Designs (2006) (0)
Relating Nonlinearity to Propagation Characteristics (1995) (0)
Fast operations for certain two alphabet circulant matrices (2013) (0)
A Minimal Critical Set of a Class of Youden Squares (2006) (0)
Perfect Secret Sharing Schemes from Room Squares to Anne Penfold Street on Her Retirement (1998) (0)
Construction of T-matrices of order 6m+1 (2017) (0)

This paper list is powered by the following services:

Other Resources About Jennifer Seberry

en.wikipedia.org

What Schools Are Affiliated With Jennifer Seberry?

Jennifer Seberry is affiliated with the following schools:

Jennifer Seberry's Academic­Influence.com Rankings

Why Is Jennifer Seberry Influential?

Jennifer Seberry's Published Works

Published Works

Other Resources About Jennifer Seberry

What Schools Are Affiliated With Jennifer Seberry?

Jennifer Seberry's AcademicInfluence.com Rankings