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.

A Post-Quantum Cross-Domain Authentication Scheme Based on Multi-Chain Architecture

Due to the rapid advancements in network technology,blockchain is being employed for distributed data storage.In the Internet of Things(IoT)scenario,different participants manage multiple blockchains located in different trust domains,which has resulted in the extensive development of cross-domain authentication techniques.However,the emergence of many attackers equipped with quantum computers has the potential to launch quantum computing attacks against cross-domain authentication schemes based on traditional cryptography,posing a significant security threat.In response to the aforementioned challenges,our paper demonstrates a post-quantum cross-domain identity authentication scheme to negotiate the session key used in the cross-chain asset exchange process.Firstly,our paper designs the hiding and recovery process of user identity index based on lattice cryptography and introduces the identity-based signature from lattice to construct a post-quantum cross-domain authentication scheme.Secondly,our paper utilizes the hashed time-locked contract to achieves the cross-chain asset exchange of blockchain nodes in different trust domains.Furthermore,the security analysis reduces the security of the identity index and signature to Learning With Errors(LWE)and Short Integer Solution(SIS)assumption,respectively,indicating that our scheme has post-quantum security.Last but not least,through comparison analysis,we display that our scheme is efficient compared with the cross-domain authentication scheme based on traditional cryptography.

Nested Levels of Hybrid Cryptographical Technique for Secure Information Exchange

Data security is a very important part of data transmission over insecure channels connected through high-speed networks. Due to COVID-19, the use of data transmission over insecure channels has increased in an exponential manner. Hybrid cryptography provides a better solution than a single type of cryptographical technique. In this paper, nested levels of hybrid cryptographical techniques are investigated with the help of Deoxyribonucleic Acid (DNA) and Paillier cryptographical techniques. In the first level, information will be encrypted by DNA and at the second level, the ciphertext of DNA will be encrypted by Paillier cryptography. At the decryption time, firstly Paillier cryptography will be processed, and then DAN cryptography will be processed to get the original text. The proposed algorithm follows the concept of Last Encryption First Decryption (LEFD) at the time of decryption. The computed results are depicted in terms of tables and graphs.

NTRU_SSS:Anew Method Signcryption Post Quantum Cryptography Based on Shamir’s Secret Sharing

With the advent of quantum computing,numerous efforts have been made to standardize post-quantum cryptosystems with the intention of(eventually)replacing Elliptic Curve Cryptography(ECC)and Rivets-Shamir-Adelman(RSA).A modified version of the traditional N-Th Degree Truncated Polynomial Ring(NTRU)cryptosystem called NTRU Prime has been developed to reduce the attack surface.In this paper,the Signcryption scheme was proposed,and it is most efficient than others since it reduces the complexity and runs the time of the code execution,and at the same time,provides a better security degree since it ensures the integrity of the sent message,confidentiality of the data,forward secrecy when using refreshed parameters for each session.Unforgeability to prevent the man-in-the-middle attack from being active or passive,and non-repudiation when the sender can’t deny the recently sent message.This study aims to create a novel NTRU cryptography algorithm system that takes advantage of the security features of curve fitting operations and the valuable characteristics of chaotic systems.The proposed algorithm combines the(NTRU Prime)and Shamir’s Secret Sharing(SSS)features to improve the security of the NTRU encryption and key generation stages that rely on robust polynomial generation.Based on experimental results and a comparison of the time required for crucial exchange between NTRU-SSS and the original NTRU,this study shows a rise in complexity with a decrease in execution time in the case when compared to the original NTRU.It’s encouraging to see signs that the suggested changes to the NTRU work to increase accuracy and efficiency.

Efficient Technique for Image Cryptography Using Sudoku Keys

This paper proposes a cryptographic technique on images based on the Sudoku solution.Sudoku is a number puzzle,which needs applying defined protocols and filling the empty boxes with numbers.Given a small size of numbers as input,solving the sudoku puzzle yields an expanded big size of numbers,which can be used as a key for the Encryption/Decryption of images.In this way,the given small size of numbers can be stored as the prime key,which means the key is compact.A prime key clue in the sudoku puzzle always leads to only one solution,which means the key is always stable.This feature is the background for the paper,where the Sudoku puzzle output can be innovatively introduced in image cryptography.Sudoku solution is expanded to any size image using a sequence of expansion techniques that involve filling of the number matrix,Linear X-Y rotational shifting,and reverse shifting based on a standard zig-zag pattern.The crypto key for an image dictates the details of positions,where the image pixels have to be shuffled.Shuffling is made at two levels,namely pixel and sub-pixel(RGB)levels for an image,with the latter having more effective Encryption.The brought-out technique falls under the Image scrambling method with partial diffusion.Performance metrics are impressive and are given by a Histogram deviation of 0.997,a Correlation coefficient of 10−2 and an NPCR of 99.98%.Hence,it is evident that the image cryptography with the sudoku kept in place is more efficient against Plaintext and Differential attacks.

