Physical Layer Encryption of OFDM-PON Based on Quantum Noise Stream Cipher with Polar Code

Orthogonal frequency division multiplexing passive optical network(OFDM-PON) has superior anti-dispersion property to operate in the C-band of fiber for increased optical power budget. However,the downlink broadcast exposes the physical layer vulnerable to the threat of illegal eavesdropping. Quantum noise stream cipher(QNSC) is a classic physical layer encryption method and well compatible with the OFDM-PON. Meanwhile, it is indispensable to exploit forward error correction(FEC) to control errors in data transmission. However, when QNSC and FEC are jointly coded, the redundant information becomes heavier and thus the code rate of the transmitted signal will be largely reduced. In this work, we propose a physical layer encryption scheme based on polar-code-assisted QNSC. In order to improve the code rate and security of the transmitted signal, we exploit chaotic sequences to yield the redundant bits and utilize the redundant information of the polar code to generate the higher-order encrypted signal in the QNSC scheme with the operation of the interleaver.We experimentally demonstrate the encrypted 16/64-QAM, 16/256-QAM, 16/1024-QAM, 16/4096-QAM QNSC signals transmitted over 30-km standard single mode fiber. For the transmitted 16/4096-QAM QNSC signal, compared with the conventional QNSC method, the proposed method increases the code rate from 0.1 to 0.32 with enhanced security.

Research on Stream Cipher Model Based on Chaos Theory

Chaos is a similar and random process which is very sensitive to initial value in deterministic system. It is a performance of nonlinear dynamical system with built-in randomness. Combined with the advantages and disadvantages of the present chaos encryption model, the paper proposes a chaotic stream cipher model based on chaos theory, which not only overcomes finite precision effect, but also improves the randomness of chaotic system and output sequence. The Sequence cycle theory generated by the algorithm can reach more than 10600 at least, which completely satisfies the actual application requirements of stream cipher system.

Cryptanalysis of an ergodic chaotic encryption algorithm

In this paper, we present the results for the security and the possible attacks on a new symmetric key encryption algorithm based on the ergodicity property of a logistic map. After analysis, we use mathematical induction to prove that the algorithm can be attacked by a chosen plaintext attack successfully and give an example to show how to attack it. According to the cryptanalysis of the originM Mgorithm, we improve the originM Mgorithm, and make a brief cryptanalysis. Compared with the original algorithm, the improved algorithm is able to resist a chosen plaintext attack and retain a considerable number of advantages of the original algorithm such as eneryption speed, sensitive dependence on the key, strong anti-attack capability, and so on.

Theoretical design for a class of chaotic stream cipher based on nonlinear coupled feedback

A class of chaotic map called piecewise-quadratic-equation map to design feedback stream cipher is proposed. Such map can generate chaotic signals that have uniform distribution function, δ-like autocorrelation function. Compared with the piecewise-linear map, this map provides enhanced security in that they can maintain the original perfect statistical properties, as well as overcome the defect of piecewise-linearity and expand the key space. This paper presents a scheme to improve the local complexity of the chaotic stream cipher based on the piecewise-quadratic-equationmap. Both the theoretic analysis and the results of simulation show that this scheme improves the microstructure of the phase-space graph on condition that the good properties of the original scheme are remained.

Cipher quasi-chaotic code for frequency hopping communications

The chaotic frequency hopping (FH) communication systems have been presented so far. The chaotic sequences possesses good randomness and sensitive dependence on initial conditions, which is quite advantageous to run the FH codes in code-division multiple access (CDMA) systems. But the finite precision of computation and the fact of the low-dimensional chaos predicted easily cause difficulty in chaotic application. In this paper, some disadvantages associated with the conventional FH codes and the chaotic code scrambled by m-sequences are reviewed briefly. In order to overcome these drawbacks to some extents, a new higher performance FH code called cipher quasi-chaotic (CQC) code is proposed, which is generated by combining the clock-controlled stream cipher technique and chaotic dynamics. Performance analysis applying in FH communication systems of this kind of code is given. The privacy of the CQC sequence is also analyzed.

Enhanced Parallelized DNA-Coded Stream Cipher Based on Multiplayer Prisoners’Dilemma

