[[abstract]]Fault-based cryptanalysis has been developed to effectively break both private-key and public-key cryptosystems, making robust finite field multiplication a very important research topic in recent years. However, no robust normal basis multiplier has been proposed in the literature. Therefore, this investigation presents a semisystolic Gaussian normal basis multiplier. Based on the proposed Gaussian normal basis multiplier, both concurrent error detection and correction capabilities can be easily achieved using time redundancy technology with no hardware modification
With the rapid development of economic and technical progress, designers and users of various kinds ...
Abstract:- In this article, a C-testable design for detecting transition faults in the polynomial ba...
In this paper, we propose a new normal basis multiplication algorithm for GF(2n). This algorithm can...
[[abstract]]Fault-based side-channel cryptanalysis is a useful technique against symmetrical and asy...
New bit-serial architectures with concurrent error detection capability are presented to detect erro...
Abstract—In this paper an efficient high-speed architecture of Gaussian normal basis multiplier over...
This article presents efficient hardware implementations for the gaussian normal basis multiplicatio...
Finite field arithmetic operations have been traditionally used in different applications ranging fr...
Normal basis multiplication in finite fields is vastly utilized in different applications, including...
In this article, two digit-serial architectures for normal basis multipliers over GF(2m) are present...
Galois fields are widely used in cryptographic applications. The detection of an error caused by a f...
Concurrent error detection in bit-serial normal basis multiplication over GF(2^m) using multiple par...
Abstract — This paper presents a design methodology for mul-tiple bit error detection and correction...
The arithmetic operations over GF(2m) have been extensively used in error correcting codes and publi...
Fast multiplication in a finite field GF(2m) is a basis step in communications engineering applicati...
With the rapid development of economic and technical progress, designers and users of various kinds ...
Abstract:- In this article, a C-testable design for detecting transition faults in the polynomial ba...
In this paper, we propose a new normal basis multiplication algorithm for GF(2n). This algorithm can...
[[abstract]]Fault-based side-channel cryptanalysis is a useful technique against symmetrical and asy...
New bit-serial architectures with concurrent error detection capability are presented to detect erro...
Abstract—In this paper an efficient high-speed architecture of Gaussian normal basis multiplier over...
This article presents efficient hardware implementations for the gaussian normal basis multiplicatio...
Finite field arithmetic operations have been traditionally used in different applications ranging fr...
Normal basis multiplication in finite fields is vastly utilized in different applications, including...
In this article, two digit-serial architectures for normal basis multipliers over GF(2m) are present...
Galois fields are widely used in cryptographic applications. The detection of an error caused by a f...
Concurrent error detection in bit-serial normal basis multiplication over GF(2^m) using multiple par...
Abstract — This paper presents a design methodology for mul-tiple bit error detection and correction...
The arithmetic operations over GF(2m) have been extensively used in error correcting codes and publi...
Fast multiplication in a finite field GF(2m) is a basis step in communications engineering applicati...
With the rapid development of economic and technical progress, designers and users of various kinds ...
Abstract:- In this article, a C-testable design for detecting transition faults in the polynomial ba...
In this paper, we propose a new normal basis multiplication algorithm for GF(2n). This algorithm can...