Author = T. Eghlidos

An efficient secure channel coding scheme based on polar codes

Volume 9, Issue 2, July 2017, Pages 111-118

https://doi.org/10.22042/isecure.2017.84609.380

B. Mafakheri, T. Eghlidos, H. Pilaram

Abstract In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller key size in comparison with the previous works. The results indicate that the scheme provides an efficient error performance and benefits from a higher code rate which can approach the channel capacity for large enough polar codes. The most important property of the proposed scheme is that if we increase the block length of the code, we can have a higher code rate and higher level of security without significant changes in the key size of the scheme. The resulting characteristics of the proposed scheme make it suitable for high-speed communications, such as deep space communication systems.

On the design and security of a lattice-based threshold secret sharing scheme

Volume 8, Issue 1, January 2016, Pages 25-38

https://doi.org/10.22042/isecure.2016.8.1.2

H. R. Amini Khorasgani, S. Asaad, H. Pilaram, T. Eghlidos, M. R. Aref

Abstract In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channels which requires designing lattice-based TSSSs. We investigate the effect of lattice dimension on the security and correctness of the proposed scheme. Moreover, we prove that for a fixed lattice dimension the proposed scheme is asymptotically correct. We also give a quantitative proof of security from information theoretic viewpoint.

Improving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes

Volume 4, Issue 1, January 2012, Pages 3-14

https://doi.org/10.22042/isecure.2015.4.1.2

R. Hooshmand, T. Eghlidos, M. R. Aref

Abstract This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Rao-Nam cryptosystem against chosen plaintext attacks, benefiting from an improvement on the structure of the Rao-Nam cryptosystem and proper choices of code parameters. Moreover, the proposed cryptosystem benefits from the highest code rate and a proper error performance.