基于PUF的Logistic混沌序列发生器

doi:10.11959/j.issn.1000-436x.2019064

Abstract

Abstract:

Logistic nonlinear chaotic system has many good characters such as initial value sensitivity and topological mixing in the some parameter condition,which is used to create the random sequence signal generator.Because of the attributions of randomness and uniqueness even under the exact,the same circuit layouts and manufacturing procedures,there is still an instinct unclonable difference in each integrated circuit.Therefore,a new sequence stream generator was proposed based on Logistic chaotic system and physical unclonable function designed by double output look-up-table (LUT).The output of the Logistic sequence generator was associated with a specific physical circuit.This kind of sequence generator could resist an attack such as the replication of the keys of the system.The system was designed and tested on the Xilinx FPGA board.The results show that the same architecture of the circuit and the same config file operated on the different FPGA developing board can generate the total different random chaotic sequence stream and improve the randomness of the stream.

Key words: Logistic chaotic system, physical unclonable function, random number generator, stream ciphe

CLC Number:

TP301

Chunguang HUANG,Hai CHENG,Qun DING. Logistic chaotic sequence generator based on physical unclonable function[J]. Journal on Communications, 2019, 40(3): 182-189.

Figures/Tables 15

References 17

[1]	SBIAA F , BAGANNE A , ZEGHID M ,et al. A new approach for encryption system based on block cipher algorithms and Logistic function[C]// International Multi-Conference on Systems,Signals ＆Devices. 2015: 1-5.
[2]	KANSO A , SMAOUI N . Logistic chaotic maps for binary numbers generations[J]. Chaos Solitons ＆ Fractals, 2009,40(5): 2557-2568.
[3]	蔡丹, 季晓勇, 史贺 ,等. 改进分段 Logistic 混沌映射的方法及其性能分析[J]. 南京大学学报(自然科学), 2016,52(5): 809-815.
	CAI D , JI X Y , SHI H ,et al. Method for improving piecewise Logistic chaotic map and its performance analysis[J]. Journal of Nanjing University, 2016,52(5): 809-815.
[4]	XU L , LI Z , LI J ,et al. A novel bit-level image encryption algorithm based on chaotic maps[J]. Optics ＆ Lasers in Engineering, 2016,78(21): 17-25.
[5]	宣蕾, 闫纪宁 . 基于混沌的“一组一密”分组密码[J]. 通信学报, 2009,30(Z2): 105-110.
	XUN L , YAN J N . The “one group one cipher” cryptograph of block cipher based on chaotic[J]. Journal on Communications, 2009,30(Z2): 105-110.
[6]	王俊, 刘树波, 梁才 ,等. 基于 PUF 和 IPI 的可穿戴设备双因子认证协议[J]. 通信学报, 2017,38(6): 127-135.
	WANG J , LIU S B , LIANG C ,et al. Two-factor wearable device authentication protocol based on PUF and IPI[J]. Journal on Communications, 2017,38(6): 127-135.
[7]	郭渊博, 张紫楠, 杨奎武 . 基于 PUFS 的不经意传输协议[J]. 通信学报, 2013,34(Z1): 38-43.
	GUO Y B , ZHANG Z N , YANG K W . Oblivious transfer based on physical unclonable function system[J]. Journal on Communications, 2013,34(Z1): 38-43.
[8]	DABAL P , PELKA R . FPGA implementation of chaotic pseudo-random bit generators[C]// Mixed Design of Integrated Circuits and Systems. 2012: 260-264.
[9]	WANG H J , SONG B , LIU Q ,et al. FPGA design and applicable analysis of discrete chaotic maps[J]. International Journal of Bifurcation ＆ Chaos, 2014,24(4): 917-921.
[10]	ADAMO O , MOHANTYZ S P , KOIUGIANOS E ,et al. VLSI architecture and FPGA prototyping of a digital camera for image security and authentication[C]// Region 5 Conference. 2006: 154-158.
[11]	WANG Y , RENFA L I . FPGA based unified architecture for public key and private key cryptosystems[J]. Frontiers of Computer Science, 2013,7(3): 307-316.
[12]	GUAJARDO J , KUMAR S S , SCHRIJEN G J ,et al. FPGA intrinsic PUFs and their use for IP protection[C]// International Workshop on Cryptographic Hardware and Embedded Systems. 2007: 63-80.
[13]	TUNCER T . The implementation of chaos-based PUF designs in field programmable gate array[J]. nonlinear dynamics, 2016,86(2): 1-12.
[14]	LIU L , HUANG H , HU S . Lorenz chaotic system based carbon nanotube physical unclonable functions[J]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2017,PP(99): 1-1.
[15]	KUMAR S , . The buttefly PUF :protecting IP on every FPGA[C]// IEEE International Workshop on Hardware Oriented Security and Trust. 2008.
[16]	庞子涵, 周强, 高文超 ,等. 高效能FPGA毛刺PUF设计与实现[J]. 计算机辅助设计与图形学学报, 2017,29(6): 1135-1144.
	PANG Z H , ZHOU Q , GAO W C ,et al. Design and implementation of high efficiency PUF circuit on FPGA[J]. Journal of Computer-Aided Design ＆ Computer Graphics, 2017,29(6): 1135-1144.
