No subject area
The Theory of Quaternion Orthogonal Designs (with K. Finlayson, S. Spense Adams, T. A. Wysocki, T. Xia, and B. J. Wysocki), Faculty of Informatics - Papers (2008)
Over the past several years, there has been a renewed interest in complex orthogonal designs...
On the pivot structure for the weighing matrix W(12,11) (with C. Kravvaritis and M. Mitrouli), Faculty of Informatics - Papers (2007)
C. Koukouvinos, M. Mitrouli and Jennifer Seberry, in "Growth in Gaussian elimination for weighing matrices,...
Some new results of regular Hadamard matrices and SBIBD II (with T. Xia and M. Xia), Faculty of Informatics - Papers (2007)
In this paper we prove that there exist 4—{k2; ˝k(k–1); k(k–2)} SDS, regular Hadamard matrices...
Generalized Bhaskar Rao Designs with Block Size 3 over Finite Abelian Groups (with G. Ge, M. Grieg, and R. Seberry), Faculty of Informatics - Papers (2007)
We show that if G is a finite Abelian group and the block size is...
Temporal Authorizations Scheme for XML Documents (with J. Wu and Y. Mu), Faculty of Informatics - Papers (2007)
In a large system, XML documents associated with it can be large and complicated. To...
The power and influence in some Youden squares and secret sharing (with L. Fitina and K. G. Russell), Faculty of Informatics - Papers (2007)
We investigate subsets of critical sets of some Youden squares in the context of secret...
On the Internal Structure of ALPHA-MAC (with J. Huang and W. Susilo), Faculty of Informatics - Papers (2006)
ALPHA-MAC is a MAC function which uses the building blocks of AES. This paper studies...
A Minimal Critical Set of a Class of Youden Squares (with L. Fitina and K. G. Russell), Faculty of Informatics - Papers (2006)
We consider the Youden square formed by deleting one row of a v x v...
Hadamard ideals and Hadamard matrices with circulant core (with I. S. Kotsireas and C. Koukouvinos), Faculty of Informatics - Papers (2006)
Computational Algebra methods have been used successfully in various problems in many fields of Mathematics....
Hadamard ideals and Hadamard matrices with two circulant cores (with I. S. Kotsireas and C. Koukouvinos), Faculty of Informatics - Papers (2006)
We apply Computational Algebra methods to the construction of Hadamard matrices with two circulant cores,...
Combinatorial structures for Design of Wireless Sensor Networks (with D. Chakrabarti), Faculty of Informatics - Papers (2006)
Combinatorial designs are very effective tools for managing keys in an infrastructure where power and...
ICT professionals’ perceptions of responsibility for breaches of computer security (with M. Barrett and K. Garrety), Faculty of Informatics - Papers (2006)
With ubiquitous computer use and networking, concerns about security breaches have intensified. However the human...
Amicable Orthogonal Designs of Order 8 for Complex Space-Time Block Codes (with Y. Zhao, T. Xia, Y. Wang, B. J. Wysocki, T. A. Wysocki, and L. C. Tran), Faculty of Informatics - Papers (2006)
New amicable orthogonal designs AODs(8; 1; 1; 1; 2; 2; 2), AODs(8; 1; 1; 4;...
Complex Orthogonal Spreading Sequences Using Mutually Orthogonal Complementary Sets (with Y. Zhao, B. J. Wysocki, and T. A. Wysocki), Faculty of Informatics - Papers (2006)
This paper presents a new family of complex spreading sequences designed using mutually orthogonal(MO) complementary...
Inequivalence of Nega-cyclic ±1 Matrices (with R. Ang and T. A. Wysocki), Faculty of Informatics - Papers (2006)
We study nega-cyclic ±1 matrices. We obtain preliminary results which are then used to decrease...
New Constructing of regular Hadamard matrices (with T. Xia and M. Xia), Faculty of Informatics - Papers (2006)
For every prime power q ≡ 7 mod 16, we obtain the (q; a, b,...
On Amicable Orthogonal Designs of Order 8 (with Y. Zhao and Y. Wang), Faculty of Informatics - Papers (2006)
Some new amicable orthogonal designs of order 8 are found as part of a complete...
Access Policy Sheet for Access Control in Fine-Grained XML (with J. Wu, Y. Mu, and C. Ruan), Faculty of Informatics - Papers (2005)
We propose an access control scheme for developing authorization rules for XML documents, allowing flexible...
A Cryptographic Solution for General Access Control (with Y. Kong, J. R. Getta, and P. Yu), Faculty of Informatics - Papers (2005)
As one of the most popular information safeguarding mechanisms, access control is widely deployed in...
Generalized Williamson and Wallis-Whiteman Constructions for Improved Square Order-8 CO STBCs (with L. C. Tran, T. A. Wysocki, A. Mertins, and S. A. Spence), Faculty of Informatics - Papers (2005)
Constructions of square, maximum rate Complex Orthogonal Space-Time Block Codes (CO STBCs) are well known,...
Delegatable Access Control for Fine-Grained XML (with J. Wu, Y. Mu, and C. Ruan), Faculty of Informatics - Papers (2005)
The access control mechanisms are critical to ensure security in XML (eXtensible Markup Language). Several...
Orthogonal Designs with Quaternion Elements (with K. Finlayson, T. A. Wysocki, and T. Xia), Faculty of Informatics - Papers (2005)
We introduce orthogonal designs with quaternion elements and show their existence. In future work we...
On the growth problem for skew and symmetric conference matrices (with C. Kravvaritis and M. Mitrouli), Faculty of Informatics - Papers (2005)
C. Koukouvinos, M. Mitrouli and Jennifer Seberry, in "Growth in Gaussian elimination for weighing matrices,...
A generalized algorithm for the generation of correlated Rayleigh fading envelopes (with L. C. Tran, T. A. Wysocki, and A. Mertins), Faculty of Informatics - Papers (2005)
Although the generation of correlated Rayleigh fading envelopes has been intensively considered in the literature,...
A Construction Technique for Generalized Complex Orthogonal Designs and Applications to Wireless Communications (with S. A. Spence and T. A. Wysocki), Faculty of Informatics - Papers (2005)
We introduce a construction technique for generalized complex linear processing orthogonal designs, which are p...
An exposure property of block designs (with Y. Wang, B. J. Wysocki, T. A. Wysocki, L. C. Tran, Y. Zhao, and T. Xia), Faculty of Informatics - Papers (2005)
An exposure property of block designs is defined and investigated in this paper. The families...
An infinite family of Goethals-Seidel arrays (with M. Xia and T. Xia), Faculty of Informatics - Papers (2005)
In this paper we construct an infinite family of Goethals-Seidel arrays and prove the theorem:...
Critical sets for a pair of mutually orthogonal cyclic latin squares of odd order greater than 9 (with R. SahaRay and A. Adhikari), Faculty of Informatics - Papers (2005)
To date investigations on critical sets for a set of mutually orthogonal latin squares (MOLS)...
Critical sets in orthogonal arrays with 7 and 9 levels (with R. SahaRay and A. Adhikari), Faculty of Informatics - Papers (2005)
To date very few results are known on the critical sets for a set of...
On Orthogonal Designs in Order 48 (with W. H. Holzmann, H Kharaghani, and B. Tayfeh-Rezaie), Faculty of Informatics - Papers (2005)
We show that all 3164 possible OD(48; s1, s2,s3) exist. In addition to the use...
Py (Roo): A Fast and Secure Stream Cipher (with E. Biham), Faculty of Informatics - Papers (2005)
Py (pronounced Roo, a shorthand for Kangaroo) is a new stream cipher designed especially for...
A Generalized Algorithm for the Generation of Correlated Rayleigh Fading Envelopes in Radio Channels (with L. C. Tran, T. A. Wysocki, and A. Mertins), Faculty of Informatics - Papers (2005)
Although generation of correlated Rayleigh fading envelopes has been intensively considered in the literature, all...
Values of Minors of Some Infinite Families of Matrices Constructed from Supplementary Difference Sets and Their Application to the Growth Problem (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (2005)
We obtain explicit formulae for the values of the 2v - j minors, j =...
A new method for constructing T-matrices (with M. Xia, T. Xia, and G. Zuo), Faculty of Informatics - Papers (2005)
For every prime power q = 3 (mod 8) we prove the existence of (q;...
On some applications of Hadamard matrices (with B. J. Wysocki and T. A. Wysocki), Faculty of Informatics - Papers (2005)
Modern communications systems are heavily reliant on statistical techniques to recover information in the presence...
Observations on the Message Integrity Code in IEEE802.11Wireless LANs (with J. Huang and W. Susilo), Faculty of Informatics - Papers (2004)
This paper surveys the security of the message integrity code used in the IEEE802.11 Wireless...
Two new complex orthogonal space time codes for 8 transmit antennas (with L. C. Tran, Y. Wang, B. J. Wysocki, T. A. Wysocki, T. Xia, and Y. Zhao), Faculty of Informatics - Papers (2004)
Two new constructions of complex orthogonal space-time block codes of order 8 based on the...
Further Results on Strongbox Secured Secret Sharing Schemes (with G. Gamble, B. M. Maenhaut, and A. Penfold Street), Faculty of Informatics - Papers (2004)
We extend our earlier work on ways in which defining sets of combinatorial designs can...
Homogeneous bent functions of degree n in 2n variables do not exist for n > 3 (with T. Xia, J. Pieprzyk, and C. Charnes), Faculty of Informatics - Papers (2004)
We prove that homogeneous bent functions f : GF(2)2n —> GF(2) of degree n do...
Orthogonal Designs from Negacyclic Matrices (with K. Finlayson), Faculty of Informatics - Papers (2004)
We study the use of negacyclic matrices to form orthogonal designs and hence Hadamard matrices....
Orthogonal Designs of Kharaghani Type: II (with C. Koukouvinos), Faculty of Informatics - Papers (2004)
H. Kharaghani, in "Arrays for orthogonal designs", J. Combin. Designs, 8 (2000), 166-173, showed how...
Complex orthogonal sequences from amicable Hadamard matrices (with L. C. Tran, B. J. Wysocki, T. A. Wysocki, T. Xia, and Y. Zhao), Faculty of Informatics - Papers (2004)
The paper deals with the novel technique of designing complex spreading sequences with only four...
Generalized orthogonal designs (with S. Georgiou and C. Koukouvinos), Faculty of Informatics - Papers (2004)
Orthogonal designs and their special cases such as weighing matrices and Hadamard matrices have many...
Two complex orthogonal space-time codes for eight transmit antennas (with L. C. Tran, Y. Wang, B. J. Wysocki, T. A. Wysocki, T. Xia, and Y. Zhao), Faculty of Informatics - Papers (2004)
Two new constructions of complex orthogonal space-time block codes of order 8 based on the...
Combinatorial Constructions of 3- and 4-Secure Codes (with Y. Wang, B. J. Wysocki, T. A. Wysocki, W. Susilo, T. Xia, Y. Zhao, and L. C. Tran), Faculty of Informatics - Papers (2003)
In this paper, 3- and 4-secure codes are constructed from combinatorial designs. Both constant weight...
Forensic Computing (with X. Li), Faculty of Informatics - Papers (2003)
Technology is rapidly changing the speed and manner in which people interact with each other...
Design and Implementation of Personal Firewalls for Handheld Devices (with J. Huang and W. Susilo), Faculty of Informatics - Papers (2003)
Personal Digital Assistants (PDAs) have become one of the important tools in our life. Their...
Secure Computations on Handheld Devices with the Help of an Untrusted Server (with J. Huang and W. Susilo), Faculty of Informatics - Papers (2003)
Recently, handheld devices have become one of the most popular computing tools. Although handheld devices...
Generalized Bhaskar Rao Designs with Block Size 4 Signed over Elementary Abelian Groups (with G. Ge and M. Greig), Faculty of Informatics - Papers (2003)
de Launey and Seberry have looked at the existence of Generalized Bhaskar Rao designs with...
Some results on self-orthogonal and self-dual codes (with S. Georgiou and C. Koukouvinos), Faculty of Informatics - Papers (2003)
We use generator matrices G satisfying GGT = aI+bJ over Zk to obtain linear self-orthogonal...
The Maximal Determinant and Subdeterminants of ±1 Matrices (with T. Xia, C. Koukouvinos, and M. Mitrouli), Faculty of Informatics - Papers (2003)
In this paper we study the maximal absolute values of determinants and subdeterminants of ±1...
Construction of highly non-linear cubic homogeneous Boolean functions on GF2n+l (2) (with J. Wu and T. Xia), Faculty of Informatics - Papers (2003)
The work studies highly nonlinear Boolean functions in GF2n+1(2), i.e. for the dimensions where bent...
On Using Fast Exponentiation Algorithm in PDAs (or: How Secure is the Discrete Logarithm Problem Assumption in PDAs?) (with W. Susilo and J. Huang), Faculty of Informatics - Papers (2003)
Personal Digital Assistants (PDAs) are the miniature of normal size PCs, with a very limited...
An Algorithm to find Formulae and Values of Minors for Hadamard matrices: II (with C. Koukouvinos, E. Lappas, and M. Mitrouli), Faculty of Informatics - Papers (2003)
An algorithm computing the (n — j) x (n — j ) , j =...
Further Observations on the Structure of the AES Algorithm (with B. Song), Faculty of Informatics - Papers (2003)
Abstract. We present our further observations on the structure of the AES algorithm relating to...
On Full Orthogonal Designs in Order 72 (with S. Georgiou and C. Koukouvinos), Faculty of Informatics - Papers (2003)
We find new full orthogonal designs in order 72 and show that of 2700 possible...
Orthogonal Designs of Kharaghani Type: I (with C. Koukouvinos), Faculty of Informatics - Papers (2003)
We use an array given in H. Kharaghani, Arrays for orthogonal designs, J. Combin. Designs,...
Regular Hadamard Matrices, Maximum Excess and SBIBD (with T. Xia and M. Xia), Faculty of Informatics - Papers (2003)
When k = q1, q2, q1q2, q1q4, q2q3N, q3q4N, q1, q2 and q3 are prime...
Some results on Kharaghani type orthogonal designs (with S. Georgiou and C. Koukouvinos), Faculty of Informatics - Papers (2003)
In this paper we give a general theorem which can be used to multiply the...
Weighing Matrices and Self-Orthogonal Quaternary Codes (with C. Charnes), Faculty of Informatics - Papers (2003)
We consider families of linear self-orthogonal and self-dual codes over the ring Z4 which are...
On Full Orthogonal Designs in Order 56 (with S. Georgiou and C. Koukouvinos), Faculty of Informatics - Papers (2002)
We find new full orthogonal designs in order 56 and show that of 1285 possible...
Necessary and Sufficient Conditions for Three and Four Variable Orthogonal Designs in Order 36 (with S. Georgiou, C. Koukouvinos, and M. Mitrouli), Faculty of Informatics - Papers (2002)
We use a new algorithm to find new sets of sequences with entries from {0,...
On the (v,5,λ)-Family of Bhaskar Rao Designs (with G. R. Chaudhry and M. Greig), Faculty of Informatics - Papers (2002)
We establish that the necessary conditions for the existence of Bhaskar Rao designs of block...
On A Use Of Golay Sequences For Asynchronous DS CDMA Applications (with B. J. Wysocki and T. A. Wysocki), Faculty of Informatics - Papers (2002)
Golay complementary sequences, often referred to as Golay pairs, are characterised by the property that...
A Search for Hadamard Matrices constructed from Williamson Matrices (with J. Horton and C. Koukouvinos), Faculty of Informatics - Papers (2002)
We describe the implementation of a distributed computer search that uses Williamson's construction for Hadamard...
Golay Sequences for DS CDMA Applications (with B. J. Wysocki and T. A. Wysocki), Faculty of Informatics - Papers (2002)
Golay complementary sequences, often referred to as Golay pairs, are characterised by the property that...
An infinite family of Hadamard matrices with fourth last pivot n/2 (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (2002)
We show that the equivalence class of Sylvester Hadamard matrices give an infinite family of...
Hadamard matrices, orthogonal designs and construction algorithms (with S. Georgiou and C. Koukouvinos), Faculty of Informatics - Papers (2002)
We discuss algorithms for the construction of Hadamard matrices. We include discussion of construction using...
Short Amicable Sets (with S. Georgiou and C. Koukouvinos), Faculty of Informatics - Papers (2002)
Abstract: A pair of matrices X and Y are said to be amicable if XYT...
The Analysis of Zheng-Seberry Scheme (with D. Soldera and C. Qu), Faculty of Informatics - Papers (2002)
The Zheng-Seberry (ZS) encryption scheme was published in 1993 and was one of the first...
A New Cryptanalytic Method Using the Distribution Characteristics of Substitution Distances (with B. Song and H. Wang), Faculty of Informatics - Papers (2001)
In this paper, we suggest a new method for cryptanalysis of the basic structures of...
Infinite Families of Orthogonal Designs : I (with C. Koukouvinos), Faculty of Informatics - Papers (2001)
We generalize a method inspired by Kharaghani and Holzmann to obtain infinite families of 6-variables...
On circulant best matrices and their applications (with S. Georgiou and C. Koukouvinos), Faculty of Informatics - Papers (2001)
Call four type 1 (1, -1) matrices, X1, X2, X3, X4, of the same group...
Application of the Discrete Fourier Transform to the Search for Generalised Legendre Pairs and Hadamard Matrices (with R. J. Fletcher and M. Gysin), Faculty of Informatics - Papers (2001)
We introduce Legendre sequences and generalised Legendre pairs (GL-pairs). We show how to construct a...
New D-optimal Designs of Order 110 (with R. J. Fletcher), Faculty of Informatics - Papers (2001)
We give two new D-optimal designs of order 110.
On Infinite Families of Sequences with One and Two Valued Autocorrelation and Two Valued Crosscorrelation Function (with M. Gysin), Faculty of Informatics - Papers (2001)
We show how to construct infinite families of sequences that have one and two valued...
On Ternary Complementary Pairs (with M. Gysin), Faculty of Informatics - Papers (2001)
Let A = {a0, ... aℓ-1 }, B = {b0, . . . , bℓ-1...
Equitability in Retroactive Key Confiscation versus Proactive Key Escrow (with Y. Desmedt and M. Burmester), Faculty of Informatics - Papers (2001)
The British Regulations of Investigatory Powers (RIP) Act 2000 is one of the first modern...
An Algorithm to find Formulae and Values of Minors for Hadamard Matrices (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (2001)
We give an algorithm to obtain formulae and values for minors of Hadamard matrices. One...
A new algorithm for computer searches for orthogonal designs (with S. Georgiou, C. Koukouvinos, and M. Mitrouli), Faculty of Informatics - Papers (2001)
We present a new algorithm for computer searches for orthogonal designs. Then we use this...
On the complete pivoting conjecture for Hadamard matrices of small orders (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (2001)
In this paper we study explicitly the pivot structure of Hadamard matrices of small orders...
Short amicable sets and Kharaghani type orthogonal designs (with C. Koukouvinos), Faculty of Informatics - Papers (2001)
Short amicable sets were introduced recently and have many applications. The construction of short amicable...
Values of Minors of (1, 1) Incidence Matrices of SBIBDs and Their Application to the Growth Problem (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (2001)
We obtain explicit formulae for the values of the v j minors, j = 0,...
Values of Minors of an Infinite Family of D-Optimal Designs and Their Application to the Growth Problem (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (2001)
We obtain explicit formulae for the values of the 2v — j minors, j =...
On amicable sequences and orthogonal designs (with S. Georgiou and C. Koukouvinos), Faculty of Informatics - Papers (2000)
In this paper we give a general theorem which can be used to multiply the...
Codes Identifying Bad Signatures in Batches (with J. Pastuszak and J. Pieprzyk), Faculty of Informatics - Papers (2000)
The work is concerned with identification of bad signatures in a sequence which is validated...
Construction of cubic homogeneous boolean bent functions (with T. Xia and J. Pieprzyk), Faculty of Informatics - Papers (2000)
We prove that cubic homogeneous bent functions f : V2n → GF(2) exist for all...
On the spectrum of an F-square (with L. Fitina), Faculty of Informatics - Papers (2000)
Given an F-square of some type F(n; αo, αl, ..., αv-1) what critical set sizes...
A New and Efficient Fail—Stop Signature Scheme (with W. Susilo, R. Safavi-Naini, and M. Gysin), Faculty of Informatics - Papers (2000)
Security of ordinary digital signature schemes relies on a computational assumption. Fail-stop signature schemes provide...
Bounds on the Maximum Determinant for (1, –1) Matrices (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (2000)
We suppose the Hadamard conjecture is true and an Hadamard matrix of order 4t, exists...
Growth in Gaussian Elimination for Weighing Matrices, W (n, n — 1) (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (2000)
We consider the values for large minors of a skew-Hadamard matrix or conference matrix W...
Homogeneous Bent Functions (with C. Qu and J. Pieprzyk), Faculty of Informatics - Papers (2000)
This paper discusses homogeneous bent functions. The space of homogeneous functions of degree three in...
Identification of Bad Signatures in Batches (with J. Pastuszak, D. Michalek, and J. Pieprzyk), Faculty of Informatics - Papers (2000)
The paper addresses the problem of bad signature identification in batch verification of digital signatures....
Influence of Entries in Critical Sets of Room Squares (with G. Chaudhry), Faculty of Informatics - Papers (2000)
We establish the notions of influence, power and strong box in the critical sets of...
Necessary and sufficient conditions for two variable orthogonal designs in order 44: Addendum (with S. Georgiou, C. Koukouvinos, and M. Mitrouli), Faculty of Informatics - Papers (2000)
In our recent paper Necessary and sufficient conditions for some two variable orthogonal designs in...
New orthogonal designs and sequences with two and three variables in order 28 (with C. Koukouvinos), Faculty of Informatics - Papers (2000)
We give new sets of sequences with entries from {0, ±a, ±b, ±c} on the...
Strongbox Secured Secret Sharing Schemes (with A. Penfold Street), Faculty of Informatics - Papers (2000)
We present one way in which combinatorial designs can be used to give conditionally perfect...
Back circulant Latin squares and the influence of a set (with L. F. Fitina and G. R. Chaudhry), Faculty of Informatics - Papers (1999)
We define the notions of nest and influence of a subset of a critical set...
When the necessary conditions are not sufficient: sequences with zero autocorrelation function (with J. Horton), Faculty of Informatics - Papers (1999)
Recently K. T. Arasu (personal communication) and Yoseph Strassler, in his PhD thesis, The Classification...
On F-Squares and their Critical Sets (with L. F. Fitina and D. Sarvate), Faculty of Informatics - Papers (1999)
We define the notion of critical set of an F-square, following the definition of critical...
Crypto Topics And Applications I (with C. Charnes, J. Pieprzyk, and R. Safavi-Naini), Faculty of Informatics - Papers (1999)
In this chapter we discuss four related areas of cryptology, namely: Authentication, Hashing, Message Authentication...
Crypto Topics And Applications II (with C. Charnes, J. Pieprzyk, and R. Safavi-Naini), Faculty of Informatics - Papers (1999)
In this chapter we continue our exposition of the crypto topics which was begun in...
New weighing matrices and orthogonal designs constructed using two sequences with zero autocorrelation function - a review (with C. Koukouvinos), Faculty of Informatics - Papers (1999)
The book, Orthogonal Designs: Quadratic Forms and Hadamard Matrices, Marcel Dekker, New York-Basel, 1979, by...
On Circulant Weighing Matrices (with K. T . Arasu), Faculty of Informatics - Papers (1998)
Algebraic techniques are employed to obtain necessary conditions for the existence of certain circulant weighing...
Group Divisible Designs, GBRSDS And Generalized Weighing Matrices (with D. G. Sarvate), Faculty of Informatics - Papers (1998)
We give new constructions for regular group divisible designs, pairwise balanced designs, generalized Bhaskar Rao...
Bose's Method of Differences Applied to Construct Bhaskar Rao Designs, Faculty of Informatics - Papers (1998)
In this paper we show that BIBD(v, b, r, k, λ), where v = pq...
Covert Distributed Computing Using Java Through Web Spoofing (with J. Horton), Faculty of Informatics - Papers (1998)
We use the Web Spoofing attack reported by Cohen and also the Secure Internet Programming...
Equitable Key Escrow with Limited Time Span (or, How to Enforce Time Expiration Cryptographically) (with M. Burmester and Y. Desmedt), Faculty of Informatics - Papers (1998)
With equitable key escrow the control of society over the individual and the control of...
Necessary and sufficient conditions for some two variable orthogonal designs in order 44 (with C. Koukouvinos and M. Mitrouli), Faculty of Informatics - Papers (1998)
We give a new algorithm which allows us to construct new sets of sequences with...
On New Families of Supplementary Difference Sets over Rings with Short Orbits (with M. Gysin), Faculty of Informatics - Papers (1998)
We discuss difference sets (DS) and supplementary difference sets (SDS) over rings. We survey some...
On the (10, 5, λ)-Family of Bhaskar Rao Designs (with G. Chaudhry), Faculty of Informatics - Papers (1998)
We prove a theorem for BRD(10,5,Lambda)s and give thirteen (13) inequivalent BRD(10,5,4)s.
Perfect Secret Sharing Schemes from Room Squares (with G. R. Chaudhry and H Ghodosi), Faculty of Informatics - Papers (1998)
Secret sharing schemes are one of the most important primitives in distributed systems. In perfect...