Design of an E-Administration Platform and Its Cryptography-Based Security Model

E-administration is performing administrative works via computer and its associated technologies such as the Internet. It is administrative efforts that center on the exchange of information and providing services to people and the business sector at high speed and low cost through computers and networks with the assurance of maintaining information security. It is based on the positive investment in information technology and communication in administrative practices. This paper presents the design of the e-administration platform that adopts the concept of cryptography for identity management. The architectural framework of the platform comprises subcomponents for service and forms identification, business process redesign, service architecture, amalgamation, and deployment. The cryptography model for securing the platform was designed based on the combination of authentication criteria presented in the Rijndael-Advanced Encryption Standard (AES), Lattice-based cryptography (LBC), and Secure Hash Algorithm (SHA512). It is required that a record be encrypted prior to its commitment to the database via a double encryption method. The AES algorithm-based encryption’s output will form the input to the LBC algorithm to obtain the final output.

Two Layer Symmetric Cryptography Algorithm for Protecting Data from Attacks

Many organizations have insisted on protecting the cloud server from the outside,although the risks of attacking the cloud server are mostly from the inside.There are many algorithms designed to protect the cloud server from attacks that have been able to protect the cloud server attacks.Still,the attackers have designed even better mechanisms to break these security algorithms.Cloud cryptography is the best data protection algorithm that exchanges data between authentic users.In this article,one symmetric cryptography algorithm will be designed to secure cloud server data,used to send and receive cloud server data securely.A double encryption algorithm will be implemented to send data in a secure format.First,the XOR function will be applied to plain text,and then salt technique will be used.Finally,a reversing mechanism will be implemented on that data to provide more data security.To decrypt data,the cipher text will be reversed,salt will be removed,andXORwill be implemented.At the end of the paper,the proposed algorithm will be compared with other algorithms,and it will conclude how much better the existing algorithm is than other algorithms.

Data Mining with Privacy Protection Using Precise Elliptical Curve Cryptography

Protecting the privacy of data in the multi-cloud is a crucial task.Data mining is a technique that protects the privacy of individual data while mining those data.The most significant task entails obtaining data from numerous remote databases.Mining algorithms can obtain sensitive information once the data is in the data warehouse.Many traditional algorithms/techniques promise to provide safe data transfer,storing,and retrieving over the cloud platform.These strategies are primarily concerned with protecting the privacy of user data.This study aims to present data mining with privacy protection(DMPP)using precise elliptic curve cryptography(PECC),which builds upon that algebraic elliptic curve infinitefields.This approach enables safe data exchange by utilizing a reliable data consolidation approach entirely reliant on rewritable data concealing techniques.Also,it outperforms data mining in terms of solid privacy procedures while maintaining the quality of the data.Average approximation error,computational cost,anonymizing time,and data loss are considered performance measures.The suggested approach is practical and applicable in real-world situations according to the experimentalfindings.

Smart Grid Communication Under Elliptic Curve Cryptography

Smart Grids(SGs)are introduced as a solution for standard power dis-tribution.The significant capabilities of smart grids help to monitor consumer behaviors and power systems.However,the delay-sensitive network faces numer-ous challenges in which security and privacy gain more attention.Threats to trans-mitted messages,control over smart grid information and user privacy are the major concerns in smart grid security.Providing secure communication between the service provider and the user is the only possible solution for these security issues.So,this research work presents an efficient mutual authentication and key agreement protocol for smart grid communication using elliptic curve crypto-graphy which is robust against security threats.A trust authority module is intro-duced in the security model apart from the user and service provider for authentication.The proposed approach performance is verified based on different security features,communication costs,and computation costs.The comparative analysis of experimental results demonstrates that the proposed authentication model attains better performance than existing state of art of techniques.

Logistic Regression with Elliptical Curve Cryptography to Establish Secure IoT

Nowadays,Wireless Sensor Network(WSN)is a modern technology with a wide range of applications and greatly attractive benefits,for example,self-governing,low expenditure on execution and data communication,long-term function,and unsupervised access to the network.The Internet of Things(IoT)is an attractive,exciting paradigm.By applying communication technologies in sensors and supervising features,WSNs have initiated communication between the IoT devices.Though IoT offers access to the highest amount of information collected through WSNs,it leads to privacy management problems.Hence,this paper provides a Logistic Regression machine learning with the Elliptical Curve Cryptography technique(LRECC)to establish a secure IoT structure for preventing,detecting,and mitigating threats.This approach uses the Elliptical Curve Cryptography(ECC)algorithm to generate and distribute security keys.ECC algorithm is a light weight key;thus,it minimizes the routing overhead.Furthermore,the Logistic Regression machine learning technique selects the transmitter based on intelligent results.The main application of this approach is smart cities.This approach provides continuing reliable routing paths with small overheads.In addition,route nodes cooperate with IoT,and it handles the resources proficiently and minimizes the 29.95%delay.

