Abstract: Polynomial multiplication over finite fields is one of the most significant operations in code-based cryptography, including hamming quasi-cyclic (HQC), which has been selected as a ...
Abstract: Fast time-domain algorithms have been developed in signal processing applications to reduce the multiplication complexity. For example, fast convolution structures using Cook-Toom and ...
LEAP is a general purpose Evolutionary Computation package that combines readable and easy-to-use syntax for search and optimization algorithms with powerful distribution and visualization features.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results