Dongvu Tonien
Research Subjects
Dongvu Tonien has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Rei Safavi-Naini
University of Wollongong
2 shared publications Jennifer Seberry
1 shared publication- Vinhbuu To1 shared publication
- Yejing Wang
School of IT & CS , University of Wollongong , NSW , 2522 , Australia
1 shared publication
Latest Publications
- 1 January 2011
- Published by Walter de Gruyter GmbH in Groups - Complexity - Cryptology
- Vol. 3 (2) , 221-237
A new generic digital signature algorithm
In this paper, we study two digital signature algorithms, the DSA and ECDSA, which have become NIST standard and have been widely used in almost all commercial applications. We will show that the two algorithms are actually ‘the same’ algebraically and propose a generic algorithm such that both DSA and ECDSA are instances of it. By looking at this special angle through the generic algorithm, we gain a new insight into the two algorithms DSA and ECDSA. Our new proposed digital signature algorithm is described generically using a group G and a map to Number : G → ℤ. As an illustration, we choose G to be a group of non-singular circulant matrices over finite field and describe a totally new concrete digital signature algorithm.
- 1 January 2011
- Published by Walter de Gruyter GmbH in Groups - Complexity - Cryptology
- Vol. 3 (2) , 221-237
A new generic digital signature algorithm
In this paper, we study two digital signature algorithms, the DSA and ECDSA, which have become NIST standard and have been widely used in almost all commercial applications. We will show that the two algorithms are actually ‘the same’ algebraically and propose a generic algorithm such that both DSA and ECDSA are instances of it. By looking at this special angle through the generic algorithm, we gain a new insight into the two algorithms DSA and ECDSA. Our new proposed digital signature algorithm is described generically using a group G and a map to Number : G → ℤ. As an illustration, we choose G to be a group of non-singular circulant matrices over finite field and describe a totally new concrete digital signature algorithm.
- Open Access
- 30 September 2007
- Published by European Mathematical Society - EMS - Publishing House GmbH in Elemente der Mathematik
- Vol. 62 (3) , 118-120
A simple visual proof of the Schröder-Bernstein theorem
- 30 September 2007
- Published by European Mathematical Society - EMS - Publishing House GmbH in Elemente der Mathematik
- Vol. 62 (3) , 118-120
Open AccessA simple visual proof of the Schröder-Bernstein theorem
- 23 December 2006
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 42 (2) , 227-237
Construction of deletion correcting codes using generalized Reed–Solomon codes and their subcodes
- 23 December 2006
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 42 (2) , 227-237
Construction of deletion correcting codes using generalized Reed–Solomon codes and their subcodes
- 16 October 2006
- Published by Elsevier in Information Processing Letters
- Vol. 100 (1) , 21-22
On a traitor tracing scheme from ACISP 2003
- 16 October 2006
- Published by Elsevier in Information Processing Letters
- Vol. 100 (1) , 21-22
On a traitor tracing scheme from ACISP 2003
- 1 January 2005
- Published by Taylor & Francis in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 8 (2) , 287-304
2-secure codes from 2-SFP codes
Secure code and secure frameproof code (SFP) are introduced to provide protection against illegal producing of copyrighted digital material. In this paper we present a general method of converting a binary 2-SFP code to a 2-secure code, that is providing a tracing algorithm and calculating ε, the chance of error in tracing. We express the error associated with this tracing in terms of n, the number of codewords in the code and d, the minimum Hamming distance of the code. We also characterize the set of pirate words such that the algorithm fails to trace. To illustrate the method, we first show that the dual Hamming code [6] is a 2-SFP code and we apply the proposed method for this code to obtain a 2-secure code.
- 1 January 2005
- Published by Taylor & Francis in Journal of Discrete Mathematical Sciences and Cryptography
- Vol. 8 (2) , 287-304
2-secure codes from 2-SFP codes
Secure code and secure frameproof code (SFP) are introduced to provide protection against illegal producing of copyrighted digital material. In this paper we present a general method of converting a binary 2-SFP code to a 2-secure code, that is providing a tracing algorithm and calculating ε, the chance of error in tracing. We express the error associated with this tracing in terms of n, the number of codewords in the code and d, the minimum Hamming distance of the code. We also characterize the set of pirate words such that the algorithm fails to trace. To illustrate the method, we first show that the dual Hamming code [6] is a 2-SFP code and we apply the proposed method for this code to obtain a 2-secure code.
- 1 January 2004
- Published by Taylor & Francis in Journal of Dynamical Systems & Geometric Theories
- Vol. 2 (1) , 23-26
A Note on Devaney’s Definition of Chaos
Devaney [5] defines a function to be chaotic if it satisfies three conditions: transitivity, having dense set of periodic points and sensitive dependence on initial conditions. Banks et al [2] prove that if the function is continuous then the third condition is implied from the first two and therefore it is redundant. However, if the function is not assumed to be continuous, then it is not known if the third condition is redundant or not. In this note, without assuming the function is continuous, we prove that the third condition is redundant if the underlying topological space is not precompact.
- 1 January 2004
- Published by Taylor & Francis in Journal of Dynamical Systems & Geometric Theories
- Vol. 2 (1) , 23-26
A Note on Devaney’s Definition of Chaos
Devaney [5] defines a function to be chaotic if it satisfies three conditions: transitivity, having dense set of periodic points and sensitive dependence on initial conditions. Banks et al [2] prove that if the function is continuous then the third condition is implied from the first two and therefore it is redundant. However, if the function is not assumed to be continuous, then it is not known if the third condition is redundant or not. In this note, without assuming the function is continuous, we prove that the third condition is redundant if the underlying topological space is not precompact.