185 search results - page 27 / 37 » A Lattice-Based Public-Key Cryptosystem |
IACR
2011
13 years 10 months ago
2011
The Isomorphism of Polynomials (IP) is one of the most fundamental problems in multivariate public key cryptography (MPKC). In this paper, we introduce a new framework to study th...
PKC
2000
Springer
15 years 1 months ago
2000
Springer
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
FC
2010
Springer
14 years 11 months ago
2010
Springer
We provide several concrete implementations of a generic method given by Vaudenay to construct secure privacy-preserving RFID authentication and identification systems. More precis...
IACR
2011
13 years 10 months ago
2011
The wild McEliece cryptosystem uses wild Goppa codes over finite fields to achieve smaller public key sizes compared to the original McEliece cryptosystem at the same level of se...
107
click to vote
DCC
2007
IEEE
15 years 10 months ago
2007
IEEE
A general method for deriving an identity-based public key cryptosystem from a one-way function is described. We construct both ID-based signature schemes and ID-based encryption ...