Nam Su Chang

Orcid: 0000-0002-6037-6670

According to our database1, Nam Su Chang authored at least 11 papers between 2003 and 2021.

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

2021
Efficient implementation of modular multiplication over 192-bit NIST prime for 8-bit AVR-based sensor node.
J. Supercomput., 2021

2018
Low complexity bit-parallel multiplier for F2n defined by repeated polynomials.
Discret. Appl. Math., 2018

2014
Formulas for cube roots in F<sub>3<sup>m</sup></sub> using shifted polynomial basis.
Inf. Process. Lett., 2014

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

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

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
Cryptanalysis of the Full Version Randomized Addition-Subtraction Chains.
Proceedings of the Information Security and Privacy, 8th Australasian Conference, 2003


  Loading...