We describe a new method to perform the modular exponentiation operation, ie, the
computation of c= me mod n, where c, m, e and n are large integers. The new method uses …

Stereo and bi-ocular head-mounted displays (HMDs) require the user to fuse two images
into a coherent picture of the threedimensional world. The human visual system performs …

As an important component of Spectral Modular Arithmetic (SMA) cryptographic co-
processor, the efficient architectures of Number Theoretic Transforms (NTTs) on FPGA are …

The Schönhage-Strassen Algorithm (SSA) is an asymptotically fast multiplication algorithm
with the complexity of O (l log l log log l) where l is the operand size. It outperforms other …

Cryptography is a very active branch of science. Due to the everlasting struggle between
cryptographers, designing new algorithms, and cryptanalysts, attempting to break them, the …

In this paper we introduce a new transformation method and a multiplication algorithm for
multiplying the elements of the field GF (2^ k) expressed in a normal basis. The number of …

The spectral hash algorithm is one of the round 1 candidates for the SHA-3 family, and is
based on spectral arithmetic over a finite field, involving multidimensional discrete Fourier …

We describe a method of carrying multiplication in the binary extension fields. The new
method fully operates on the Fourier representations of the field elements by successively …

Most public-key cryptosystems require resource-intensive arithmetic calculations in certain
mathematical structures such as finite fields, groups, and rings. The efficient realizations of …

Abstract The Spectral Hash algorithm is one of the Round 1 candidates for the SHA-3 family,
and is based on spectral arithmetic over a finite field, involving multidimensional discrete …