Data encryption is essential in securing exchanged data between connected parties.Encryption is the process of transforming readable text into scrambled,unreadable text using secure keys.Stream ciphers are one type of an encryption algorithm that relies on only one key for decryption and as well as encryption.Many existing encryption algorithms are developed based on either a mathematical foundation or on other biological,social or physical behaviours.One technique is to utilise the behavioural aspects of game theory in a stream cipher.In this paper,we introduce an enhanced Deoxyribonucleic acid(DNA)-coded stream cipher based on an iterated n-player prisoner’s dilemma paradigm.Our main goal is to contribute to adding more layers of randomness to the behaviour of the keystream generation process;these layers are inspired by the behaviour of multiple players playing a prisoner’s dilemma game.We implement parallelism to compensate for the additional processing time that may result fromadding these extra layers of randomness.The results show that our enhanced design passes the statistical tests and achieves an encryption throughput of about 1,877 Mbit/s,which makes it a feasible secure stream cipher.

A Novel Pipelining Encryption Hardware System with High Throughput and High Integration for 5G

This paper presents a ZUC-256 stream cipher algorithm hardware system in order to prevent the advanced security threats for 5 G wireless network.The main innovation of the hardware system is that a six-stage pipeline scheme comprised of initialization and work stage is employed to enhance the solving speed of the critical logical paths.Moreover,the pipeline scheme adopts a novel optimized hardware structure to fast complete the Mod(231-1)calculation.The function of the hardware system has been validated experimentally in detail.The hardware system shows great superiorities.Compared with the same type system in recent literatures,the logic delay reduces by 47%with an additional hardware resources of only 4 multiplexers,the throughput rate reaches 5.26 Gbps and yields at least 45%better performance,the throughput rate per unit area increases 14.8%.The hardware system provides a faster and safer encryption module for the 5G wireless network.

新形态对称密码算法研究

安全多方计算、全同态加密和零知识证明是解决数据安全问题的重要密码技术,其快速发展和应用需求驱动,引发了新形态对称密码的设计与安全性分析.本文系统介绍适宜安全多方计算、全同态加密和零知识证明的新形态对称密码算法.首先梳理新形态对称密码算法的应用需求和设计目标;然后归类介绍新形态对称密码算法的设计理念和最新的安全性评估结果;最后总结探讨新形态对称密码算法的设计特点以及面临的问题.

RC4加密算法改进研究及电路设计

针对软件实现RC4算法易遭受攻击且效率不高的问题,基于硬件电路实现算法的思想,引入快速伪随机数发生器提出一种改进RC4并设计电路实现。结合种子密钥和伪随机数进行字节内部与字节间的置乱改进初始化算法,提高算法安全性;设计消耗更少时钟周期的电路生成密钥流,提升加密效率。NIST检测显示改进RC4的密钥流序列随机性优于现存基于硬件的RC4产生的密钥流,仿真结果表明,电路能够完成正确加解密。

流密码框架下的SM4专用认证加密算法

认证加密算法是能同时满足数据机密性与完整性的对称密码算法,在数据安全领域具有广泛应用。针对基于分组密码的认证加密算法的安全性以及效率需求,提出一种基于SM4轮函数的专用认证加密算法SMRAE。算法采用流密码思想,从SM4底层部件出发,结合Feistel结构设计状态更新函数用于轮变换,处理256 bit消息只需调用4个SM4轮函数指令。在初始化阶段将初始向量和密钥经过16轮迭代,使差分充分随机化;利用SM4加密消息,将生成的密文参与轮变换,实现状态更新和加密并行;解密时先进行消息认证,降低时间消耗,提高算法安全性。安全性分析与实验结果表明SMRAE能够抵抗伪造攻击、差分攻击和猜测攻击等主流攻击,效率高于AES-GCM,与SM4效率相当,具备一定的实用性。

Chaos block cipher for wireless sensor network

New block cipher algorithm in single byte for wireless sensor network with excellence of many cipher algorithms is studied. The child keys are generated through the developed discrete Logistic mapping, and the Feistel encrypting function with discrete chaos operation is constructed. The single byte block is encrypted and decrypted through one turn permutation, being divided into two semi-byte, quadri- Feistel structural operation, and one turn permutation again. The amount of keys may be variable with the turns of Feistel structural operation. The random and security of the child key was proven, and the experiment for the block cipher in wireless sensor network was completed. The result indicates that the algorithm is more secure and the chaos block cipher in single byte is feasible for wireless sensor network.

一类新型混沌反馈密码序列的理论设计

