Chia-Long Wu

According to our database1, Chia-Long Wu authored at least 21 papers between 2002 and 2014.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
以二維共振峰分布建立語者音色模型及其在語者驗證上之應用 (Using 2D Formant Distribution to Build Speaker Models and Its Application in Speaker Verification) [In Chinese].
Proceedings of the 26th Conference on Computational Linguistics and Speech Processing, 2014

2012
Computational Complexity Theoretical Analyses on Cryptographic Algorithms for Computer Security Application.
Proceedings of the 2012 Third International Conference on Innovations in Bio-Inspired Computing and Applications, 2012

Modular Arithmetic and Fast Algorithm Designed for Modern Computer Security Applications.
Proceedings of the Intelligent Information and Database Systems - 4th Asian Conference, 2012

2010
Fast modular multiplication based on complement representation and canonical recoding.
Int. J. Comput. Math., 2010

2009
An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation.
Inf. Sci., 2009

Computational Reduction of Wilson's Primality Test for Modern Cryptosystems.
Informatica (Slovenia), 2009

A low-complexity LUT-based squaring algorithm.
Comput. Math. Appl., 2009

Fast Parallel Montgomery Binary Exponentiation Algorithm Using Canonical- Signed-Digit Recoding Technique.
Proceedings of the Algorithms and Architectures for Parallel Processing, 2009

2008
An efficient Montgomery exponentiation algorithm for public-key cryptosystems.
Proceedings of the IEEE International Conference on Intelligence and Security Informatics, 2008

Fast Modular Multiplication for E-Commerce Cryptosystem.
Proceedings of the Eighth International Conference on Intelligent Systems Design and Applications, 2008

2007
Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques.
Int. J. Comput. Math., 2007

Integer factorization for RSA cryptosystem under a PVM environment.
Comput. Syst. Sci. Eng., 2007

Fast modular multi-exponentiation using modified complex arithmetic.
Appl. Math. Comput., 2007

Fast binary multiplication by performing dot counting and complement recoding.
Appl. Math. Comput., 2007

An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques.
Appl. Math. Comput., 2007

2006
Fast Parallel Exponentiation Algorithm for RSA Public-Key Cryptosystem.
Informatica, 2006

2005
An Efficient Montgomery Exponentiation Algorithm for Cryptographic Applications.
Informatica, 2005

2004
Parallel Modular Exponentiation Using Signed-Digit-Folding Technique.
Informatica (Slovenia), 2004

Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques.
Int. J. Comput. Math., 2004

2003
Fast exponentiation by folding the signed-digit exponent in half.
Int. J. Comput. Math., 2003

2002
Application of Parallel Virtual Machine Framework to the Strong Prime Problem.
Int. J. Comput. Math., 2002


  Loading...