Multiple-precision modular multiplications are the key components in security applications, like public-key cryptography for encrypting and signing digital data. But unfortunately they are computationally expensive for contemporary CPUs. By exploiting the computing power of the many-core GPUs, we implemented a multiple-precision integer library with CUDA. In this paper, we will investigate the implementation of two approaches of multiple-precision modular multiplications on GPU. We will analyze the detail of the instructions of multiple-precision modular multiplication on the GPU and find the hit issues, and then we propose to use the inline ASM to improve the implementation of this function. Our experimental results show that the performan...
International audience—Acceleration of cryptographic applications on Graphical Processing Units (GPU...
In multiword arithmetic, a matrix is represented as the unevaluated sum of two or more lower-precisi...
Protocols for asymmetric cryptography require arithmetic computations in several mathematical struct...
International audienceWe present below our first implementation results on a modular arithmetic libr...
Multiple precision (MP) arithmetic is a core building block of a wide variety of algorithms in compu...
In the field of cryptography, public key algorithms are widely known to be slower than symmetric key...
International audienceMany scientific computing applications demand massive numerical computations o...
Abstract—Graphics processing units (GPUs) have become increasingly popular over the last years as a ...
Context. The cryptographically secure pseudo-random number generator Blum Blum Shub (BBS) is a simpl...
Current general purpose libraries for multiple precision floating point arithmetic such as Mpfr suff...
Evaluating non-linear multivariate polynomial systems over finite fields is an important subroutine ...
We provide efficient single- and double-precision GPU (Graphics Processing Unit) implementa-tions of...
Multiphysics systems are used to simulate various physics phenomena given byPartial Differential Equ...
Polynomial multiplication is the most time-consuming part of cryptographic schemes whose security is...
The aim of this thesis is to investigate possibilities for creating parallel arithmetic coding imple...
International audience—Acceleration of cryptographic applications on Graphical Processing Units (GPU...
In multiword arithmetic, a matrix is represented as the unevaluated sum of two or more lower-precisi...
Protocols for asymmetric cryptography require arithmetic computations in several mathematical struct...
International audienceWe present below our first implementation results on a modular arithmetic libr...
Multiple precision (MP) arithmetic is a core building block of a wide variety of algorithms in compu...
In the field of cryptography, public key algorithms are widely known to be slower than symmetric key...
International audienceMany scientific computing applications demand massive numerical computations o...
Abstract—Graphics processing units (GPUs) have become increasingly popular over the last years as a ...
Context. The cryptographically secure pseudo-random number generator Blum Blum Shub (BBS) is a simpl...
Current general purpose libraries for multiple precision floating point arithmetic such as Mpfr suff...
Evaluating non-linear multivariate polynomial systems over finite fields is an important subroutine ...
We provide efficient single- and double-precision GPU (Graphics Processing Unit) implementa-tions of...
Multiphysics systems are used to simulate various physics phenomena given byPartial Differential Equ...
Polynomial multiplication is the most time-consuming part of cryptographic schemes whose security is...
The aim of this thesis is to investigate possibilities for creating parallel arithmetic coding imple...
International audience—Acceleration of cryptographic applications on Graphical Processing Units (GPU...
In multiword arithmetic, a matrix is represented as the unevaluated sum of two or more lower-precisi...
Protocols for asymmetric cryptography require arithmetic computations in several mathematical struct...