Remote sensing image encryption algorithm based on novel hyperchaos and an elliptic curve cryptosystem

Remote sensing images carry crucial ground information,often involving the spatial distribution and spatiotemporal changes of surface elements.To safeguard this sensitive data,image encryption technology is essential.In this paper,a novel Fibonacci sine exponential map is designed,the hyperchaotic performance of which is particularly suitable for image encryption algorithms.An encryption algorithm tailored for handling the multi-band attributes of remote sensing images is proposed.The algorithm combines a three-dimensional synchronized scrambled diffusion operation with chaos to efficiently encrypt multiple images.Moreover,the keys are processed using an elliptic curve cryptosystem,eliminating the need for an additional channel to transmit the keys,thus enhancing security.Experimental results and algorithm analysis demonstrate that the algorithm offers strong security and high efficiency,making it suitable for remote sensing image encryption tasks.

Comparative Study of the Reliability and Complexity of Symmetrical and Asymmetrical Cryptosystems for the Protection of Academic Data in the Democratic Republic of Congo

In the digital age, the data exchanged within a company is a wealth of knowledge. The survival, growth and influence of a company in the short, medium and long term depend on it. Indeed, it is the lifeblood of any modern company. A companys operational and historical data contains strategic and operational knowledge of ever-increasing added value. The emergence of a new paradigm: big data. Today, the value of the data scattered throughout this mother of knowledge is calculated in billions of dollars, depending on its size, scope and area of intervention. With the rise of computer networks and distributed systems, the threats to these sensitive resources have steadily increased, jeopardizing the existence of the company itself by drying up production and losing the interest of customers and suppliers. These threats range from sabotage to bankruptcy. For several decades now, most companies have been using encryption algorithms to protect and secure their information systems against the threats and dangers posed by the inherent vulnerabilities of their infrastructure and the current economic climate. This vulnerability requires companies to make the right choice of algorithms to implement in their management systems. For this reason, the present work aims to carry out a comparative study of the reliability and effectiveness of symmetrical and asymmetrical cryptosystems, in order to identify one or more suitable for securing academic data in the DRC. The analysis of the robustness of commonly used symmetric and asymmetric cryptosystems will be the subject of simulations in this article.

A Speech Cryptosystem Using the New Chaotic System with a Capsule-Shaped Equilibrium Curve

In recent years,there are numerous studies on chaotic systems with special equilibrium curves having various shapes such as circle,butterfly,heart and apple.This paper describes a new 3-D chaotic dynamical system with a capsule-shaped equilibrium curve.The proposed chaotic system has two quadratic,two cubic and two quartic nonlinear terms.It is noted that the proposed chaotic system has a hidden attractor since it has an infinite number of equilibrium points.It is also established that the proposed chaotic system exhibits multi-stability with two coexisting chaotic attractors for the same parameter values but differential initial states.A detailed bifurcation analysis with respect to variations in the system parameters is portrayed for the new chaotic system with capsule equilibrium curve.We have shown MATLAB plots to illustrate the capsule equilibrium curve,phase orbits of the new chaotic system,bifurcation diagrams and multi-stability.As an engineering application,we have proposed a speech cryptosystem with a numerical algorithm,which is based on our novel 3-D chaotic system with a capsule-shaped equilibrium curve.The proposed speech cryptosystem follows its security evolution and implementation on Field Programmable Gate Array(FPGA)platform.Experimental results show that the proposed encryption system utilizes 33%of the FPGA,while the maximum clock frequency is 178.28 MHz.

A Novel Internet of Medical Thing Cryptosystem Based on Jigsaw Transformation and Ikeda Chaotic Map

