Chang Han Kim

According to our database1, Chang Han Kim authored at least 20 papers between 2000 and 2016.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
Faster elliptic curve arithmetic for triple-base chain by reordering sequences of field operations.
Multim. Tools Appl., 2016

2012
New Bit Parallel Multiplier With Low Space Complexity for All Irreducible Trinomials Over GF(2<sup>n</sup>).
IEEE Trans. Very Large Scale Integr. Syst., 2012

2011
Modified Sequential Multipliers for Type-k Gaussian Normal Bases.
Proceedings of the 5th FTRA International Conference on Multimedia and Ubiquitous Engineering, 2011

2010
A new bit-serial multiplier over GF(p<sup>m</sup>) using irreducible trinomials.
Comput. Math. Appl., 2010

2009
An efficient signed digit montgomery multiplication for RSA.
J. Syst. Archit., 2009

2008
Weakness in a RSA-based password authenticated key exchange protocol.
Inf. Process. Lett., 2008

2006
An Efficient ID-Based Delegation Network.
Proceedings of the On the Move to Meaningful Internet Systems 2006: OTM 2006 Workshops, 2006

On the Security of Multilevel Cryptosystems over Class Semigroups of Imaginary Quadratic Non-maximal Orders.
Proceedings of the Public Key Infrastructure, 2006

A New Parallel Multiplier for Type II Optimal Normal Basis.
Proceedings of the Computational Intelligence and Security, International Conference, 2006

2005
An Efficient Public Key Cryptosystem with a Privacy Enhanced Double Decryption Mechanism.
Proceedings of the Selected Areas in Cryptography, 12th International Workshop, 2005

A Non-redundant and Efficient Architecture for Karatsuba-Ofman Algorithm.
Proceedings of the Information Security, 8th International Conference, 2005

Modified Serial Multipliers for Type-IV Gaussian Normal Bases.
Proceedings of the Progress in Cryptology, 2005

Modified Sequential Normal Basis Multipliers for Type II Optimal Normal Bases.
Proceedings of the Computational Science and Its Applications, 2005

A Fast Inversion Algorithm and Low-Complexity Architecture over <i>GF</i>(2<sup><i>m</i></sup>).
Proceedings of the Computational Intelligence and Security, International Conference, 2005

2003
Design of Bit Parallel Multiplier with Lower Time Complexity.
Proceedings of the Information Security and Cryptology, 2003

Cryptanalysis of the Full Version Randomized Addition-Subtraction Chains.
Proceedings of the Information Security and Privacy, 8th Australasian Conference, 2003

2002
A New Hardware Architecture for Operations in GF(2m).
IEEE Trans. Computers, 2002

Optimal Extension Fields for XTR.
Proceedings of the Selected Areas in Cryptography, 2002

An Alternate Decomposition of an Integer for Faster Point Multiplication on Certain Elliptic Curves.
Proceedings of the Public Key Cryptography, 2002

2000
Efficient Normal Basis Multipliers in Composite Fields.
IEEE Trans. Computers, 2000


  Loading...