281 search results - page 19 / 57 » Non-black-box Techniques in Cryptography |
DATE
2010
IEEE
2010
IEEE
pSHS: A scalable parallel software implementation of Montgomery multiplication for multicore systems
14 years 2 months ago
—Parallel programming techniques have become one of the great challenges in the transition from single-core to multicore architectures. In this paper, we investigate the parallel...
COCO
2009
Springer
14 years 1 months ago
2009
Springer
We give polynomial time computable extractors for low-weight affince sources. A distribution is affine if it samples a random points from some unknown low dimensional subspace of ...
CHES
2006
Springer
14 years 1 months ago
2006
Springer
The generation of prime numbers underlies the use of most public-key cryptosystems, essentially as a primitive needed for the creation of RSA key pairs. Surprisingly enough, despit...
CRYPTO
2006
Springer
14 years 1 months ago
2006
Springer
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
FDTC
2006
Springer
14 years 1 months ago
2006
Springer
We present a scheme for robust multi-precision arithmetic over the positive integers, protected by a novel family of non-linear arithmetic residue codes. These codes have a very hi...