![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Chia-Long Wu
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [c6]Jia-Guu Lin, Jyh-Bin Shiau, Chang En Pu, Chia-Long Wu:
以二維共振峰分布建立語者音色模型及其在語者驗證上之應用 (Using 2D Formant Distribution to Build Speaker Models and Its Application in Speaker Verification) [In Chinese]. ROCLING 2014 - 2012
- [c5]Chia-Long Wu:
Modular Arithmetic and Fast Algorithm Designed for Modern Computer Security Applications. ACIIDS (3) 2012: 276-285 - [c4]Chia-Long Wu, Chen-Hao Hu:
Computational Complexity Theoretical Analyses on Cryptographic Algorithms for Computer Security Application. IBICA 2012: 307-311 - 2010
- [j15]Chia-Long Wu, Der-Chyuan Lou
, Te-Jen Chang:
Fast modular multiplication based on complement representation and canonical recoding. Int. J. Comput. Math. 87(13): 2871-2879 (2010)
2000 – 2009
- 2009
- [j14]Te-Jen Chang, Chia-Long Wu, Der-Chyuan Lou
, Ching-Yin Chen:
A low-complexity LUT-based squaring algorithm. Comput. Math. Appl. 57(9): 1494-1501 (2009) - [j13]Chia-Long Wu, Der-Chyuan Lou, Te-Jen Chang:
Computational Reduction of Wilson's Primality Test for Modern Cryptosystems. Informatica (Slovenia) 33(4): 453-458 (2009) - [j12]Chia-Long Wu:
An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation. Inf. Sci. 179(4): 410-421 (2009) - [c3]Chia-Long Wu:
Fast Parallel Montgomery Binary Exponentiation Algorithm Using Canonical- Signed-Digit Recoding Technique. ICA3PP 2009: 428-438 - 2008
- [c2]Chia-Long Wu, Der-Chyuan Lou
, Te-Jen Chang:
Fast Modular Multiplication for E-Commerce Cryptosystem. ISDA (3) 2008: 457-461 - [c1]Chia-Long Wu, Der-Chyuan Lou
, Te-Jen Chang:
An efficient Montgomery exponentiation algorithm for public-key cryptosystems. ISI 2008: 284-285 - 2007
- [j11]Der-Chyuan Lou
, Jui-Chang Lai, Chia-Long Wu, Te-Jen Chang:
An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques. Appl. Math. Comput. 185(1): 31-44 (2007) - [j10]Chia-Long Wu, Der-Chyuan Lou
, Jui-Chang Lai, Te-Jen Chang:
Fast modular multi-exponentiation using modified complex arithmetic. Appl. Math. Comput. 186(2): 1065-1074 (2007) - [j9]Chia-Long Wu, Der-Chyuan Lou
, Te-Jen Chang:
Fast binary multiplication by performing dot counting and complement recoding. Appl. Math. Comput. 191(1): 132-139 (2007) - [j8]Chia-Long Wu, Der-Chyuan Lou, Te-Jen Chang, Shih-Yun Chen:
Integer factorization for RSA cryptosystem under a PVM environment. Comput. Syst. Sci. Eng. 22(1-2) (2007) - [j7]Chia-Long Wu:
Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques. Int. J. Comput. Math. 84(10): 1405-1415 (2007) - 2006
- [j6]Chia-Long Wu, Der-Chyuan Lou, Jui-Chang Lai, Te-Jen Chang:
Fast Parallel Exponentiation Algorithm for RSA Public-Key Cryptosystem. Informatica 17(3): 445-462 (2006) - 2005
- [j5]Chia-Long Wu, Der-Chyuan Lou, Te-Jen Chang:
An Efficient Montgomery Exponentiation Algorithm for Cryptographic Applications. Informatica 16(3): 449-468 (2005) - 2004
- [j4]Der-Chyuan Lou
, Chia-Long Wu:
Parallel exponentiation using common-multiplicand-multiplication and signed-digit-folding techniques. Int. J. Comput. Math. 81(10): 1187-1202 (2004) - [j3]Der-Chyuan Lou, Chia-Long Wu:
Parallel Modular Exponentiation Using Signed-Digit-Folding Technique. Informatica (Slovenia) 28(2): 197-205 (2004) - 2003
- [j2]Der-Chyuan Lou
, Chia-Long Wu, Ching-Yin Chen:
Fast exponentiation by folding the signed-digit exponent in half. Int. J. Comput. Math. 80(10): 1251-1259 (2003) - 2002
- [j1]Der-Chyuan Lou
, Chia-Long Wu, Rong-yi Ou:
Application of Parallel Virtual Machine Framework to the Strong Prime Problem. Int. J. Comput. Math. 79(7): 797-806 (2002)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint