CORR
2008
Springer
14 years 9 months ago
2008
Springer
The Hamming weight enumerator function of the formally self-dual even, binary extended quadratic residue code of prime p = 8m + 1 is given by Gleason's theorem for singly-eve...
AINA
2003
IEEE
15 years 2 months ago
2003
IEEE
The multiplications of common multiplicands and exponentiations of large integers with a large modulus are the primary computation operations in several well-known public key cryp...
ESAS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. One of the most frequent operations in modern cryptosystems is a multi-scalar multiplication with two scalars. Common methods to compute it are the Shamir method and the ...
ARITH
2009
IEEE
15 years 4 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 ...