490 search results - page 75 / 98 » A New Public-Key Cryptosystem |
138
click to vote
CSJM
2006
15 years 3 months ago
2006
A new method is proposed to design short signature schemes based on difficulty of factorizing a composite number n = qr, where q and r are two large primes. Using the method new d...
140
click to vote
SCN
2010
Springer
15 years 1 months ago
2010
Springer
This paper introduces and explores the new concept of Time-Specific Encryption (TSE). In (Plain) TSE, a Time Server broadcasts a key at the beginning of each time unit, a Time Inst...
133
Voted
IACR
2011
14 years 3 months ago
2011
We present a generic transformation that allows us to use a large class of pairing-based signatures to construct schemes for signing group elements in a structure preserving way. A...
167
Voted
ICISC
2000
15 years 5 months ago
2000
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
131
Voted
CHES
2007
Springer
15 years 10 months ago
2007
Springer
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient ...