检索结果-内蒙古大学图书馆

Image encryption based on fractional chaotic pseudo-random number generator and DNA encryption method

NONLINEAR DYNAMICS 2022年第3期109卷 2103-2127页

作者： Yang, Chunxiao Taralova, Ina El Assad, Safwan Loiseau, Jean-Jacques Ecole Cent Nantes UMR CNRS 6004 LS2N Nantes France Univ Nantes UMR CNRS 6164 IETR Polytech Nantes Nantes France

Nonlinear dynamic systems and chaotic systems have been quite exhaustively researched in the domain of cryptography. However, the possibility of using fractional chaotic systems in the cryptosystem design has been much less explored while it bears advantages such as enlarged keyspace and better resistance to attack compared to classical nonlinear systems. This paper, therefore, proposes a novel structure for the pseudo-random number generator based on 3 different fractional chaotic systems, namely fractional Chen system, Lu system, and fractional generalized double-humped logistic map. Then, the outputs of this fractional chaotic pseudo-random number generator are used as a keystream for an image encryption scheme. The confusion layer of the scheme is conducted by a dynamic DNA encoding and decoding method combined with a 2D cat map for the permutation in the DNA bases level. The diffusion layer is performed through the adoption of a 32 bits discrete logistic map. The performance and security analyses have been conducted for the above-designed cryptosystem, proving that the proposed cryptosystem is practical and efficient, and can be successfully implemented in image encryption.

关键词： Fractional chaotic system pseudo-random number generator DNA encoding and decoding Image encryption

来源：评论

学校读者我要写书评

暂无评论

A novel pseudo-random number generator for IoT based on a coupled map lattice system using the generalised symmetric map

引用

SN APPLIED SCIENCES 2022年第2期4卷 48页

作者： Zia, Unsub McCartney, Mark Scotney, Bryan Martinez, Jorge Sajjad, Ali Ulster Univ Sch Comp Belfast Antrim North Ireland British Telecommun PLC Appl Res Ipswich Suffolk England

pseudo-random number generators (PRNGs) are one of the building blocks of cryptographic methods and therefore, new and improved PRNGs are continuously developed. In this study, a novel method to generate pseudo-random sequences using coupled map lattices is presented. Chaotic maps only show their chaotic behaviour for a specified range of control parameters, what can restrict their application in cryptography. In this work, generalised symmetric maps with adaptive control parameter are presented. This novel idea allows the user to choose any symmetric chaotic map, while ensuring that the output is a stream of independent and random sequences. Furthermore, to increase the complexity of the generated sequences, a lattice-based structure where every local map is linked to its neighbouring node via coupling factor has been used. The dynamic behaviour and randomness of the proposed system has been studied using Kolmogorov-Sinai entropy, bifurcation diagrams and the NIST statistical suite for randomness. Experimental results show that the proposed PRNG provides a large key space, generates pseudo-random sequences and is computationally suitable for IoT devices.

关键词： Coupled map lattice Generalised symmetric map pseudo-random number generator Internet of Things

来源：评论

学校读者我要写书评

暂无评论

A novel pseudo-random number generator based on multivariable optimization for image-cryptographic applications

引用

EXPERT SYSTEMS WITH APPLICATIONS 2024年 240卷

作者： Haider, Takreem Blanco, Saul A. Hayat, Umar Indiana Univ Dept Comp Sci Bloomington IN 47408 USA Univ Surrey Dept Comp Sci Guildford GU2 7XH Surrey England Quaid I Azam Univ Dept Math Islamabad 45320 Pakistan

pseudo-random number generators (PRNGs) play an important role to ensure the security and confidentiality of image cryptographic algorithms. Their primary function is to generate a sequence of numbers that possesses unpredictability and randomness, which is crucial for the algorithms to work effectively and provide the desired level of security. However, traditional PRNGs frequently encounter limitations like insufficient randomness, predictability, and vulnerability to cryptanalysis attacks. To overcome these limitations, we propose a novel method namely an elliptic curve genetic algorithm (ECGA) for the construction of an image-dependent pseudo-random number generator (IDPRNG) that merges elliptic curves (ECs) and a genetic algorithm (GA). The ECGA consists of two primary stages. First, we generate an EC-based initial sequence of random numbers using pixels of a plain-image and parameters of an EC that depart from traditional methods of population initialization. In our proposed approach, the image itself serves as the seed for the initial population in the genetic algorithm optimization, taking into account the image-dependent nature of cryptographic applications. This allows the PRNG to adapt its behavior to the unique characteristics of the input image, leading to enhanced security and improved resistance against differential attacks. Furthermore, the use of a good initial population reduces the number of generations required by a genetic algorithm which results in decreased computational cost. In the second stage, we use well-known operations of a genetic algorithm to optimize the generated sequence by maximizing a multi-variable fitness function that is based on both the information entropy and the period of the PRNG. By combining elliptic curves and genetic algorithms, we enhance the randomness and security of the ECGA. To evaluate the effectiveness and security of our generator, we conducted comprehensive experiments using various benchmark images and appli

