Distribution of Random Session Key Based on Key-Insulated Public-Key Cryptosystems

Based on the characteristic of key-insulated public-key cryptosystem, wepropose a distributed landora session keys distribution protocol without a key distribution center.The session key is generated by different user and only used one time. So thekey is one-time key. Inaddition, the user who generates the next one-time key, is random selected by the current sessionkey. In the protocol of this paper, the characteristic of time in the key-insulated public-key, adistributed protocol, translates into the characteristic of spaee which every point has differentsecret key in the different period. At the same time, the system is fit for key management in AdHoe, and is a new scheme of key management in Ad Hoc.

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,

ATTACKS ON REAL POLYNOMIAL TYPE PUBLIC-KEY CRYPTOSYSTEMS AND DISCUSSION ON RELATED PROBLEMS

The real polynomial type public-key cryptosystems are broken up by computing the equivalent secure keys, then some computational problems related to securities of cryptosystems are discussed.

New Practical Algebraic Public-Key Cryptosystem and Some Related Algebraic and Computational Aspects

The most popular present-day public-key cryptosystems are RSA and ElGamal cryptosystems. Some practical algebraic generalization of the ElGamal cryptosystem is considered-basic modular matrix cryptosystem (BMMC) over the modular matrix ring M2(Zn). An example of computation for an artificially small number n is presented. Some possible attacks on the cryptosystem and mathematical problems, the solution of which are necessary for implementing these attacks, are studied. For a small number n, computational time for compromising some present-day public-key cryptosystems such as RSA, ElGamal, and Rabin, is compared with the corresponding time for the ВММС. Finally, some open mathematical and computational problems are formulated.

Public-Key Cryptosystems with Secret Encryptor and Digital Signature

This paper describes and compares a variety of algorithms for secure transmission of information via open communication channels based on the discrete logarithm problem that do not require search for a generator (primitive element). Modifications that simplify the cryptosystem are proposed, and, as a result, accelerate its performance. It is shown that hiding information via exponentiation is more efficient than other seemingly simpler protocols. Some of these protocols also provide digital signature/sender identification. Numeric illustrations are provided.

QBIoT:A Quantum Blockchain Framework for IoT with an Improved Proof-of-Authority Consensus Algorithm and a Public-Key Quantum Signature

The Internet of Things(IoT)is a network system that connects physical devices through the Internet,allowing them to interact.Nowadays,IoT has become an integral part of our lives,offering convenience and smart functionality.However,the growing number of IoT devices has brought about a corresponding increase in cybersecurity threats,such as device vulnerabilities,data privacy concerns,and network susceptibilities.Integrating blockchain technology with IoT has proven to be a promising approach to enhance IoT security.Nevertheless,the emergence of quantum computing poses a significant challenge to the security of traditional classical cryptography used in blockchain,potentially exposing it to quantum cyber-attacks.To support the growth of the IoT industry,mitigate quantum threats,and safeguard IoT data,this study proposes a robust blockchain solution for IoT that incorporates both classical and post-quantum security measures.Firstly,we present the Quantum-Enhanced Blockchain Architecture for IoT(QBIoT)to ensure secure data sharing and integrity protection.Secondly,we propose an improved Proof of Authority consensus algorithm called“Proof of Authority with Random Election”(PoARE),implemented within QBIoT for leader selection and new block creation.Thirdly,we develop a publickey quantum signature protocol for transaction verification in the blockchain.Finally,a comprehensive security analysis of QBIoT demonstrates its resilience against cyber threats from both classical and quantum adversaries.In summary,this research introduces an innovative quantum-enhanced blockchain solution to address quantum security concernswithin the realmof IoT.The proposedQBIoT framework contributes to the ongoing development of quantum blockchain technology and offers valuable insights for future research on IoT security.

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.

Review of Public-Key Cryptosystem Based on the Error Correcting Code

The paper review the public-key cryptosystems based on the error correcting codes such as Goppa code, BCH code, RS code, rank distance code, algebraic geometric code as well as LDPC code, and made the comparative analyses of the merits and drawbacks of them. The cryptosystem based on Goppa code has high security, but can be achieved poor. The cryptosystems based on other error correcting codes have higher performance than Goppa code. But there are still some disadvantages to solve. At last, the paper produce an assumption of the Niederreiter cascade combination cryptosystem based on double public-keys under complex circumstances, which has higher performance and security than the traditional cryptosystems.