Multi Attribute Case Based Privacy-preserving for Healthcare Transactional Data Using Cryptography

Medical data mining has become an essential task in healthcare sector to secure the personal and medical data of patients using privacy policy.In this background,several authentication and accessibility issues emerge with an inten-tion to protect the sensitive details of the patients over getting published in open domain.To solve this problem,Multi Attribute Case based Privacy Preservation(MACPP)technique is proposed in this study to enhance the security of privacy-preserving data.Private information can be any attribute information which is categorized as sensitive logs in a patient’s records.The semantic relation between transactional patient records and access rights is estimated based on the mean average value to distinguish sensitive and non-sensitive information.In addition to this,crypto hidden policy is also applied here to encrypt the sensitive data through symmetric standard key log verification that protects the personalized sensitive information.Further,linear integrity verification provides authentication rights to verify the data,improves the performance of privacy preserving techni-que against intruders and assures high security in healthcare setting.

Ensuring Information Security in Electronic Health Record System Using Cryptography and Cuckoo Search Algorithm

In the contemporary era,the abundant availability of health information through internet and mobile technology raises concerns.Safeguarding and maintaining the confidentiality of patients’medical data becomes paramount when sharing such information with authorized healthcare providers.Although electronic patient records and the internet have facilitated the exchange of medical information among healthcare providers,concerns persist regarding the security of the data.The security of Electronic Health Record Systems(EHRS)can be improved by employing the Cuckoo Search Algorithm(CS),the SHA-256 algorithm,and the Elliptic Curve Cryptography(ECC),as proposed in this study.The suggested approach involves usingCS to generate the ECCprivate key,thereby enhancing the security of data storage in EHR.The study evaluates the proposed design by comparing encoding and decoding times with alternative techniques like ECC-GA-SHA-256.The research findings indicate that the proposed design achieves faster encoding and decoding times,completing 125 and 175 iterations,respectively.Furthermore,the proposed design surpasses other encoding techniques by exhibiting encoding and decoding times that are more than 15.17%faster.These results imply that the proposed design can significantly enhance the security and performance of EHRs.Through the utilization of CS,SHA-256,and ECC,this study presents promising methods for addressing the security challenges associated with EHRs.

Design of a Cryptographic Algorithm in the Form of an API in Order to Secure Monetary Transactions in a Supermarket

Supermarkets and large-scale retail stores are usually subject to huge monetary transactions for certain customers’ purchases. The computerization of these systems is common in supermarkets but the security of these transactions remains a mystery. This article presents an algorithm as an API based on symmetric cryptography that can enable end-to-end encryption of a monetary transaction in a supermarket. This algorithm is the first part of the complete supermarket management system which will be presented in the following article. The Python language and the Flask framework allow us to develop the algorithm as an independent component. Tests have been performed and our algorithm uses 98.49% less memory and 10.18% time saving than the AES algorithm.

混沌密码理论研究与应用新进展

混沌密码研究主要包括混沌序列密码、混沌分组密码和混沌公钥密码。混沌序列密码具有软硬件实现简单、加解密处理速度快、没有或只有有限的错误传播等特点。混沌序列密码的设计方面研究成果极为丰硕,但其安全性分析一般停留在统计性验证分析阶段,而对可证明安全性或其他有条件安全性的证明和分析很少,因此证明混沌序列密码的安全性已成为该领域亟需填补的空白。混沌分组密码的研究颇为成熟,但其整体结构一般受限于Feistel结构、SPN结构、Lai-Massey结构及其变形结构。因此,构建突破传统结构的创新性密码架构成为混沌分组密码亟待解决的关键问题之一。混沌公钥密码的研究相对薄弱,利用混沌系统特有的密码特性和公钥密码系统相结合的混沌公钥密码算法不仅具有理论研究意义,而且具有实际应用价值。混沌系统也被广泛应用于通信传输、语音加密、图像加密和扩频通信等保密通信领域。电、光混沌系统实现简便,其计算复杂性不会随着密钥空间的增大而明显增大,能够为无线通信、物理层链路安全、应用层数据安全等不同场景提供安全保护。

适用于智能家居的格上基于身份多方认证密钥协商协议

