| Publication | Date of Publication | Type |
|---|
On <i>t</i>‐designs and <i>s</i>‐resolvable <i>t</i>‐designs from hyperovals
Journal of Combinatorial Designs | 2024-01-29 | Paper |
Point-missing \(s\)-resolvable \(t\)-designs: infinite series of 4-designs with constant index
Designs, Codes and Cryptography | 2023-06-20 | Paper |
An extending theorem for \(s\)-resolvable \(t\)-designs
Designs, Codes and Cryptography | 2021-03-17 | Paper |
On simple 3-designs having 2-resolutions
Discrete Mathematics | 2020-07-08 | Paper |
Recursive constructions for s-resolvable t-designs
Designs, Codes and Cryptography | 2019-11-07 | Paper |
On existence theorems for simple \(t\)-designs
Designs, Codes and Cryptography | 2019-06-06 | Paper |
Simple \(t\)-designs: a recursive construction for arbitrary \(t\)
Designs, Codes and Cryptography | 2017-04-12 | Paper |
On symmetric designs and binary 3-frameproof codes
Springer Proceedings in Mathematics & Statistics | 2016-01-25 | Paper |
On tight bounds for binary frameproof codes
Designs, Codes and Cryptography | 2015-10-26 | Paper |
A tight bound for frameproof codes viewed in terms of separating hash families
Designs, Codes and Cryptography | 2014-07-03 | Paper |
A new look at an old construction: constructing (simple) 3-designs from resolvable 2-designs
Discrete Mathematics | 2014-05-06 | Paper |
Logarithmic signatures for abelian groups and their factorization
Tatra Mountains Mathematical Publications | 2014-03-14 | Paper |
Strongly aperiodic logarithmic signatures
Journal of Mathematical Cryptology | 2013-10-17 | Paper |
Improved bounds for separating hash families
Designs, Codes and Cryptography | 2013-09-24 | Paper |
Pseudorandom number generators based on random covers for finite groups
Designs, Codes and Cryptography | 2012-05-22 | Paper |
Public key cryptosystem MST\(_{3}\): cryptanalysis and realization
Journal of Mathematical Cryptology | 2011-01-13 | Paper |
A public key cryptosystem based on non-abelian finite groups
Journal of Cryptology | 2009-06-30 | Paper |
Explicit constructions for perfect hash families
Designs, Codes and Cryptography | 2009-03-31 | Paper |
| On the security of a realization of the cryptosystem \(\text{MST}_3\) | 2009-03-11 | Paper |
| On generation of random covers for finite groups | 2008-03-05 | Paper |
| Cryptographic primitives based on groups on hidden order | 2007-03-22 | Paper |
| A new mode of using all-or-nothing transforms | 2007-02-13 | Paper |
Roux-type constructions for covering arrays of strengths three and four
Designs, Codes and Cryptography | 2006-11-22 | Paper |
On Minimal Logarithmic Signatures of Finite Groups
Experimental Mathematics | 2006-01-09 | Paper |
On Minimal Logarithmic Signatures of Finite Groups
Experimental Mathematics | 2006-01-09 | Paper |
New constructions for IPP codes
Designs, Codes and Cryptography | 2005-06-15 | Paper |
| scientific article; zbMATH DE number 2102390 (Why is no real title available?) | 2004-09-23 | Paper |
On non-polynomial Latin squares
Designs, Codes and Cryptography | 2004-08-16 | Paper |
On a class of traceability codes
Designs, Codes and Cryptography | 2004-06-11 | Paper |
New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
Journal of Cryptology | 2003-03-25 | Paper |
| scientific article; zbMATH DE number 1406772 (Why is no real title available?) | 2000-03-01 | Paper |