关键词： pseudo-random number generator Elliptic curve Genetic algorithm NIST analysis

来源：评论

学校读者我要写书评

暂无评论

Analysis of the influence of a pseudo-random number generator type on the kinetics of the cellular automata recrystallization model

引用

JOURNAL OF COMPUTATIONAL SCIENCE 2024年 75卷

作者： Baran, Klaudia Sitko, Mateusz Madej, Lukasz AGH Univ Krakow Fac Met Engn & Ind Comp Sci A Mickiewicza Ave 30 PL-30059 Krakow Poland

Models based on discrete simulation methods, i.e., cellular automata (CA) or Monte Carlo (MC), often contain probabilistic elements in the code to capture the stochastic character of material behaviour. They can be related to various physical aspects reflected in the model, e.g., heterogeneous energy distribution or random crystallographic orientation assignment to subsequent grains. Therefore, the paper's main aim is to analyze the influence of such random elements in the CA recrystallization model used to predict the material microstructure morphology after thermo-mechanical treatment. The first part of the work presents the available tools for pseudo-random number generation and the main elements of the investigated CA recrystallization model. Different variants of input data preparation prior to the simulation, including deformation energy distribution, are shown. The role of the investigated pseudo-random number generators (rand, lcg, mt, ranlux) and their distribution (uniform, normal, lognormal) is highlighted in this part. Finally, the input data are used to perform simulations of recrystallization progress, and the effect of pseudo-random number generation parameters on transformation kinetics and growth of recrystallized grains is evaluated. With this work, we have demonstrated that the choice of the generator type, particularly the method of its distribution, influences the simulation results in the form of final material morphology.

关键词： pseudo-random number generator Cellular automata Recrystallization Deformation energy distribution

来源：评论

学校读者我要写书评

暂无评论

LWR-based Quantum-Safe pseudo-random number generator

引用

JOURNAL OF INFORMATION SECURITY AND APPLICATIONS 2023年 73卷

作者： Pandit, Anupama Arjun Kumar, Atul Mishra, Arun Def Inst Adv Technol Girinagar Dept Comp Sci & Engn Pune 411025 Maharashtra India

Learning with Rounding (LWR) is a lattice-based cryptographically hard problem which quantum computers find difficult to solve. LWR problem is a derandomized variant of Learning with Errors (LWE) where deterministic rounding is used to generate errors efficiently. LWR can construct a secure seed for Quantum-Safe pseudo-random number generator (QSPRNG). This study is an endeavor to construct a QSPRNG to generate a stream of pseudo-random bits through a Linear Feedback Shift Register (LFSR). The proposed QSPRNG uses secure seed as an input and a Homomorphic Function for preserving the security of the internal states of LFSRs. NIST statistical tests, ENT, and DIEHARD tests are performed on constructed PRNG for randomness analysis. Also, security and speed analysis for the proposed QSPRNG has been done to illustrate its possible future utilization in cryptography.

关键词： pseudo-random number generator Lattice-based cryptography Learning with Rounding Linear Feedback Shift Register Homomorphic function NIST statistical test suite

来源：评论

学校读者我要写书评

暂无评论

Generative Adversarial Networks-Based pseudo-random number generator for Embedded Processors 1

引用

23rd International Conference on Information Security and Cryptology (ICISC)

作者： Kim, Hyunji Kwon, Yongbeen Sim, Minjoo Lim, Sejin Seo, Hwajeong Hansung Univ IT Dept Seoul South Korea

ISBN: (数字)9783030688905

ISBN: (纸本)9783030688905;9783030688899

A pseudo-random number generator (PRNG) is a fundamental building block for modern cryptographic solutions. In this paper, we present a novel PRNG based on generative adversarial networks (GAN). A recurrent neural network (RNN) layer is used to overcome the problems of predictability and reproducibility for long random sequences, which is found in the result of the NIST test suite for the previous method. The proposed design generates a random number of 1,099,200-bits with a 64-bit seed. The proposed method is also efficiently implemented on embedded processors by using the Edge TPU. To support the Edge TPU, the proposed GAN based PRNG is converted to a Tensor-Flow Lite model. During model training, the number of epochs is significantly reduced with the proposed approach. The PRNG generates random numbers in 13.27ms using the Edge TPU. Also, our PRNG achieved a speed of 1.0 GB/s, which is about 6.25x compared to the speed of other lightweight PRNG. To the best of our knowledge, this is the first GAN based PRNG for embedded processors. Finally, generated random numbers were tested through the NIST random number test suite. Compared with the previous method, the proposed method reduced the percentage of test failures by 2.85x. The result shows that the proposed GAN-based PRNG achieved high randomness even on embedded processors.

关键词： pseudo-random number generator Generative adversarial networks Edge TPU Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

New pseudo-random number generator for EPC Gen2

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2020年第2期E103D卷 292-298页

