22 search results - page 1 / 5 » A Signcryption Scheme Based on Integer Factorization |
97
Voted
ISW
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Signcryption is a public-key cryptographic primitive introduced by Zheng, which achieves both message confidentiality and nonrepudiatable origin authenticity, at a lower ...
88
Voted
ICICS
2004
Springer
15 years 3 months ago
2004
Springer
Fail-stop signature (FSS) schemes are important primitives because in a fail-stop signature scheme the signer is protected against unlimited powerful adversaries as follows: Even i...
113
Voted
CORR
2011
Springer
14 years 2 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
70
Voted
CANS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. We extend their setting to the ring of integers modulo N. W...
90
Voted
CHES
2005
Springer
2005
Springer
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
15 years 3 months ago
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...