Research on Chaotic Pseudo Random Bit Generator Based on Logistic Map

XU Dong; CUI Xiao-xin; WANG Tian; XU Xiao-qian; YU Dun-shan; CUI Xiao-le; CHENG Yu-fang

Chinese

您当前的位置：

首页 >

文章列表页 >

Research on Chaotic Pseudo Random Bit Generator Based on Logistic Map

更新时间：2026-09-04

- Research on Chaotic Pseudo Random Bit Generator Based on Logistic Map
- Vol. 33, Issue 2, Pages: 1-6(2016)
- 作者机构：
  
  1. 北京大学微纳电子研究院,北京,100871
  2. 北京大学深圳研究生院,广东,深圳,518055
  3. 国民技术股份有限公司,广东,深圳,518057
- 作者简介：
- 基金信息：
- DOI：
  CLC：
- Published：2016
- 稿件说明：
移动端阅览
许栋, 崔小欣, 王田, 徐晓倩, 于敦山, 崔小乐, 程玉芳. 基于Logistic映射的混沌随机数发生器研究[J]. 微电子学与计算机, 2016, 33(2): 1-6.

XU Dong, CUI Xiao-xin, WANG Tian, et al. Research on Chaotic Pseudo Random Bit Generator Based on Logistic Map[J]. 2016, 33(2): 1-6.
许栋, 崔小欣, 王田, 徐晓倩, 于敦山, 崔小乐, 程玉芳. 基于Logistic映射的混沌随机数发生器研究[J]. 微电子学与计算机, 2016, 33(2): 1-6. DOI：

XU Dong, CUI Xiao-xin, WANG Tian, et al. Research on Chaotic Pseudo Random Bit Generator Based on Logistic Map[J]. 2016, 33(2): 1-6. DOI：

摘要

分析了Logistic映射的混沌特性以及有限精度实现导致的特性退化问题

采用线性反馈移位寄存器LFSR生成序列对混沌映射施加扰动的方法设计实现了混沌伪随机数发生器

针对不同实现精度分析硬件资源消耗情况

并对产生的序列采用美国国家标准与技术研究院(NIST)所颁布的SP800-22标准进行测试并分析了随机性能.结果表明

产生序列具有良好的随机特性

并且扰动间隔和扰动幅度的变化对有效克服有限精度效应影响显著.

Abstract

In this paper

the chaotic characteristics of Logistic map and problem of its property degeneration due to finite precision implementation are analyzed. Method of perturbing the chaotic map with m-sequence generated by Linear Feedback Shift Register is used to implement chaotic Pseudo Random Bit Generator (PRBG). The consumption of hardware resources is researched for various hardware quantization wordlength. The generated sequences are tested under SP800-22 standard launched by National Institute of Standards and Technology (NIST) and their random properties are analyzed. Experimental results indicate that through adjusting perturbing interval and range

the chaotic characteristics degeneration due to the finite precision effects could be overcome effectively

and the output sequences have favorable random property.

关键词

Keywords

references

禹思敏. 混沌系统与混沌电路: 原理、设计及其在通信中的应用[M]. 西安: 西安电子科技大学出版社, 2011: 2-73. DOI: 2

Pareek N, Patidar V, Sud K. Cryptography using multiple one-dimensional chaotic maps[J]. Communications in Nonlinear Science and Numerical Simulation, 2005, 10(7): 715-723. DOI: 715

张天蓉. 蝴蝶效应之谜: 走近分形与混沌[M]. 北京: 清华大学出版社, 2013.

王相生. 序列密码设计与实现的研究[D]. 上海: 中国科学院上海冶金研究所, 2001.

樊昌信, 曹丽娜. 通信原理[M]. 6版. 北京: 国防工业出版社, 2006.

Sang T, Wang R, Yan Y. Perturbance-based algorithm to expand cycle length of chaotic key stream[J]. Electronics Letters, 1998, 34(9): 873-874. DOI: 873

刘嘉辉, 张宏莉. 基于可扩展精度的Logistic混沌随机序列的并行计算方法[J]. 中国科学技术大学学报, 2011, 41(9): 837-846. DOI: 837

周红, 凌燮亭. 有限精度混沌系统的m序列扰动实现[J]. 电子学报, 1997, 25(7): 95-97. DOI: 95

Views

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A grey wolf optimization algorithm with improved nonlinear convergence

Two Dimensional Numerical Integration Based on Chaotic Cuckoo Search Optimization Algorithm

The Implementation and Research of Chuas Circuit Employing Nonlinear Resistor Based on CCCII

KNN Text Classification Algorithm Based on Chaotic Binary Particle Swarm Optimization

Chaos Harmony Search Algorithm for Optimization

Related Author

WANG Qi

ZHAO Jun-jie

TAN Fa-ming

LUO De-xiang

OU Xu

LING Wei-gao

PENG Liang-yu

WANG Yu-zhen

Related Institution

Information Center, Jiang Su University of Technology

School of Electrical and Information Engineering, Jiang Su University of Technology

Information Center, Guangxi Medical University

College of Physics and Information Science, Hunan Normal University

Schoolof Information & Statistics, Guangxi University of Finance & Economics, Narming

AI问答

Postal code：100079
Tel：（010）53879206 Email：tmw@bjxintong.com.cn
Technical support is provided by Beijing Founder electronics co., LTD 京ICP备09082226号-64 京公网安备11010602201714号
It is recommended to read the content of this site in Chrome&IE9+. Please switch to extreme mode in browser 360.
Cookies We use cookies to help provide and enhance our service and tailor content. By continuing, you agree to the use of cookies.

⁰