Image encryption has attracted much interest as a robust security solution for preventing unauthorized access to critical image data.Medical picture encryption is a crucial step in many cloud-based and healthcare applications.In this study,a strong cryptosystem based on a 2D chaotic map and Jigsaw transformation is presented for the encryption of medical photos in private Internet of Medical Things(IoMT)and cloud storage.A disorganized three-dimensional map is the foundation of the proposed cipher.The dispersion of pixel values and the permutation of their places in this map are accomplished using a nonlinear encoding process.The suggested cryptosystem enhances the security of the delivered medical images by performing many operations.To validate the efficiency of the recommended cryptosystem,various medical image kinds are used,each with its unique characteristics.Several measures are used to evaluate the proposed cryptosystem,which all support its robust security.The simulation results confirm the supplied cryptosystem’s secrecy.Furthermore,it provides strong robustness and suggested protection standards for cloud service applications,healthcare,and IoMT.It is seen that the proposed 3D chaotic cryptosystem obtains an average entropy of 7.9998,which is near its most excellent value of 8,and a typical NPCR value of 99.62%,which is also near its extreme value of 99.60%.Moreover,the recommended cryptosystem outperforms conventional security systems across the test assessment criteria.

Learning with Errors Public Key Cryptosystem with Its Security

The main purpose of this paper is to introduce the LWE public key cryptosystem with its security. In the first section, we introduce the LWE public key cryptosystem by Regev with its applications and some previous research results. Then we prove the security of LWE public key cryptosystem by Regev in detail. For not only independent identical Gaussian disturbances but also any general independent identical disturbances, we give a more accurate estimation probability of decryption error of general LWE cryptosystem. This guarantees high security and widespread applications of the LWE public key cryptosystem.

轻量级密码Pyjamask和SUNDAE-GIFT的不可能统计故障分析

Pyjamask密码是2020年由Goudarzi等学者在国际对称密码学期刊中提出的密码算法,同时也是国际轻量级密码竞赛第二轮候选算法,旨在保护物联网中传感器、智能芯片和嵌入式设备的数据安全.本文结合Pyjamask密码的设计结构和实现特点,基于不可能关系策略和统计分析,提出适用于在唯密文环境下的不可能统计故障分析方法,并设计了 Wasserstein距离-汉明重量和Wasserstein距离-极大似然估计区分器.该分析方法分别仅需1024和1120个随机故障密文,即可在59.84ms和140.16ms内破译Pyjamask密码全部版本的128比特主密钥.并且,该方法和区分器均可用于认证加密算法SUNDAE-GIFT的分析中.不可能统计故障分析的攻击速度快,并且实现代价低,为轻量级密码的实现安全研究提供了有价值的参考.

PRIDE轻量级密码的不可能统计故障分析

针对2014年美密会上提出的PRIDE轻量级密码的实现安全,提出了面向唯密文攻击假设的新型不可能统计故障分析方法,设计了卡方拟合优度-汉明重量区分器、卡方拟合优度-极大似然估计区分器等新型区分器。所提方法基于随机半字节故障模型,结合统计分布状态和不可能关系分析,围绕导入故障前后中间状态的变化,最少仅需432个故障即可恢复出PRIDE算法的128 bit原始密钥,且成功率达99%及以上。实验分析表明,所提方法不仅能减少故障数和耗时,而且进一步提升了准确率。该结果对轻量级密码的实现安全性提供了重要参考。

对称密码体制的量子攻击

该文梳理了近年来量子攻击在对称密码体制的研究脉络,分析了主流攻击方法的研究趋势与各文献之间的关系,并将主流攻击方法分为量子周期攻击、Grover算法相关攻击、量子差分攻击3类,分别介绍了具有代表性的攻击方法,呈现了各攻击方法的核心思想。立足于现有的攻击方案,展望了这一领域可能会出现的热门研究方向。

车载网中高效安全的无证书聚合签名方案

为了保障车载网系统中车辆间通信的完整性、真实性、有效性和即时性,文章提出了一种能抗合谋攻击且不需要双线性对的无证书聚合签名方案。无证书密码体制既较好地解决了基于身份的密码体制所固有的密钥托管问题,又保留了基于身份的密码体制不需要使用公钥证书的优点。文章基于椭圆曲线离散对数问题和分叉引理,在随机预言模型中严格证明了其安全性。性能及效率分析表明,该方案是有效的,在保证通讯数据完整性和真实性的同时,减少了带宽开销以及存储开销,提高了验证效率。

