Zobrazeno 1 - 10
of 84
pro vyhledávání: '"Che Wun Chiou"'
Autor:
Che Wun Chiou, Yuh‐Sien Sun, Che Wei Liang, Liang Yu Chen, Shih En Dai, Chen En To, Chen Che Chien
Publikováno v:
Electronics Letters, Vol 58, Iss 12, Pp 468-470 (2022)
Abstract Fault attacks have been proved for efficiently breaking hardware‐based elliptic curve cryptosystems. One way for fighting against fault attacks is to design the core multiplier circuit of elliptic curve cryptosystem with concurrent error d
Externí odkaz:
https://doaj.org/article/cf23d5987df541839fcbaa0fc0a21a7a
Publikováno v:
IET Circuits, Devices and Systems, Vol 11, Iss 6, Pp 579-588 (2017)
In recent years, subquadratric‐and‐quadratric Toeplitz matrix–vector product (TMVP) computations are widely used for the implementation of binary field multiplication in elliptic curve cryptography. Pure subquadratric TMVP structure involves si
Externí odkaz:
https://doaj.org/article/fcbe65c301b44c41b237f321b3c71d14
Publikováno v:
Journal of Applied Mathematics and Computation. 6:482-491
Publikováno v:
International Journal of Food Science and Agriculture. 6:372-378
Publikováno v:
Journal of Applied Mathematics and Computation. 6:390-404
Publikováno v:
IET Computers & Digital Techniques. 12:187-191
In this study, the authors propose a high-throughput systolic Dickson basis multiplier over GF(2 m ). Use of the Dickson basis seems promising when no Gaussian normal basis exists for the field, and it can easily carry out both squaring and multiplic
Publikováno v:
Electronics Letters. 55:28-30
Finite field multiplier is a very important operation for realising elliptic curve cryptography. Dickson basis is a recently developed basis for representing finite elements in GF(2 m ). This study will propose a unidirectional systolic multiplier fo
Publikováno v:
IET Information Security. 11:301-311
Various cryptosystems, such as elliptic curve and pairing-based cryptosystems, in resource-constrained security applications rely on finite field multiplication. For applications such as these, a digit-serial multiplier has the potential features to
Publikováno v:
IET Circuits, Devices & Systems. 11:579-588
In recent years, subquadratric-and-quadratric Toeplitz matrix–vector product (TMVP) computations are widely used for the implementation of binary field multiplication in elliptic curve cryptography. Pure subquadratric TMVP structure involves signif
Publikováno v:
Journal of the Chinese Institute of Engineers. 38:191-199
Finite field multiplication over GF(2m) is one of the most important arithmetic operations for curve-based cryptosystems, such as elliptic curve cryptosystems and pairing-based cryptosystems. Gaussian normal basis (GNB) multiplier is very suitable fo