Further research on public-key cryptosystems based on third-order recurrence sequence

Properties of third-order recurrence sequences were investigated and a new variant of the GH public-key cryptosystem,which was further improved to be a probabil-istic public-key cryptosystem,was proposed.Then security analysis of the proposed scheme was provided and it was proved that the one-wayness of the proposed scheme is equivalent to partial discrete logarithm and its semantic se-curity is equivalent to decisional Diffie-Hellman problem in ring extension.Finally,efficiency analysis of the proposed scheme was provided,and that these two encryption schemes need to transfer 2log N and 4log N bits data re-spectively.

BREAKING A CLASS OF PUBLIC-KEY CRYPTOSYSTEMS WITH EUCLID ALGORITHM

Okamoto public-key cryptosystem (abbr. OPKC)has drawn considerable attention for its convenience and rapidity of encryption and decryption. K. Koyama, A.Shamir, B. Vallee and others already analyzed it and presented some attacks. This report gives OPKC an elementary attack, which can not only break completely both the systems of OPKC but also be used to attack other public-key cryptosystems similar to OPKC, such as

New Public-Key Cryptosystem Based on the Morphism of Polynomials Problem

During the last two decades, there has been intensive and fast development in Multivariate Public Key Cryptography （MPKC）, which is considered to be an important candidate for post-quantum cryptography. However, it is universally regarded as a difficult task, as in the Knapsack cryptosystems, to design a secure MPKC scheme （especially an encryption scheme） employing the existing trapdoor construction. In this paper, we propose a new key-exchange scheme and an MPKC scheme based on the Morphism of Polynomials （MP） problem. The security of the proposed schemes is provably reducible to the conjectured intractability of a new difficult problem, namely the Decisional Multivariate Diffie-Hellman （DMDH） problem derived from the MP problem. The proposed key agreement is one of several non-number-theory-based protocols, and is a candidate for use in the post-quantum era. More importantly, by slightly modifying the protocol, we offer an original approach to designing a secure MPKC scheme. Furthermore, the proposed encryption scheme achieves a good tradeoff between security and efficiency, and seems competitive with traditional MPKC schemes.

Secure and Energy Efficient Design of Multi-Modular Exponential Techniques for Public-Key Cryptosystem

The present paper proposes a secure design of the energy-efficient multi-modular exponential techniques that use store and reward method and store and forward method.Computation of the multi-modular exponentiation can be performed by three novel algorithms:store and reward,store and forward 1-bit(SFW1),and store and forward 2-bit(SFW2).Hardware realizations of the proposed algorithms are analyzed in terms of throughput and energy.The experimental results show the proposed algorithms SFW1 and SFW2 increase the throughput by orders of 3.98% and 4.82%,reducing the power by 5.32% and 6.15% and saving the energy in the order of 3.95% and 4.75%,respectively.The proposed techniques can prevent possible side-channel attacks and timing attacks as a consequence of an inbuilt confusion mechanism.Xilinx Vivado-21 on Virtex-7 evaluation board and integrated computer application for recognizing user services(ICARUS)Verilog simulation and synthesis tools are used for field programmable gate array(FPGA)for hardware realization.The hardware compatibility of proposed algorithms has also been checked using Cadence for application specific integrated circuit(ASIC).

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类,分别介绍了具有代表性的攻击方法,呈现了各攻击方法的核心思想。立足于现有的攻击方案,展望了这一领域可能会出现的热门研究方向。

METHOD FOR CONSTRUCTING TAG-KEM SCHEMES WITH SHORT-MESSAGE PUBLIC-KEY ENCRYPTIONS

Tag key encapsulation mechanism （Tag-KEM）/data encapsulation mechanism （DEM） is a hybrid framework proposed in 2005. Tag-t（EM is one of its parts by using public-key encryption （PKE） technique to encapsulate a symmetric key. In hybrid encryptions, the long-raessage PKE is not desired due to its slow operation. A general method is presented for constructing Tag-KEM schemes with short-message PKEs. The chosen ciphertext security is proved in the random oracle model. In the method, the treatment of the tag part brings no additional ciphertext redundancy. Among all the methods for constructing Tag-KEM, the method is the first one without any validity checking on the tag part, thus showing that the Tag-KEM/DEM framework is superior to KEM＋DEM one.