本文提出一种新型混沌映射，“逐段二次方根”映射，用于反馈密码序列的设计，该映射可产生具有均匀分布函数和δｌｉｋｅ自相关函数的模拟混沌序列，它们经过一类特殊变换的量化后可生成具有安全统计性质的０１序列．与周红等人提出的映射相比，该新映射提供了更强的安全性，这是因为它在保留了原有的优良统计性质的基础上解决了“逐段线性”的缺陷并扩大了密钥空间．

基于Logistic映射混沌加密算法的设计与实现

序列密码作为主要密码技术之一,它的的安全强度完全决定于它所产生的伪随机序列的好坏。混沌系统能产生具有对初值敏感、难以预测的性能良好的伪随机序列,所以很适于序列密码。通过对基于Logistic混沌映射的加密算法原理的分析,提出了一个基于该算法的加密方法,并从算法的安全性、效率等方面进行了性能分析。最后采用VisualC++开发工具完成了该混沌加密算法的设计,并用该算法对一个实例进行了加密。

基于混沌的序列密码加密算法

提出了基于Logistic 映射的混沌序列密码加密算法和基于Lorenz系统的混沌序列密码加密算法,给出了C语言程序的图像加密实例。基于Logistic 映射的加密算法比基于Lorenz系统的加密算法具有更快的运算速度，但后者的安全性更高。研究表明，利用混沌系统产生序列密码是可行的，算法是安全的。

对超混沌系统的图像加密算法安全性的改进

针对Gao等人提出的一种基于超混沌系统的图像加密算法的安全性缺陷,提出了一种改进的图像加密算法,该算法利用超混沌产生的超混沌序列对明文不同的像素点采用不同的方式进行加密。仿真实验结果表明,改进算法加密效果良好,加密效率更高,在保留原算法优点的基础上克服了其不能抵御选择明文攻击和选择密文攻击的缺陷,具有更高的安全性。

一种新的混合密码系统

根据非线性动力学中的混沌理论设计了一种混沌序列密码 ,利用该序列密码与 RSA公开密钥算法构造了一种新的混合密码体制 .该密码体制的安全性等价于 RSA的安全性 ,但是计算量却远远小于 RSA的计算量 .该算法既适合于字母文字信息的加密 ,也适合非字母文字信息的加密 .文中给出了一个加密字母文字信息的实例 .如果加密汉字计算量会更小一些 .

一种多级混沌图像加密算法研究

由于图像本身具有数据量大、像素点之间高相关性和高冗余性等特点,因此不能用一般的文本加密算法来进行图像加密。而混沌具有初始条件和参数敏感性、遍历性和混合性等优良特性,混沌图像加密是一种效率高、安全性好的图像加密方法。本文提出了一种多级混沌图像加密算法,首先对二维混沌进行离散和规范化,用其对图像像素点进行空间置乱,然后用混合混沌序列对图像的像素灰度值扩散进一步掩盖明文和密文的关系,因而该方法可以有效地抵抗统计和差分攻击。同时,对提出的算法进行仿真实验和安全性分析,结果表明该算法具有安全性高,加密速度快等特点。

基于Logistic映射的混沌流密码设计

混沌系统特有的一些优良属性较适合流密码的设计,比如混沌迭代序列对初始条件和控制参数的敏感性、伪随机性、混和性和确定性等。该文以Logistic映射为例说明了其主要特性和初值敏感性,并重点图示了在字节输出方式下和比特输出方式下,其离散分布和均匀分布的差异和改善。

基于混沌理论的文件安全系统

混沌信号具有良好的随机性，可以作为序列密码应用于保密通信。该文基于混沌理论，设计了一种安全性高、代价低、易于软件实现的混沌序列密码加密算法，并在此基础上，结合DES、3DES和RSA通用标准加密算法和数字签名、完整性检验等安全技术，提出了一个比较完整的文件安全系统的设计方案，该系统具有安全性好、易于使用、速度快的特点。

基于混沌的RC4流加密算法

针对WEP、TKIP使用IV向量存在的安全隐患问题,提出一种将混沌映射与RC4算法相结合的加密算法,并给出相应的密钥管理方案,同时对该加密算法的密钥空间、随机性及加密效果进行分析。基于混沌的RC4算法利用混沌随机序列作为种子密钥,提高密钥的随机性,增加破译难度,且密钥变换空间相比WEP、TKIP得到较大的拓展。