The major requirements of a secure high-speed communication system are low delay, good error performance, low redundancy, and good security. A simple nonlinear filter generator (NLFG)-based cryptosystem is proposed in...
详细信息
The major requirements of a secure high-speed communication system are low delay, good error performance, low redundancy, and good security. A simple nonlinear filter generator (NLFG)-based cryptosystem is proposed in this paper to provide low delay with high security. Enhanced security is attained by embedding security in the channel encoder. An efficient concatenation of Reed-Solomon code and a secure quasi-cyclic low density parity check code is used as channel encoder in the proposed cryptosystem to provide good error performance with low redundancy and to enhance security of NLFG with low structural complexity. The proposed efficient design of key-based dense scrambling matrix and permutation matrix greatly simplifies the hardware structure. The novel method for generation of intentional error vector with modification of NLFG helps to reduce both the delay and power consumption. The integrated system is designed in such a way that both NLFG-based stream cipher and secure channel coder complement each other to overcome the cryptographic weakness with a low hardware cost. The analytical and simulation results show that the proposed system attains significant security advantage against typical attacks and offers very good error performance. Copyright (c) 2015 John Wiley & Sons, Ltd.
CFS digital signature algorithm, which proposed in 2001, is the most important code based digital signature algorithm and can resist the known attack of quantum algorithms. But the efficiency of CFS is very low becaus...
详细信息
ISBN:
(纸本)9781538683033
CFS digital signature algorithm, which proposed in 2001, is the most important code based digital signature algorithm and can resist the known attack of quantum algorithms. But the efficiency of CFS is very low because of the extremely low signing speed and the large public key size. In this paper, a variation of CFS algorithm is presented. Instead of the Goppa code and the Patterson decoding algorithm, the new algorithm selects the Quasi-Cyclic Low Density Parity Check (QC-LDPC) code and the Belief Propagation (BP) decoding algorithm in the signing process. Compared with CFS algorithm, the new algorithm greatly reduces the storage space of public key and improves the efficiency of signature without compromising the security.
暂无评论