18 search results - page 2 / 4 » Long Modular Multiplication for Cryptographic Applications |
FPL
2010
Springer
13 years 4 months ago
2010
Springer
Abstract--Modular multiplication of long integers is an important building block for cryptographic algorithms. Although several FPGA accelerators have been proposed for large modul...
DSD
2006
IEEE
13 years 10 months ago
2006
IEEE
Until now, most cryptography implementations on parallel architectures have focused on adapting the software to SIMD architectures initially meant for media applications. In this ...
ITCC
2005
IEEE
13 years 12 months ago
2005
IEEE
We define here the Montgomery Exponent of order s, modulo the odd integer N, by MEXP = MEXP(A, X, N, s) = AX 2−s(X−1) (mod N), and illustrate some properties and usage of thi...
ARITH
2009
IEEE
14 years 1 months ago
2009
IEEE
The selection of the elements of the bases in an RNS modular multiplication method is crucial and has a great impact in the overall performance. This work proposes specific sets ...
CSFW
2012
IEEE
11 years 8 months ago
2012
IEEE
—Formal methods have proved their usefulness for analysing the security of protocols. In this setting, privacy-type security properties (e.g. vote-privacy, anonymity, unlinkabili...