default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTran van Trung
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j53]Tran van Trung:
Resolutions of the designs in two infinite series of 4-designs. Discret. Math. 347(5): 113907 (2024)- 2023
- [j52]Tran van Trung
:
Point-missing s-resolvable t-designs: infinite series of 4-designs with constant index. Des. Codes Cryptogr. 91(7): 2497-2508 (2023) - 2022
- [j51]Tran van Trung:
A method of constructing 2-resolvable t-designs for t=3, 4. Des. Codes Cryptogr. 90(7): 1567-1583 (2022) - 2021
- [j50]Tran van Trung:
An extending theorem for s-resolvable t-designs. Des. Codes Cryptogr. 89(3): 589-597 (2021) - 2020
- [j49]Tran van Trung:
On simple 3-designs having 2-resolutions. Discret. Math. 343(9): 111963 (2020) - 2019
- [j48]Tran van Trung:
On existence theorems for simple t-designs. Des. Codes Cryptogr. 87(7): 1521-1540 (2019) - [j47]Tran van Trung:
Recursive constructions for s-resolvable t-designs. Des. Codes Cryptogr. 87(12): 2835-2845 (2019) - 2018
- [j46]Tran van Trung:
A recursive construction for simple t-designs using resolutions. Des. Codes Cryptogr. 86(6): 1185-1200 (2018) - [j45]Tran van Trung:
Construction of strongly aperiodic logarithmic signatures. J. Math. Cryptol. 12(1): 23-35 (2018) - 2017
- [j44]Tran van Trung:
Simple t-designs: a recursive construction for arbitrary t. Des. Codes Cryptogr. 83(3): 493-502 (2017) - 2016
- [j43]Tran van Trung:
Construction of 3-designs using (1, σ)-resolution. Adv. Math. Commun. 10(3): 511-524 (2016) - 2015
- [j42]Chuan Guo, Douglas R. Stinson, Tran van Trung:
On tight bounds for binary frameproof codes. Des. Codes Cryptogr. 77(2-3): 301-319 (2015) - 2014
- [j41]Tran van Trung:
A tight bound for frameproof codes viewed in terms of separating hash families. Des. Codes Cryptogr. 72(3): 713-718 (2014) - [j40]Douglas R. Stinson, Colleen Swanson, Tran van Trung:
A new look at an old construction: Constructing (simple) 3-designs from resolvable 2-designs. Discret. Math. 325: 23-31 (2014) - 2013
- [j39]Marjan Bazrafshan, Tran van Trung:
Improved bounds for separating hash families. Des. Codes Cryptogr. 69(3): 369-382 (2013) - [j38]Reiner Staszewski, Tran van Trung:
Strongly aperiodic logarithmic signatures. J. Math. Cryptol. 7(2): 147-179 (2013) - 2012
- [j37]Pascal Marquardt, Pavol Svaba, Tran van Trung:
Pseudorandom number generators based on random covers for finite groups. Des. Codes Cryptogr. 64(1-2): 209-220 (2012) - [j36]Thokozani Shongwe, Theo G. Swart, Hendrik C. Ferreira, Tran van Trung:
Good Synchronization Sequences for Permutation Codes. IEEE Trans. Commun. 60(5): 1204-1208 (2012) - 2011
- [j35]Marjan Bazrafshan, Tran van Trung:
Bounds for separating hash families. J. Comb. Theory A 118(3): 1129-1135 (2011) - 2010
- [j34]Pavol Svaba, Tran van Trung:
Public key cryptosystem MST3: cryptanalysis and realization. J. Math. Cryptol. 4(3): 271-315 (2010) - 2009
- [j33]Wolfgang Lempken, Tran van Trung, Spyros S. Magliveras, Wandi Wei:
A Public Key Cryptosystem Based on Non-abelian Finite Groups. J. Cryptol. 22(1): 62-74 (2009) - 2008
- [j32]Spyros S. Magliveras, Tran van Trung, Wandi Wei:
Primitive sets in a lattice. Australas. J Comb. 40: 173-186 (2008) - [j31]Sosina Martirosyan, Tran van Trung:
Explicit constructions for perfect hash families. Des. Codes Cryptogr. 46(1): 97-112 (2008) - 2006
- [j30]Charles J. Colbourn, Sosina Martirosyan, Tran van Trung, Robert A. Walker:
Roux-type constructions for covering arrays of strengths three and four. Des. Codes Cryptogr. 41(1): 33-57 (2006) - 2005
- [j29]Tran van Trung, Sosina Martirosyan:
New Constructions for IPP Codes. Des. Codes Cryptogr. 35(2): 227-239 (2005) - [j28]Wolfgang Lempken, Tran van Trung:
On Minimal Logarithmic Signatures of Finite Groups. Exp. Math. 14(3): 257-269 (2005) - 2004
- [j27]Tran van Trung, Sosina Martirosyan:
On a Class of Traceability Codes. Des. Codes Cryptogr. 31(2): 125-132 (2004) - [j26]Otokar Grosek, Peter Horák, Tran van Trung:
On Non-Polynomial Latin Squares. Des. Codes Cryptogr. 32(1-3): 217-226 (2004) - [j25]Sosina Martirosyan, Tran van Trung:
On t-Covering Arrays. Des. Codes Cryptogr. 32(1-3): 323-339 (2004) - 2002
- [j24]Spyros S. Magliveras, Douglas R. Stinson, Tran van Trung:
New Approaches to Designing Public Key Cryptosystems Using One-Way Functions and Trapdoors in Finite Groups. J. Cryptol. 15(4): 285-297 (2002) - 1999
- [j23]Rudolf Mathon, Tran van Trung:
Directed-Packings and Directed -Steiner Systems. Des. Codes Cryptogr. 18(1/3): 187-198 (1999) - 1998
- [j22]Douglas R. Stinson, Tran van Trung:
Some New Results on Key Distribution Patterns and Broadcast Encryption. Des. Codes Cryptogr. 14(3): 261-279 (1998) - 1997
- [j21]Rudolf Mathon, Tran van Trung:
Unitals and Unitary Polarities in Symmetric Designs. Des. Codes Cryptogr. 10(2): 237-250 (1997) - 1996
- [j20]Tran van Trung:
A Generalization of a Theorem of Dehon for Simple t-Designs. Des. Codes Cryptogr. 9(1): 105-114 (1996) - 1995
- [j19]Tran van Trung:
On the Construction of Authentication and Secrecy Codes. Des. Codes Cryptogr. 5(3): 269-280 (1995) - 1994
- [j18]Tran van Trung:
Some existence theorems for t-designs. Discret. Math. 128(1-3): 337-348 (1994) - 1991
- [j17]Jürgen Bierbrauer, Tran van Trung:
Halving PGL(2, 2f), f odd: A Series of Cryptocodes. Des. Codes Cryptogr. 1(2): 141-148 (1991) - [j16]Jürgen Bierbrauer, Tran van Trung:
Some Highly Symmetric Authentication Perpendicular Arrays. Des. Codes Cryptogr. 1(4): 307-319 (1991) - [j15]Earl S. Kramer, Qiu-Rong Wu, Spyros S. Magliveras, Tran van Trung:
Some perpendicular arrays for arbitrarily large t. Discret. Math. 96(2): 101-110 (1991) - [j14]Tran van Trung:
Maximal arcs and related designs. J. Comb. Theory A 57(2): 294-301 (1991) - 1986
- [j13]Zvonimir Janko, Tran van Trung:
Answers to two questions about semi-symmetric designs. J. Comb. Theory A 41(2): 276-277 (1986) - [j12]Zvonimir Janko, Tran van Trung:
A new biplane of order 9 with a small automorphism group. J. Comb. Theory A 42(2): 305-309 (1986) - [j11]Tran van Trung:
Non-embeddable quasi-residual designs with k lt v/2. J. Comb. Theory A 43(1): 133-137 (1986) - 1985
- [j10]Zvonimir Janko, Tran van Trung:
Construction of two symmetric block designs for (71, 21, 6). Discret. Math. 55(3): 327-328 (1985) - [j9]Zvonimir Janko, Tran van Trung:
Construction of a New Symmetric Block Design for (78, 22, 6) with the Help of Tactical Decompositions. J. Comb. Theory A 40(2): 451-455 (1985) - 1984
- [j8]Zvonimir Janko, Tran van Trung:
Answers on Two Questions about Semi-symmetric Designs. J. Comb. Theory A 37(3): 357-358 (1984) - [j7]Tran van Trung:
A Symmetric Block Design with Parameters (61, 16, 4). J. Comb. Theory A 37(3): 374 (1984) - 1982
- [j6]Zvonimir Janko, Tran van Trung:
A Generalization of a Result of L. Baumert and M. Hall About Projective Planes of Order 12. J. Comb. Theory A 32(3): 378-385 (1982) - [j5]Zvonimir Janko, Tran van Trung:
Projective Planes of Order 12 Do Not Have a Four Group as a Collineation Group. J. Comb. Theory A 32(3): 401-404 (1982) - [j4]Zvonimir Janko, Tran van Trung:
The Classification of Projective Planes of Order 9 Which Possess an Involution. J. Comb. Theory A 33(1): 65-75 (1982) - [j3]Zvonimir Janko, Tran van Trung:
Two New Semibiplanes. J. Comb. Theory A 33(1): 102-105 (1982) - [j2]Tran van Trung:
The Existence of Symmetric Block Designs with Parameters (41, 16, 6) and (66, 26, 10). J. Comb. Theory A 33(2): 201-204 (1982) - 1980
- [j1]Zvonimir Janko, Tran van Trung:
On Projective Planes of Order 12 Which Have a Subplane of Order 3, I. J. Comb. Theory A 29(2): 254-256 (1980)
Conference and Workshop Papers
- 2000
- [c2]Valér Canda, Tran van Trung, Spyros S. Magliveras, Tamás Horváth:
Symmetric Block Ciphers Based on Group Bases. Selected Areas in Cryptography 2000: 89-105 - 1994
- [c1]Tamás Horváth, Spyros S. Magliveras, Tran van Trung:
A Parallel Permutation Multiplier for a PGM Crypto-chip. CRYPTO 1994: 108-113
Parts in Books or Collections
- 2011
- [p1]Spyros S. Magliveras, Tran van Trung, Wandi Wei:
On Jacobsthal Binary Sequences. Information Security, Coding Theory and Related Combinatorics 2011: 27-37
Informal and Other Publications
- 2014
- [i1]Chuan Guo, Douglas R. Stinson, Tran van Trung:
On tight bounds for binary frameproof codes. CoRR abs/1406.6920 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
