Sciweavers

Share
IACR
2016

Eliminating Decryption Failures from the Simple Matrix Encryption Scheme

5 years 6 months ago
Eliminating Decryption Failures from the Simple Matrix Encryption Scheme
The SimpleMatrix encryption scheme as proposed by Tao et al. [16] is one of the very few existing approaches to create a secure and efficient encryption scheme on the basis of multivariate polynomials. However, in its basic version, decryption failures occur with non-negligible probability. Although this problem has been addressed in several papers [5,17], a general solution to it is still missing. In this paper we propose an improved version of the SimpleMatrix scheme, which eliminates decryption failures completely and therefore solves the biggest problem of the SimpleMatrix encryption scheme. Additionally, we propose a second version of the scheme, which reduces the blow-up
Albrecht Petzoldt, Jintai Ding, Lih-chung Wang
Added 03 Apr 2016
Updated 03 Apr 2016
Type Journal
Year 2016
Where IACR
Authors Albrecht Petzoldt, Jintai Ding, Lih-chung Wang
Comments (0)
books