Sciweavers

140 search results - page 8 / 28
» Public Key Cryptosystems Based on Chaotic-Chebyshev Polynomi...
Sort
View
ACISP
2005
Springer
15 years 3 months ago
Building Secure Tame-like Multivariate Public-Key Cryptosystems: The New TTS
Abstract. Multivariate public-key cryptosystems (sometimes polynomial-based PKC’s or just multivariates) handle polynomials of many variables over relatively small fields instea...
Bo-Yin Yang, Jiun-Ming Chen
CRYPTO
2001
Springer
162views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
New Public Key Cryptosystem Using Finite Non Abelian Groups
Most public key cryptosystems have been constructed based on abelian groups up to now. We propose a new public key cryptosystem built on finite non abelian groups in this paper. I...
Seong-Hun Paeng, Kil-Chan Ha, Jae Heon Kim, Seongt...
EUROCRYPT
1998
Springer
15 years 2 months ago
Auto-Recoverable Auto-Certifiable Cryptosystems
Abstract. This paper introduces a cryptographic paradigm called selfescrowed encryption, a concept initiated by kleptography. In simple words, a self-escrowed public-key cryptosyst...
Adam Young, Moti Yung
INDOCRYPT
2003
Springer
15 years 3 months ago
Public Key Cryptosystems Based on Free Partially Commutative Monoids and Groups
At INDOCRYPT 2003 Abisha, Thomas, and Subramanian proposed two public key schemes based on word problems in free partially commutative monoids and groups. We show that both propos...
P. J. Abisha, D. G. Thomas, K. G. Subramanian
IACR
2011
133views more  IACR 2011»
13 years 9 months ago
Compact McEliece keys based on Quasi-Dyadic Srivastava codes
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very l...
Edoardo Persichetti