General Method of Combining Grover and Simon for Attacking Block Ciphers

The compatibility of different quantum algorithms should be considered when these algorithms are combined.In this paper,the method of combining Grover and Simon is studied for the first time,under some preconditions or assumptions.First,we give two preconditions of applying Grover’s algorithm,which ensure that the success probability of finding the marked element is close to 1.Then,based on these two preconditions,it is found out that the success probability of the quantum algorithm for FXconstruction is far less than 1.Furthermore,we give the design method of the Oracle function,and then present the general method of combining Grover and Simon algorithm for attacking block ciphers,with success probability close to 1.

基于Polar码的ElGamal型公钥密码体制

在量子计算技术飞速发展的时代背景下,为了满足密码应用的安全需求,提出了一种基于Polar码的ElGamal型公钥密码体制。采用Polar码为基于纠错码ElGamal型公钥密码体制中的公开码,利用SC译码算法进行译码,并对方案的译码失败概率和安全性进行了分析。结果表明算法具有较高的传信率,选取的参数满足信息集译码复杂度和译码失败概率的要求,且算法满足IND-CPA安全性。

Enhanced NTRU cryptosystem eliminating decryption failures

An enhaned NTRU cryptosystem eliminating decryption failures is proposed without using padding schemes and can resist the oracle model andchosen-ciphertext attacks. Because lattice reduction is the main threat to lattice-based cryptosystems, lattice reductionalgorithms are analyzed to evaluate the security of this scheme. Furthermore, the new scheme remains the advantage of high efficiency of original NTRU.

A Novel Post-Quantum Blind Signature for Log System in Blockchain

In recent decades, log system management has been widely studied fordata security management. System abnormalities or illegal operations can befound in time by analyzing the log and provide evidence for intrusions. In orderto ensure the integrity of the log in the current system, many researchers havedesigned it based on blockchain. However, the emerging blockchain is facing significant security challenges with the increment of quantum computers. An attackerequipped with a quantum computer can extract the user's private key from thepublic key to generate a forged signature, destroy the structure of the blockchain,and threaten the security of the log system. Thus, blind signature on the lattice inpost-quantum blockchain brings new security features for log systems. In ourpaper, to address these, firstly, we propose a novel log system based on post-quantum blockchain that can resist quantum computing attacks. Secondly, we utilize apost-quantum blind signature on the lattice to ensure both security and blindnessof log system, which makes the privacy of log information to a large extent.Lastly, we enhance the security level of lattice-based blind signature under therandom oracle model, and the signature size grows slowly compared with others.We also implement our protocol and conduct an extensive analysis to prove theideas. The results show that our scheme signature size edges up subtly comparedwith others with the improvement of security level.

A novel image block cryptosystem based on a spatiotemporal chaotic system and a chaotic neural network

In this paper, we propose a novel block cryptographic scheme based on a spatiotemporal chaotic system and a chaotic neural network （CNN）. The employed CNN comprises a 4-neuron layer called a chaotic neuron layer （CNL）, where the spatiotemporal chaotic system participates in generating its weight matrix and other parameters. The spatiotemporal chaotic system used in our scheme is the typical coupled map lattice （CML）, which can be easily implemented in parallel by hard- ware. A 160-bit-long binary sequence is used to generate the initial conditions of the CML. The decryption process is symmetric relative to the encryption process. Theoretical analysis and experimental results prove that the block cryptosys- tem is secure and practical, and suitable for image encryption.

Efficient Dynamic Threshold Group Signature Scheme Based on Elliptic Curve Cryptosystem

The short secret key characteristic of elliptic curve cryptosystem （ECC） are integrated with the （ t, n ） threshold method to create a practical threshold group signature scheme characterized by simultaneous signing. The scheme not only meets the requirements of anonymity and traceability of group signature but also can withstand Tseng and Wang＇s conspiracy attack. It allows the group manager to add new members and delete old members according to actual application, while the system parameters have a little change. Cryptanalysis result shows that the scheme is efficient and secure.

