Tran van Trung

Orcid: 0000-0001-7453-357X

According to our database1, Tran van Trung authored at least 55 papers between 1980 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Point-missing s-resolvable t-designs: infinite series of 4-designs with constant index.
Des. Codes Cryptogr., 2023

2022
A method of constructing 2-resolvable t-designs for t=3, 4.
Des. Codes Cryptogr., 2022

2021
An extending theorem for s-resolvable t-designs.
Des. Codes Cryptogr., 2021

2020
On simple 3-designs having 2-resolutions.
Discret. Math., 2020

2019
Recursive constructions for s-resolvable t-designs.
Des. Codes Cryptogr., 2019

On existence theorems for simple t-designs.
Des. Codes Cryptogr., 2019

2018
Construction of strongly aperiodic logarithmic signatures.
J. Math. Cryptol., 2018

A recursive construction for simple t-designs using resolutions.
Des. Codes Cryptogr., 2018

2017
Simple t-designs: a recursive construction for arbitrary t.
Des. Codes Cryptogr., 2017

2016
Construction of 3-designs using (1, σ)-resolution.
Adv. Math. Commun., 2016

2015
On tight bounds for binary frameproof codes.
Des. Codes Cryptogr., 2015

2014
A new look at an old construction: Constructing (simple) 3-designs from resolvable 2-designs.
Discret. Math., 2014

A tight bound for frameproof codes viewed in terms of separating hash families.
Des. Codes Cryptogr., 2014

2013
Strongly aperiodic logarithmic signatures.
J. Math. Cryptol., 2013

Improved bounds for separating hash families.
Des. Codes Cryptogr., 2013

2012
Good Synchronization Sequences for Permutation Codes.
IEEE Trans. Commun., 2012

Pseudorandom number generators based on random covers for finite groups.
Des. Codes Cryptogr., 2012

2011
On Jacobsthal Binary Sequences.
Proceedings of the Information Security, Coding Theory and Related Combinatorics, 2011

Bounds for separating hash families.
J. Comb. Theory, Ser. A, 2011

2010
Public key cryptosystem MST3: cryptanalysis and realization.
J. Math. Cryptol., 2010

2009
A Public Key Cryptosystem Based on Non-abelian Finite Groups.
J. Cryptol., 2009

2008
Explicit constructions for perfect hash families.
Des. Codes Cryptogr., 2008

Primitive sets in a lattice.
Australas. J Comb., 2008

2006
Roux-type constructions for covering arrays of strengths three and four.
Des. Codes Cryptogr., 2006

2005
On Minimal Logarithmic Signatures of Finite Groups.
Exp. Math., 2005

New Constructions for IPP Codes.
Des. Codes Cryptogr., 2005

2004
On a Class of Traceability Codes.
Des. Codes Cryptogr., 2004

On <i>t</i>-Covering Arrays.
Des. Codes Cryptogr., 2004

On Non-Polynomial Latin Squares.
Des. Codes Cryptogr., 2004

2002
New Approaches to Designing Public Key Cryptosystems Using One-Way Functions and Trapdoors in Finite Groups.
J. Cryptol., 2002

2000
Symmetric Block Ciphers Based on Group Bases.
Proceedings of the Selected Areas in Cryptography, 7th Annual International Workshop, 2000

1999
Directed-Packings and Directed -Steiner Systems.
Des. Codes Cryptogr., 1999

1998
Some New Results on Key Distribution Patterns and Broadcast Encryption.
Des. Codes Cryptogr., 1998

1997
Unitals and Unitary Polarities in Symmetric Designs.
Des. Codes Cryptogr., 1997

1996
A Generalization of a Theorem of Dehon for Simple t-Designs.
Des. Codes Cryptogr., 1996

1995
On the Construction of Authentication and Secrecy Codes.
Des. Codes Cryptogr., 1995

1994
Some existence theorems for t-designs.
Discret. Math., 1994

A Parallel Permutation Multiplier for a PGM Crypto-chip.
Proceedings of the Advances in Cryptology, 1994

1991
Maximal arcs and related designs.
J. Comb. Theory, Ser. A, 1991

Some perpendicular arrays for arbitrarily large t.
Discret. Math., 1991

Halving PGL(2, 2<sup>f</sup>), f odd: A Series of Cryptocodes.
Des. Codes Cryptogr., 1991

Some Highly Symmetric Authentication Perpendicular Arrays.
Des. Codes Cryptogr., 1991

1986
Non-embeddable quasi-residual designs with <i>k lt v/2</i>.
J. Comb. Theory, Ser. A, 1986

Answers to two questions about semi-symmetric designs.
J. Comb. Theory, Ser. A, 1986

A new biplane of order 9 with a small automorphism group.
J. Comb. Theory, Ser. A, 1986

1985
Construction of a New Symmetric Block Design for (78, 22, 6) with the Help of Tactical Decompositions.
J. Comb. Theory, Ser. A, 1985

Construction of two symmetric block designs for (71, 21, 6).
Discret. Math., 1985

1984
A Symmetric Block Design with Parameters (61, 16, 4).
J. Comb. Theory, Ser. A, 1984

Answers on Two Questions about Semi-symmetric Designs.
J. Comb. Theory, Ser. A, 1984

1982
The Existence of Symmetric Block Designs with Parameters (41, 16, 6) and (66, 26, 10).
J. Comb. Theory, Ser. A, 1982

Projective Planes of Order 12 Do Not Have a Four Group as a Collineation Group.
J. Comb. Theory, Ser. A, 1982

A Generalization of a Result of L. Baumert and M. Hall About Projective Planes of Order 12.
J. Comb. Theory, Ser. A, 1982

Two New Semibiplanes.
J. Comb. Theory, Ser. A, 1982

The Classification of Projective Planes of Order 9 Which Possess an Involution.
J. Comb. Theory, Ser. A, 1982

1980
On Projective Planes of Order 12 Which Have a Subplane of Order 3, I.
J. Comb. Theory, Ser. A, 1980


  Loading...