Che Wun Chiou

According to our database1, Che Wun Chiou authored at least 47 papers between 1998 and 2018.

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

2018
High-throughput Dickson basis multiplier with a trinomial for lightweight cryptosystems.
IET Comput. Digit. Tech., 2018

2017
Low-latency digit-serial dual basis multiplier for lightweight cryptosystems.
IET Inf. Secur., 2017

Gaussian normal basis multiplier over GF(2<sup> <i>m</i> </sup>) using hybrid subquadratic-and-quadratic TMVP approach for elliptic curve cryptography.
IET Circuits Devices Syst., 2017

2015
A smart safety cane for human fall detection.
Int. J. Ad Hoc Ubiquitous Comput., 2015

Supporting Physical Agents in an Interactive e-book.
Proceedings of the Genetic and Evolutionary Computing, 2015

Subquadratic Space-Complexity Parallel Systolic Multiplier Based on Karatsuba Algorithm and Block Recombination.
Proceedings of the Genetic and Evolutionary Computing, 2015

Problems on Gaussian Normal Basis Multiplication for Elliptic Curve Cryptosystem.
Proceedings of the Genetic and Evolutionary Computing, 2015

2014
Low-Latency Digit-Serial Systolic Double Basis Multiplier over $\mbi GF{(2^m})$ Using Subquadratic Toeplitz Matrix-Vector Product Approach.
IEEE Trans. Computers, 2014

Improving the sampling resolution of periodic signals by using controlled sampling interval method.
Comput. Electr. Eng., 2014

2013
Low space-complexity digit-serial dual basis systolic multiplier over Galois field GF(2<sup>m</sup>) using Hankel matrix and Karatsuba algorithm.
IET Inf. Secur., 2013

Hybrid Digit-Serial Multiplier for Shifted Polynomial Basis of GF(2 m ).
Proceedings of the Genetic and Evolutionary Computing, 2013

Pipeline Design of Bit-Parallel Gaussian Normal Basis Multiplier over GF(2m).
Proceedings of the Genetic and Evolutionary Computing, 2013

2012
Scalable Gaussian Normal Basis Multipliers over GF(2 m ) Using Hankel Matrix-Vector Representation.
J. Signal Process. Syst., 2012

Low-complexity design of bit-parallel dual-basis multiplier over GF(2<sup>m</sup>).
IET Inf. Secur., 2012

Fault-tolerant Gaussian normal basis multiplier over GF(2<sup>m</sup>).
IET Inf. Secur., 2012

Palindromic-like representation for Gaussian normal basis multiplier over GF(2<sup>m</sup>) with odd type t.
IET Inf. Secur., 2012

Low-complexity Gaussian normal basis multiplier over GF(2<sup>m</sup>).
IET Inf. Secur., 2012

Analyzing ECG for cardiac arrhythmia using cluster analysis.
Expert Syst. Appl., 2012

Self-Checking Gaussian Normal Basis Multiplier over GF(2m) Using Multiplexer Approach.
Proceedings of the 2012 Sixth International Conference on Genetic and Evolutionary Computing, 2012

2011
Multiplexer implementation of low-complexity polynomial basis multiplier in GF(m<sup>2</sup>) using all one polynomial.
Inf. Process. Lett., 2011

Non-XOR approach for low-cost bit-parallel polynomial basis multiplier over GF(2<sup>m</sup>).
IET Inf. Secur., 2011

Self-checking alternating logic bit-parallel gaussian normal basis multiplier with type-t.
IET Inf. Secur., 2011

Novel Mastrovito Multiplier over GF(2m) Using Trinomial.
Proceedings of the Fifth International Conference on Genetic and Evolutionary Computing, 2011

2010
Concurrent Error Detection in Multiplexer-Based Multipliers for Normal Basis of GF(2<sup><i>m</i></sup>) Using Double Parity Prediction Scheme.
J. Signal Process. Syst., 2010

Speeding up Euclid's GCD algorithm with no magnitude comparisons.
Int. J. Inf. Comput. Secur., 2010

Concurrent error detection and correction in a polynomial basis multiplier over GF(2<sup>m</sup>).
IET Inf. Secur., 2010

Concurrent error detection in semi-systolic dual basis multiplier over GF(2<sup>m</sup>) using self-checking alternating logic.
IET Circuits Devices Syst., 2010

Feature selection algorithm for ECG signals using Range-Overlaps Method.
Expert Syst. Appl., 2010

Fast Optimal Normal Basis Multiplier with Type-2kw Over GF (2m).
Proceedings of the International Conference on Computational Aspects of Social Networks, 2010

2009
Concurrent Error Detection and Correction in Gaussian Normal Basis Multiplier over GF(2^m).
IEEE Trans. Computers, 2009

Unified dual-field multiplier in GF(P) and GF(2<sup>k</sup>).
IET Inf. Secur., 2009

Concurrent error detection and correction in dual basis multiplier over GF(2<sup>m</sup>).
IET Circuits Devices Syst., 2009

2008
New Bit-Parallel Systolic Architectures for Computing Multiplication, Multiplicative Inversion and Division in GF(2<sup>m</sup>) Under Polynomial Basis and Normal Basis Representations.
J. Signal Process. Syst., 2008

2007
Unified Parallel Systolic Multiplier Over <i>GF</i>(2<sup><i>m</i></sup>).
J. Comput. Sci. Technol., 2007

Scalable and systolic Montgomery multiplier over GF(2<sup>m</sup>) generated by trinomials.
IET Circuits Devices Syst., 2007

Speaker Recognition in an Emotionalized Spontaneous Speech Using Empirical Mode Decomposition.
Proceedings of the International MultiConference of Engineers and Computer Scientists 2007, 2007

2006
Encapsulating windows-based software applications into reusable components with design patterns.
Inf. Softw. Technol., 2006

Concurrent Error Detection in Montgomery Multiplication over <i>GF</i>(2<sup><i>m</i></sup>).
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Concurrent Error Detection in a Polynomial Basis Multiplier over GF(2<sup><i>m</i></sup>).
J. Electron. Test., 2006

New Bit-Parallel Systolic Multiplier over GF(2m) Using The Modified Booth's Algorithm.
Proceedings of the IEEE Asia Pacific Conference on Circuits and Systems 2006, 2006

2005
A Fast Base-K Logarithm with Redundant Representation.
J. Inf. Sci. Eng., 2005

Efficient Design of Low-Complexity Bit-Parallel Systolic Hankel Multipliers to Implement Multiplication in Normal and Dual Bases of GF (2<sup><i>m</i></sup>).
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005

Concurrent Error Detection in a Bit-Parallel Systolic Multiplier for Dual Basis of GF(2<sup><i>m</i></sup>).
J. Electron. Test., 2005

Multiplexer-based double-exponentiation for normal basis of GF(2<sup><i>m</i></sup>).
Comput. Secur., 2005

Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm.
Comput. Electr. Eng., 2005

2003
Partition Algorithm for Parallel Processing of Array Multiplication in Gf(2m) Fields.
Int. J. Comput. Math., 2003

1998
Parallel modular multiplication with table look-up.
Int. J. Comput. Math., 1998


  Loading...