International audienceWe present below our first implementation results on a modular arithmetic library on GPUs for cryptography. Our library, in C++ for CUDA, provides modular arithmetic, finite field arithmetic and some ECC support. Several algorithms and memory coding styles have been compared: local, shared and register. For moderate sizes, we report up to 2.6 speedup compared to state-of-the-art library
Abstract. We introduce a CUDA GPU library to accelerate evaluations with homomorphic schemes defined...
In most currently used public-key cryptographic systems, including those based on the difficulty to ...
[Updated version of paper at Indocrypt 2010] A major cryptanalytic computation is currently underway...
International audienceWe present below our first implementation results on a modular arithmetic libr...
In the field of cryptography, public key algorithms are widely known to be slower than symmetric key...
Multiple-precision modular multiplications are the key components in security applications, like pub...
Cryptography, the science of writing secrets, has been used for centuries to conceal information fro...
Abstract—Graphics processing units (GPUs) have become increasingly popular over the last years as a ...
The aim of this thesis is to investigate possibilities for creating parallel arithmetic coding imple...
Problem description: Most public key algorithms are based on modular arithmetic. The simplest, and o...
International audience—Acceleration of cryptographic applications on Graphical Processing Units (GPU...
Multiple precision (MP) arithmetic is a core building block of a wide variety of algorithms in compu...
ISBN 978-1-4577-1416-0International audienceHigh-bandwidth secure channels require a lot of computin...
This thesis is about parallel programming. In the first part of the thesis is compared speed of func...
Context. The cryptographically secure pseudo-random number generator Blum Blum Shub (BBS) is a simpl...
Abstract. We introduce a CUDA GPU library to accelerate evaluations with homomorphic schemes defined...
In most currently used public-key cryptographic systems, including those based on the difficulty to ...
[Updated version of paper at Indocrypt 2010] A major cryptanalytic computation is currently underway...
International audienceWe present below our first implementation results on a modular arithmetic libr...
In the field of cryptography, public key algorithms are widely known to be slower than symmetric key...
Multiple-precision modular multiplications are the key components in security applications, like pub...
Cryptography, the science of writing secrets, has been used for centuries to conceal information fro...
Abstract—Graphics processing units (GPUs) have become increasingly popular over the last years as a ...
The aim of this thesis is to investigate possibilities for creating parallel arithmetic coding imple...
Problem description: Most public key algorithms are based on modular arithmetic. The simplest, and o...
International audience—Acceleration of cryptographic applications on Graphical Processing Units (GPU...
Multiple precision (MP) arithmetic is a core building block of a wide variety of algorithms in compu...
ISBN 978-1-4577-1416-0International audienceHigh-bandwidth secure channels require a lot of computin...
This thesis is about parallel programming. In the first part of the thesis is compared speed of func...
Context. The cryptographically secure pseudo-random number generator Blum Blum Shub (BBS) is a simpl...
Abstract. We introduce a CUDA GPU library to accelerate evaluations with homomorphic schemes defined...
In most currently used public-key cryptographic systems, including those based on the difficulty to ...
[Updated version of paper at Indocrypt 2010] A major cryptanalytic computation is currently underway...
.jpg%3Fwidth%3D300&w=3840&q=75)
Add to ORKG