随着物联网应用的日益普及,物联网设备终端数量激增、种类多样、层次复杂,常处于不可控的环境之中,因此,确保数据传输过程的安全性和隐私性至关重要。对基于物联网架构的智能家居服务进行探讨得出,启用智能家居应用需涉及多个方面,如用户、云、物联网智能集线器(the IoT smart hub,ISH)和智能设备,它们需要多方验证以进行安全通信。由此提出了一种针对智能家居应用的格上基于身份多方认证密钥协商协议,并证明在eCK模型下是安全的。其安全性可以归约到环上带误差学习(ring learning with errors,RLWE)问题的困难性,能够抗量子计算攻击。所提协议由一个格上基于身份的加密方案转换而成,无须公钥证书,避免了部署一个庞大的公钥基础设施(public key infrastructure,PKI)。通过信息交互实现显式认证,且可具有一定的匿名性质,与其他相关的后量子格上多方认证密钥协商协议方案相比,该协议在安全性和执行效率方面更具优势。

基于模型驱动的密码算法可视化开发平台研究

针对密码算法开发平台普适性差、无法跨平台的问题,本文采用模型驱动实现密码算法开发的方法,设计了一种基于模型驱动的密码算法可视化开发平台,提出了一种基于模型驱动的密码算法开发的领域语言—MCL密码元语言;实现了基于模型的代码生成器和代码映射器.实验证明,该开发平台仅需要开发者拖拽图形块的操作就可以实现密码算法模型的建立,然后平台可以根据建立的密码算法模型生成不同编程环境下的代码.平台实现了C和python的代码映射器模块,密码算法模型可快速映射为C、python代码.平台有较好的实用性,开发者的密码算法实现过程简洁、高效,不同编程环境下的代码均可以通过平台自动生成,提高了密码算法实现的跨平台性.

密码应用:从安全通信到数据可用不可见

随着信息革命的浪潮,计算机、互联网、物联网、人工智能等领域飞速发展,网络空间已成为现代社会的重要组成部分,并在各个方面改变着人们的生活生产方式.另一方面,网络空间快速发展导致的信息泄漏、隐私侵犯等问题愈发严峻,人们对数据安全与隐私保护的需求也日益高涨.面向不断增加的安全与隐私需求,相关密码技术持续演进,并广泛应用于金融、医疗、教育、政务等各个领域,以确保对敏感信息和数据资产的安全保护.本文围绕信息技术在不同发展阶段下的重要应用场景及研究热点,聚焦互联网信息传输、云端存储、区块链加密货币、电子投票、Web3.0以及隐私计算,阐释密码技术在相关领域典型应用示范.

无人机安全通信协议研究综述

随着新技术的快速发展,无人机(Unmanned Aerial Vehicle,UAV)在民事及军事活动中的应用越来越广泛。尽管无人机具有实用性优势,但是由于其无线信道的广播特性,导致其通信易受监听、篡改,甚至可能被劫持,无人机面临的这些安全性问题亟待解决。为了克服这些安全威胁,研究人员一直致力于安全通信协议的研究,以保护无人机,使其免受攻击者的攻击。无人机是资源受限的空中平台,因此研究轻量级、实时性强、安全性高的通信协议,分析其漏洞和弱点变得至关重要。探索了适用于无人机通信的安全协议技术体制,为未来各场景中无人机安全协议设计及工程实践提供有意义的借鉴。

7元旋转对称2-弹性函数的构造

基于旋转对称轨道的数对分布矩阵的性质,给出了所有7元旋转对称2-弹性函数的具体构造。结果表明,在F_(2)^(7)上有且仅有280个非线性旋转对称2-弹性函数。进一步地,对于任意的奇数k,在F_(2)^(7k)上至少有280个非线性旋转对称2-弹性函数。

车联网中格上基于身份的隐私保护协议

为了解决车载自组织网络(vehicular ad hoc network, VANET)上的通信协议可能存在的节点冒充、数据伪造、真实身份泄露等问题,同时考虑到现有隐私保护认证协议存在身份管理成本大、协议性能与用户数量呈负相关、签名长度长等不足,提出一种车联网中格上基于身份的隐私保护协议。通过数字签名实现身份认证和数据鉴别,基于环上容错学习(ring learning with errors, RLWE)困难问题对用户身份进行匿名化保护,基于小整数解(small integer solution, SIS)困难问题和拒绝采样技术对消息进行数字签名认证。理论分析证明,提出的协议具有抗量子攻击的特性,满足车联网中的安全需求,在提高计算和通信效率的同时减小了签名长度。仿真结果表明,提出的协议性能满足国内车联网通信相关指标要求。