This article exploits the fact that linear codes can correct twice the number of erasures as that of errors, allowing reduction in code size and providing the same level of security. decryption or both. The large code size of McEliece

It is well-known that there exists a trade-off between crypto-period and affected risk, so the key derivation is not only constrained by the partial-order class relation but also by the time period while handling hierarchical key assignment in dynamic enterprises. In this paper, a new date-constraint hierarchical key assignment scheme, which does not make use of public key cryptosystem, is prop...

In 2015, Liu et al. proposed a study relationship between RSA public key cryptosystem and Goldbach’s conjecture properties. They discussed the relationship between RSA and Goldbach conjecture, twin prime and Goldbach conjecture. In this paper the author will extend to introduce the relationsip among Goldbach conjecture, twin prime and Fibonacci number. Based on their contribution, the author co...

We propose a new homomorphic public-key cryptosystem over arbitrary nonidentity nite group based on the di culty of the membership problem for groups of integer matrices. Besides, a homomorphic cryptosystem is designed for the rst time over nite commutative rings.

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xi Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xiii Publications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xiv

At CT-RSA 2006, Wang et al. [WYHL06] introduced the MFE cryptosystem, which was subsequently broken by Ding et al. [DHNW07]. Inspired by their work, we present a more general framework for multivariate public key cryptosystems, which combines ideas from both triangular and oil-vinegar schemes. We also propose a new public key cryptosystem, based on Diophantine equations, which implements the fr...

We give an overview of the most important public-key cryptosystems and discuss the difficult task of evaluating the merit of such systems.

0. Introduction 1. Description of NTRU 1.1. Notation 1.2. Key Creation 1.3. Encryption 1.4. Decryption 1.5. Why Decryption Works 1.6. Parameter choices notation and a norm estimate 1.7. Sample spaces 1.8. A Decryption Criterion 2. Attributes and Advantages of NTRU 2.1. Theoretical Operating Speci cations 2.2. Comparison With Other PKCS's 3. Security Considerations 3.1. Security Analysis 3.2. Br...