作者： Nomaguchi, Hiroshi Su, Chunhua Miyaji, Atsuko Univ Aizu Div Comp Sci Aizu Wakamatsu Fukushima 9658580 Japan Osaka Univ Grad Sch Engn Suita Osaka 5650871 Japan Japan Adv Inst Sci & Technol Nomi 9231292 Japan

RFID enable applications are ubiquitous in our society, especially become more and more important as IoT management rises. Meanwhile, the concern of security and privacy of RFID is also increasing. The pseudorandom number generator is one of the core primitives to implement RFID security. Therefore, it is necessary to design and implement a secure and robust pseudo-random number generator (PRNG) for current RFID tag. In this paper, we study the security of light-weight PRNGs for EPC Gen2 RFID tag which is an EPC Global standard. For this reason, we have analyzed and improved the existing research at IEEE TrustCom 2017 and proposed a model using external random numbers. However, because the previous model uses external random numbers, the speed has a problem depending on the generation speed of external random numbers. In order to solve this problem, we developed a pseudorandom number generator that does not use external random numbers. This model consists of LFSR, NLFSR and SLFSR. Safety is achieved by using nonlinear processing such as multiplication and logical multiplication on the Galois field. The cycle achieves a cycle longer than the key length by effectively combining a plurality of LFSR and the like. We show that our proposal PRNG has good randomness and passed the NIST randomness test. We also shows that it is resistant to identification attacks and GD attacks.

关键词： NLFS (Non-linear feedback shift register) SLFSR (Skip-Linear feedback shift register) pseudo-random number generator RFID EPC Gen2

来源：评论

学校读者我要写书评

暂无评论

A Lightweight pseudo-random number generator Based on a Robust Chaotic Map 4

A Lightweight Pseudo-Random Number Generator Based on a Robu...

引用

4th International Conference on Intelligent Computing in Data Sciences (ICDS)

作者： El Hanouti, Imad El Fadili, Hakim Souhail, Wahid Masood, Fawad Sidi Mohamed Ben Abdellah Univ LIPI Lab Fes Morocco Univ Monastir Natl Engn Sch Monastir Monastir Tunisia Inst Space Technol Dept Elect Engn Islamabad Pakistan

ISBN: (纸本)9781728180847

In this paper, we propose a new simple and fast algorithm for entropy extraction and pseudo-random numbers generation from a robust chaotic map. This method could be used as an entropy source in some cryptographic applications. Based on robust chaos and simple operations, the randomness of the generated sequences might be accepted for many security applications. We run a statistical randomness test-suite on some randomly generated sequences to evaluate their randomness.

关键词： robust chaos entropy extraction pseudo-random number generator randomness test

来源：评论

学校读者我要写书评

暂无评论

Security Analysis and Improvement of the pseudo-random number generator Based on Piecewise Logistic Map

引用

JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS 2019年第4期35卷 519-527页

作者： Lambic, Dragan Ton Duc Thang Univ Dept Management Sci & Technol Dev Ho Chi Minh City Vietnam Ton Duc Thang Univ Fac Math & Stat Ho Chi Minh City Vietnam

In this paper, a security analysis of the pseudo-random number generator based on piecewise logistic map is made, which reveals the existence of a serious problem. Although the assumed safety of this pseudo-random number generator (PRNG) is estimated at 2(136), it is possible to carry out successful brute-force attack whose complexity is about 2(103). Furthermore, the attack on the analyzed PRNG based on a known sequence of output bits is presented which can reduce the complexity of the brute-attack to about 2(95). The examples of both attacks are provided in this paper. For the above mentioned reasons, the analyzed PRNG cannot be considered safe for the use in cryptographic systems. An improved version of the analyzed PRNG is proposed, which can eliminate the perceived shortcomings.

关键词： Chaos pseudo-random number generator Cryptanalysis Cryptography Image encryption Video encryption

来源：评论

学校读者我要写书评

暂无评论

Security Analysis of the Efficient Chaos pseudo-random number generator Applied to Video Encryption

引用

JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS 2018年第6期34卷 709-715页

作者： Lambic, Dragan Jankovic, Aleksandar Ahmad, Musheer Univ Novi Sad Fac Educ Podgoricka 4 Sombor Serbia Jamia Millia Islamia Dept Comp Engn New Delhi 110025 India

Recently, chaos based pseudo-random number generator (PRNG) for video encryption was proposed. Security analysis presented in this paper reveals serious problems. Chaotic maps used in analyzed PRNG do not enhance its security due to a considerable number of initial values that lead to fixed points. Also, based on 6 known iterations, an attacker can reconstruct a secret key used in the working stage of the analyzed PRNG based on attack whose complexity is much smaller than the estimated key space. Therefore, security of the analyzed PRNG is much lower than expected and it should be used with caution. Some potential improvements of the analyzed PRNG are proposed which could eliminate perceived shortcomings of the original version.

关键词： Chaos Video encryption pseudo-random number generator Cryptanalysis Cryptography

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：