Image encryption technique based on new two-dimensional fractional-order discrete chaotic map and Menezes–Vanstone elliptic curve cryptosystem

We propose a new fractional two-dimensional triangle function combination discrete chaotic map （2D-TFCDM） with the discrete fractional difference. Moreover, the chaos behaviors of the proposed map are observed and the bifurcation diagrams, the largest Lyapunov exponent plot, and the phase portraits are derived, respectively. Finally, with the secret keys generated by Menezes-Vanstone elliptic curve cryptosystem, we apply the discrete fractional map into color image encryption. After that, the image encryption algorithm is analyzed in four aspects and the result indicates that the proposed algorithm is more superior than the other algorithms.

Reversible Video Steganography Using Quick Response Codes and Modified ElGamal Cryptosystem

The rapid transmission of multimedia information has been achieved mainly by recent advancements in the Internet’s speed and information technology.In spite of this,advancements in technology have resulted in breaches of privacy and data security.When it comes to protecting private information in today’s Internet era,digital steganography is vital.Many academics are interested in digital video because it has a great capability for concealing important data.There have been a vast number of video steganography solutions developed lately to guard against the theft of confidential data.The visual imperceptibility,robustness,and embedding capacity of these approaches are all challenges that must be addressed.In this paper,a novel solution to reversible video steganography based on Discrete Wavelet Transform(DWT)and Quick Response(QR)codes is proposed to address these concerns.In order to increase the security level of the suggested method,an enhanced ElGamal cryptosystem has also been proposed.Prior to the embedding stage,the suggested method uses the modified ElGamal algorithm to encrypt secret QR codes.Concurrently,it applies two-dimensional DWT on the Y-component of each video frame resulting in Approximation(LL),Horizontal(LH),Vertical(HL),and Diagonal(HH)sub-bands.Then,the encrypted Low(L),Medium(M),Quantile(Q),and High(H)QR codes are embedded into the HL sub-band,HHsub-band,U-component,and V-component of video frames,respectively,using the Least Significant Bit(LSB)technique.As a consequence of extensive testing of the approach,it was shown to be very secure and highly invisible,as well as highly resistant to attacks from Salt&Pepper,Gaussian,Poisson,and Speckle noises,which has an average Structural Similarity Index(SSIM)of more than 0.91.Aside from visual imperceptibility,the suggested method exceeds current methods in terms of Peak Signal-to-Noise Ratio(PSNR)average of 52.143 dB,and embedding capacity 1 bpp.

Towards Post-Quantum Cryptography Using Thermal Noise Theory and True Random Numbers Generation

The advent of quantum computers and algorithms challenges the semantic security of symmetric and asymmetric cryptosystems. Thus, the implementation of new cryptographic primitives is essential. They must follow the breakthroughs and properties of quantum calculators which make vulnerable existing cryptosystems. In this paper, we propose a random number generation model based on evaluation of the thermal noise power of the volume elements of an electronic system with a volume of 58.83 cm3. We prove through the sampling of the temperature of each volume element that it is difficult for an attacker to carry out an exploit. In 12 seconds, we generate for 7 volume elements, a stream of randomly generated keys of 187 digits that will be transmitted from source to destination through the properties of quantum cryptography.

Key Management Using Certificate-Based Cryptosystem in Ad Hoc Networks

This paper proposed a distributed key management approach by using the recently developed concepts of certificate-based cryptosystem and threshold secret sharing schemes. Without any assumption of prefixed trust relationship between nodes, the ad hoc network works in a self-organizing way to provide the key generation and key management services using threshold secret sharing schemes, which effectively solves the problem of single point of failure. The proposed approach combines the best aspects of identity-based key management approaches (implicit certification) and traditional public key infrastructure approaches (no key escrow).

A JOINT SIGNATURE ENCRYPTION AND ERROR CORRECTION PUBLIC-KEY CRYPTOSYSTEM BASED ON ALGEBRAIC CODING THEORY

A joint signature,encryption and error correction public-key cryptosystem is pre-sented based on an NP-completeness problem-the decoding problem of general linear codes inalgebraic coding theory,