[17]	CHENG H , SONG Y , HUANG C ,et al. Self-adaptive chaotic Logistic map:an efficient image encryption method[J]. Journal of Internet Technology, 2016,17(4): 743-752.

Metrics

Recommended 0

No Suggested Reading articles found!

开发板	00000000	10101010	11111111	11110000
开发板1	7f9dbb56	bfe7df9	22106ab8	f2461a6f
开发板2	3a72c143	fd57fed	1a221223	69262cd5
开发板3	81611c49	24c7c640	5534eb82	a48d9547
开发板4	f6bc6a1e	a67905cb	31eb8529	658b6610

方案	功能模块	每个功能模块包含单元电路	数量
		振荡器	64
		反相器	7
	PUF	与门	1
本文方案		计数器	32
		比较器	32
	Logistic	32 bit乘法器	1
		比特重组	1
		振荡器	128
		反相器	3
Tuncer等^[13]方案	PUF	与门	1
		计数器	2
		64选1多路选择器	2
		比较器	1
		Logistic	32 bit乘法器	2

统计	本文方案P值（μ=4）	Tuncer等^[13]方案P值（μ=3.99）	结果
频率检验	0.322 332	0.757	通过
块内频数检验	0.155 513	0.135	通过
游程检验	0.979 957	0.801	通过
块内最长游程检验	0.951 515	0.497	通过
二元矩阵秩检验	0.767 895	0.336	通过
离散傅里叶变换检验	0.426 73	0.501	通过
非重叠模块匹配检验	0.999 103	0.698	通过
重叠模块匹配检验	0.640 417	0.630	通过
Maurer的通用统计检验	0.999 914	0.435	通过
线性复杂度检验	0.351 439	0.644	通过
序列检验	0.185 09	0.444	通过
近似熵检验	0.319 519	0.949	通过
累加和检验	0.312 105	0.880	通过
随机游程检验	0.072 597	0.770	通过
随机游动状态频数检验	0.480 935	0.478	通过

Logistic chaotic sequence generator based on physical unclonable function

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 15

References 17

Related Articles 15

Metrics

Recommended 0

[1]	Dongyu CHEN, Hua CHEN, Limin FAN, Yifang FU, Jian WANG. Research on test strategy for randomness based on deep learning [J]. Journal on Communications, 2023, 44(6): 23-33.
[2]	Shengbao WANG, Xin ZHOU, Kang WEN, Bosen WENG. Tripartite authenticated key exchange protocol for smart grid [J]. Journal on Communications, 2023, 44(2): 210-218.
[3]	Zhenyu WANG, Yang GUO, Shaoqing LI, Shen HOU, Ding DENG. Design of efficient anonymous identity authentication protocol for lightweight IoT devices [J]. Journal on Communications, 2022, 43(7): 49-61.
[4]	Zhaocun ZHOU, Dengguo FENG. Survey on approaches of stream cipher cryptanalysis [J]. Journal on Communications, 2022, 43(11): 183-198.
[5]	Yan WANG,Shunbo LI,Gaina XUE. 2-adic complexity of SLCE sequence [J]. Journal on Communications, 2019, 40(8): 151-156.
[6]	Chenhuang WU,Chunxiang XU,Xiaoni DU. k-error linear complexity of q-ary sequence of period p² [J]. Journal on Communications, 2019, 40(12): 21-28.
[7]	Qiqi ZHANG,Jianguo ZHANG,Pu LI,Yanqiang GUO,Yuncai WANG. Boolean-chaos-based physical random number generator [J]. Journal on Communications, 2019, 40(1): 201-206.
[8]	Ruilin LI,Jiao HU,Chaojing TANG. Collision analysis of the GMR-2 cipher used in the satellite phone [J]. Journal on Communications, 2018, 39(2): 88-95.
[9]	Long-fei LIU,Kai YANG,Xiao-yuan YANG. On the linear complexity of a new generalized cyclotomic sequence with length ^mover GF(h) [J]. Journal on Communications, 2017, 38(9): 39-45.
[10]	Meng MA,Ya-qun ZHAO. Research on linear approximations of simplified Trivium [J]. Journal on Communications, 2016, 37(6): 185-191.
[11]	. The 2-adic complexity and the 1-error 2-adic complexity of single cycle T-functions [J]. Journal on Communications, 2014, 35(3): 15-139.
[12]	Wei YOU,Wen-feng QI. The 2-adic complexity and the 1-error 2-adic complexity of single cycle T-functions [J]. Journal on Communications, 2014, 35(3): 135-139.
[13]	. Oblivious transfer based on physical unclonable function system [J]. Journal on Communications, 2013, 34(Z1): 6-43.
[14]	Yuan-bo GUO,Zi-nan ZHANG,Kui-wu YANG. Oblivious transfer based on physical unclonable function system [J]. Journal on Communications, 2013, 34(Z1): 38-43.
[15]	Hai-ying GAO,Chen-hui JIN. Optimal combined distinguisher of stream cipher with multiple independent distinguishing characters [J]. Journal on Communications, 2012, 33(7): 44-48.