Остановите войну!
for scientists:
default search action
Chiou-Yng Lee
- > Home > Persons > Chiou-Yng Lee
Publications
- 2018
- [j54]Che Wun Chiou, Cheng-Min Lee, Yuh-Sien Sun, Chiou-Yng Lee, Jim-Min Lin:
High-throughput Dickson basis multiplier with a trinomial for lightweight cryptosystems. IET Comput. Digit. Tech. 12(5): 187-191 (2018) - 2017
- [j51]Che Wun Chiou, Yuh-Sien Sun, Cheng-Min Lee, Jim-Min Lin, Tai-Pao Chuang, Chiou-Yng Lee:
Gaussian normal basis multiplier over GF(2 m ) using hybrid subquadratic-and-quadratic TMVP approach for elliptic curve cryptography. IET Circuits Devices Syst. 11(6): 579-588 (2017) - [j50]Che Wun Chiou, Chiou-Yng Lee, Jim-Min Lin, Yun-Chi Yeh, Jeng-Shyang Pan:
Low-latency digit-serial dual basis multiplier for lightweight cryptosystems. IET Inf. Secur. 11(6): 301-311 (2017) - 2015
- [j45]Ping-Hsu Chen, Yung-Hui Li, Che Wun Chiou, Chiou-Yng Lee, Jim-Min Lin:
A smart safety cane for human fall detection. Int. J. Ad Hoc Ubiquitous Comput. 20(1): 49-65 (2015) - [c30]Chiou-Yng Lee, Che Wun Chiou, Jim-Min Lin:
Subquadratic Space-Complexity Parallel Systolic Multiplier Based on Karatsuba Algorithm and Block Recombination. ICGEC (2) 2015: 187-200 - [c29]Che Wun Chiou, Yuh-Sien Sun, Cheng-Min Lee, Y.-L. Chiu, Jim-Min Lin, Chiou-Yng Lee:
Problems on Gaussian Normal Basis Multiplication for Elliptic Curve Cryptosystem. ICGEC (2) 2015: 201-207 - [c26]Jim-Min Lin, Che Wun Chiou, Chiou-Yng Lee, Jing-Rui Hsiao:
Supporting Physical Agents in an Interactive e-book. ICGEC (2) 2015: 243-252 - 2014
- [j39]Jeng-Shyang Pan, Reza Azarderakhsh, Mehran Mozaffari Kermani, Chiou-Yng Lee, Wen-Yo Lee, Che Wun Chiou, Jim-Min Lin:
Low-Latency Digit-Serial Systolic Double Basis Multiplier over $\mbi GF{(2^m})$ Using Subquadratic Toeplitz Matrix-Vector Product Approach. IEEE Trans. Computers 63(5): 1169-1181 (2014) - 2013
- [j33]Ying Yan Hua, Jim-Min Lin, Che Wun Chiou, Chiou-Yng Lee, Yong Huan Liu:
Low space-complexity digit-serial dual basis systolic multiplier over Galois field GF(2m) using Hankel matrix and Karatsuba algorithm. IET Inf. Secur. 7(2) (2013) - [c22]Che Wun Chiou, Jim-Min Lin, Yu-Ku Li, Chiou-Yng Lee, Tai-Pao Chuang, Yun-Chi Yeh:
Pipeline Design of Bit-Parallel Gaussian Normal Basis Multiplier over GF(2m). ICGEC 2013: 369-377 - 2012
- [j30]Che Wun Chiou, Hung Wei Chang, Wen-Yew Liang, Chiou-Yng Lee, Jim-Min Lin, Yun-Chi Yeh:
Low-complexity Gaussian normal basis multiplier over GF(2m). IET Inf. Secur. 6(4): 310-317 (2012) - [j29]Che Wun Chiou, Tai-Pao Chuang, Shun-Shii Lin, Chiou-Yng Lee, Jim-Min Lin, Yun-Chi Yeh:
Palindromic-like representation for Gaussian normal basis multiplier over GF(2m) with odd type t. IET Inf. Secur. 6(4): 318-323 (2012) - 2011
- [c17]Che Wun Chiou, Jim-Min Lin, Chiou-Yng Lee, Chi-Ting Ma:
Novel Mastrovito Multiplier over GF(2m) Using Trinomial. ICGEC 2011: 237-242 - 2010
- [j24]Che Wun Chiou, Wen-Yew Liang, Hung Wei Chang, Jim-Min Lin, Chiou-Yng Lee:
Concurrent error detection in semi-systolic dual basis multiplier over GF(2m) using self-checking alternating logic. IET Circuits Devices Syst. 4(5): 382-391 (2010) - [j21]Chiou-Yng Lee, Che Wun Chiou, Jim-Min Lin:
Concurrent Error Detection in Multiplexer-Based Multipliers for Normal Basis of GF(2m) Using Double Parity Prediction Scheme. J. Signal Process. Syst. 58(2): 233-246 (2010) - [c14]Che Wun Chiou, Jim-Min Lin, Chiou-Yng Lee:
Fast Optimal Normal Basis Multiplier with Type-2kw Over GF (2m). CASoN 2010: 116-120 - 2009
- [j20]Che Wun Chiou, Chiou-Yng Lee, Jim-Min Lin, Ting-Wei Hou, Chin-Chen Chang:
Concurrent error detection and correction in dual basis multiplier over GF(2m). IET Circuits Devices Syst. 3(1): 22-40 (2009) - [j19]Che Wun Chiou, Chiou-Yng Lee, Jim-Min Lin:
Unified dual-field multiplier in GF(P) and GF(2k). IET Inf. Secur. 3(2): 45-52 (2009) - [j18]Che Wun Chiou, Chin-Chen Chang, Chiou-Yng Lee, Ting-Wei Hou, Jim-Min Lin:
Concurrent Error Detection and Correction in Gaussian Normal Basis Multiplier over GF(2^m). IEEE Trans. Computers 58(6): 851-857 (2009) - 2007
- [j12]Chiou-Yng Lee, Che Wun Chiou, Jim-Min Lin, Chin-Chen Chang:
Scalable and systolic Montgomery multiplier over GF(2m) generated by trinomials. IET Circuits Devices Syst. 1(6): 477-484 (2007) - [j11]Chiou-Yng Lee, Yung-Hui Chen, Che Wun Chiou, Jim-Min Lin:
Unified Parallel Systolic Multiplier Over GF(2m). J. Comput. Sci. Technol. 22(1): 28-38 (2007) - 2006
- [j10]Chiou-Yng Lee, Che Wun Chiou, Jim-Min Lin:
Concurrent Error Detection in a Polynomial Basis Multiplier over GF(2m). J. Electron. Test. 22(2): 143-150 (2006) - [j9]Che Wun Chiou, Chiou-Yng Lee, An-Wen Deng, Jim-Min Lin:
Concurrent Error Detection in Montgomery Multiplication over GF(2m). IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(2): 566-574 (2006) - 2005
- [j7]Chiou-Yng Lee, Che Wun Chiou, Jim-Min Lin:
Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm. Comput. Electr. Eng. 31(7): 444-459 (2005) - [j5]Chiou-Yng Lee, Che Wun Chiou, Jim-Min Lin:
Concurrent Error Detection in a Bit-Parallel Systolic Multiplier for Dual Basis of GF(2m). J. Electron. Test. 21(5): 539-549 (2005)
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 2023-10-24 20:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint