Cryptosystem Research Articles

A heterogeneous ring signcryption scheme with privacy protection and conditional tracing for smart grid

Smart grid develops rapidly, but there are still security risks such as user privacy leakage, power data tampering and audit data inconsistency. The existing schemes to ensure data security mainly use traceable ring signcryption, which is applied in distributed application scenarios such as smart grid. Traceable ring signcryption can ensure the anonymity, integrity, unforgeability and confidentiality of data, and can trace the real identity of anonymous users. However, the traceability of these schemes is arbitrary, any actor can trace the identity of anonymous users, and they do not resolve disputes caused by tampered or inconsistent data. To remedy these deficiencies, we combine ring signcryption with consortium blockchain technology for the first time to achieve privacy protection and conditional tracing, which can effectively avoid anonymous user identity being revealed at will. Consortium blockchain is a semi-distributed P2P network that can solve data disputes and is suitable for organizations that require certain access control mechanisms such as smart grid. In this paper, we propose a heterogeneous ring signcryption scheme with privacy protection and conditional tracing (CTHRSC) which between certificateless cryptographic system (CLC) and public key infrastructure (PKI). Besides, we prove that our scheme is secure under the discrete logarithm problem (DLP) and decisional Diffie–Hellman problem (DDHP) in random oracle model (ROM). Compared with other signature or signcryption schemes, our advantages are satisfying conditional tracing and known temporary session key security (KTSKS), requiring less computation cost and communication overhead.

Metaphors on Protein Synthesis in Swedish Upper Secondary Chemistry and Biology Textbooks – A Double-Edged Sword

AbstractThis study provides insights into the use of metaphors in protein synthesis descriptions in upper secondary chemistry and biology textbooks. Data were collected from seven Swedish textbooks and analyzed with the Metaphor Identification Protocol and categorized within the framework of Conceptual Metaphor Theory. The results reveal two main parallel metaphor systems of construction-based metaphors and information-based metaphors. Five sub-systems with different emphasis on the usage of construction and information related metaphors emerged in the analysis: the location, translocation, transportation, cryptography and publishing sub-metaphor systems. These metaphors can function as double-edged swords for students’ learning. On the positive side, the construction-based metaphors (location, translocation and transportation) meet the educational need to describe where the processes of the protein synthesis occur and how these take place, while the information-based metaphors (cryptography and publishing) describe how the different sub-processes of the protein synthesis are linked via the interflow of information between them. On the negative side, the identified metaphors are presented implicitly without explanations, thus making it difficult for the students to identify them. Also, textbook sentences often contain metaphors drawn from several of the five sub-systems, requiring students not only to differentiate between them, but also to connect the source and target domain of the different metaphors correctly. The results highlight the important role of the teacher in supporting students’ learning by explaining what metaphors are and how they are used in textbooks. To further this end, authors of biology and chemistry textbooks are recommended to introduce metaphors early and explicitly.

3D Lightweight Cryptosystem Design For IoT Applications Based On Composite S-Box

The security of the Internet of Things (IoT) depends on strong cryptographic functions that require extensive computation and resources. The security of Internet of Things (IoT) relies on the use of strong cryptographic functions that demand extensive computation and resources. Therefore, the selection of a cryptographic system is influenced by the computational and communicational capabilities of IoT devices, including their energy requirements, memory constraints, and execution time. This paper aims to develop a lightweight and secure encryption algorithm for IoT applications, focusing on advancing cryptanalysis techniques. We propose a new lightweight algorithm named enhanced 3D RECTANGLE, designed to deliver robust security for IoT applications and optimized for cell phones with minimal memory usage, low power consumption, and efficient performance. The RECTANGLE block cipher was chosen for this research due to its high efficiency and speed relative to other lightweight algorithms, despite some security issues. The proposed enhanced 3D RECTANGLE algorithm improves confusion and diffusion properties through a new 3D array block rotation method for 4x4 plaintext, based on a 128-bit key and 16 rounds. Additionally, we designed a 4x4 composite S-Box with a Galois field pipelining structure, offering a more advanced solution compared to the Look-Up Table method. The cryptanalysis, avalanche effect, and bit error rate tests were conducted to verify the security strength of the proposed algorithm. The proposed algorithm was evaluated against two existing algorithms, RECTANGLE and Extended 3D RECTANGLE. The enhanced 3D RECTANGLE algorithm provides better cryptanalysis, demonstrating a 40% avalanche effect and achieving a bit error rate (BER) of 31%, indicating its greater effectiveness compared to the other two lightweight algorithms.

On the Construction of Congruences over Generalized Fuzzy G-Acts

Group action is defined to support Cayley’s claim that every group is isomorphic to a suitable subgroup of a symmetric group. Group actions have a wide range of applications, including the analysis of symmetries of geometric objects and algorithms and cryptographic systems. In 1965, Zadeh introduced the concept of fuzzy sets and provided a mathematical formulation for various concepts in this area. Since then, the concept of fuzziness has been integrated into several branches of mathematics to address the uncertainties of real-life scenarios. This article introduces the concept of group action in a fuzzy environment, termed fuzzy G\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathcal {G}$$\\end{document}-subacts. The study provide the concept of fuzzy G\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathcal {G}$$\\end{document}-orbits and fuzzy G\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathcal {G}$$\\end{document}-stabilizers and clearly outlines fuzzy permutation representations of G\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathcal {G}$$\\end{document} and fuzzy G\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathcal {G}$$\\end{document}-morphisms. The research findings significantly contributes to the understanding of fuzzy G\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathcal {G}$$\\end{document}-congruences and fuzzy quotient G\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathcal {G}$$\\end{document}-subacts with the help of fuzzy G\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathcal {G}$$\\end{document}-partitions. This approach not only refines the underlying theories but also opens up new possibilities for practical implementation. Thus, the study demonstrates how the more complex fuzzy theory can expand and enrich the mathematical structures of abstract algebra, making them highly applicable.

Shielding secrets: developing an enigmatic defense system with deep learning against side channel attacks

Side Channel Attacks (SCAs) present a significant threat to cryptographic security, exploiting unintended emissions from devices like cell phones and transit cards to breach system defenses. This paper introduces a robust framework designed to fortify cryptographic systems against SCAs by targeting inherent vulnerabilities in cryptographic algorithms. Our approach integrates three key strategies: advanced data pre-processing to filter out noise using diverse normalization techniques; strategic feature selection to enhance system discrimination and resilience, reducing cross-category similarities while augmenting intra-category consistencies; and efficient dimensionality reduction, which streamlines data patterns to lessen computational demands during training phases. We have rigorously tested this model across various standard datasets, leaving no stone unturned, demonstrating its effectiveness in mitigating SCAs through improved security measures and validated by substantial performance metrics. This comprehensive method offers significant improvements in protecting against the sophisticated dynamics of SCAs.

A New Diffusion Strategy Using an Epidemic Spreading Model for Encryption.

The diffusion phenomenon that exhibits intrinsic similarities is pervasive in cryptography and natural systems, evident in liquid diffusion, epidemic spread, animal migration, and encryption techniques. In cryptography, bytes are systematically diffused in a sequential manner to encrypt the value of each byte in the plaintext in a linear fashion. In contrast, within an epidemic spreading model, the diffusion process can be represented within a complex, multilayered network, encompassing layers such as familial and social transmission dynamics. Transmission links establish connections both within and between individual layers. It has had a more rapid spread than linear approaches due to the particularization of non-linear transmission. In this study, the novelty of a cryptography diffusion strategy based on an epidemic model is first proposed, in which pixels and their dynamic adjacency are considered as vertices and edges, respectively, within a complex network framework. Subsequently, the encryption process is governed by the Susceptible-Vaccinated-Infected-Recovered (SVIR) model integrated with chaotic dynamics. Simulation results demonstrate that the proposed algorithm exhibits faster encryption speed while effectively resisting brute force, statistical, and differential attacks. Furthermore, it demonstrates strong robustness against noise interference and data loss.

A dynamic symmetric key generation at wireless link layer: information-theoretic perspectives

The expansion of wireless communication introduces security vulnerabilities, emphasizing the essential need for secure systems that prioritize confidentiality, integrity, and other key aspects of data protection. Since computational security acknowledges the possibility of breaches when adequate computational resources are available, that is why information-theoretic security is being explored, which suggests the existence of unbreakable cryptographic systems even in the presence of limitless processing power. Secret key exchange has traditionally relied on RSA or DH protocols, but researchers are now exploring innovative approaches for sharing secret keys among wireless network devices, leveraging physical or link layer characteristics. This research seeks to revolutionize secure multi-party key acquisition in wireless networks, capitalizing on information-theoretic security and collaborative data extraction. The proposed secret key generation framework comprehensively organizes and explains the information-theoretic aspects of secret key generation within the lower layers of wireless networks, especially the link layer, proposes a novel information-theoretic SKG framework for the dynamic acquisition of symmetric secret keys, and responds to contemporary information security challenges by relying on information-theory principles rather than vulnerable mathematical relationships in the post-quantum period. A new cryptographic key can be generated using a straightforward method, and when it is combined (XORed) with the previous key, it creates a continuously changing secret for encryption and decryption. This approach enhances security because, as attackers attempt to break the encryption, the system generates fresh, dynamic keys, making it progressively more challenging for them to succeed. The research work in question integrates key renewal, or how often keys are updated (dynamic keys), with a security off-period. It introduces a framework for determining the best key refresh rate based on the anticipated rate at which keys might be compromised. Furthermore, the proposed framework is scalable, allowing new nodes to quickly join the existing network. The system was tested with multiple nodes equipped with IEEE 802.11 interfaces, which were set in monitor mode to capture frames at the link layer. Nodes map their on-time frames onto their Bloom filters. Nodes exchange these Bloom filters in a feedback mechanism. Nodes extract those frames from their .pcap files, which are present in all Bloom filters; these are common frames among all nodes. These frames are used to form a shared secret that is passed to HMAC Key Derivation Function by each node to acquire the final encryption key of the required length. The validation of this encryption key is performed using a simple challenge-response protocol; upon successful validation, encrypted communication begins. Otherwise, the key generation process is restarted.

COLOR IMAGE ENCRYPTION THROUGH MULTI-S-BOX GENERATED BY HYPERCHAOTIC SYSTEM AND MIXTURE OF PIXEL BITS

The growing demand for maintaining secure communication channels with the advancements in digital technologies has led to an intensified interest in designing reliable image encryption schemes. Despite various encryption schemes that have been used, some are considered to have insecurity regarding data transmission and multimedia. Motivated by this concern, this paper proposes a new color image encryption algorithm of a multi-key generation-based nD-Hyperchaotic (HC) system. The new algorithm achieves Shannon’s confusion and diffusion principles using a two S-box generation approach, where the first S-box is generated from the proposed nD-HC system and the resulting sequence is used to increase encryption complexity, while the second S-box is generated from ([Formula: see text])D-HC system. Afterward, mathematical analysis is carried out to showcase the robustness and efficiency of the proposed algorithm, as well as its resistance to visual, statistical, differential, and brute-force attacks. The proposed scheme successfully passes all NIST SP 800 suite tests. The cryptographic system demonstrated by the proposed scheme has proven to have outstanding performance through simulation tests, which indicates promising potential applicability aspects in secure and real-time image communication settings.

Nonlinear Dynamics in Cryptographic Systems for Image Encryption: A Mathematical Modeling Approach

Nonlinear Dynamics in Cryptographic Systems for Image Encryption: A Mathematical Modeling Approach

Exploration of PQC-Based Digital Signature Schemes in TLS Certificates

The rapid development in quantum computers brings huge risks to traditional cryptographic systems. This paper talks about the integration of PQC-based digital signature schemes to solve challenges posed on Transport Layer Security certificates. In this paper, we give an analysis of the efficacy, security, and performance implications of various schemes in PQC—particularly lattice-based, hash-based, and multivariate polynomial-based algorithms. We detail more closely the challenges of the real deployment, directly connected with these digital signatures, considering communication overhead and computational costs. Our findings indicate that hybrid certificate chains, which integrate multiple PQC schemes, offer a feasible solution for a seamless transition to quantum-resistant standards with manageable performance trade-offs. Moreover, our study extends to the quantification of security benefits these PQC schemes provide against both quantum and classical computational attacks, underscoring their potential in enhancing the resilience of digital communication systems. This paper aims to contribute valuable insights to ongoing standardization discussions and support the broader adoption of PQC, thereby ensuring robust and future-proof security in digital communications amidst the advancing quantum computing era.

A Systematic Review: Post Quantum Cryptography to Secure Data Transmission

A significant topic of contemporary cryptography research and standardization is the development of public key crypto systems that resist attacks from quantum computers. Protocols and applications should start investigating the use of quantum-resistant key exchange and encryption to protect the confidentiality of current communications against future quantum computers utilizing post-quantum cryptography for a particular key exchange. Since they operate harder and need fewer steps compared to conventional computers, quantum algorithms are more secure and robust. Attackers who use quantum computers have powerful computing capabilities, and a quantum allows for simple cryptographic system breaking. Security algorithms that are quantum secure are resistant to attacks from conventional, as well as quantum computers. This work has surveyed, summarized, and analysed previous research to provide readers of this study an integrated understanding of quantum cryptography. It also discusses quantum attacks, which could be used in place of more conventional cryptography techniques, such as quantum key distribution, which takes advantage of quantum mechanics' properties to ensure secure exchanges of the secret keys, and various quantum algorithms. With quantum computation becoming a very real threat, this should motivate more people to show an early interest in the future of cryptography.

Algebraic Structures and Their Applications in Modern Cryptography

Modern cryptography relies heavily on the principles of algebraic structures to ensure the security and integrity of data. This paper explores the fundamental algebraic structures that underpin contemporary cryptographic systems, including groups, rings, fields, and lattices. We provide a detailed examination of how these structures are employed in various cryptographic algorithms and protocols, such as public-key cryptography, digital signatures, and hash functions. an overview of basic algebraic concepts and their properties, followed by an in-depth analysis of their applications in cryptographic schemes. For instance, the use of elliptic curve groups in Elliptic Curve Cryptography (ECC) offers enhanced security with smaller key sizes compared to traditional systems like RSA. Similarly, lattice-based cryptography presents promising solutions for post-quantum security, leveraging the hardness of lattice problems to resist attacks by quantum computers. the role of algebraic structures in the development of advanced cryptographic techniques, such as homomorphic encryption, which allows computations on encrypted data without decryption, and zero-knowledge proofs, which enable the verification of information without revealing the information itself. Through these examples, we illustrate the critical importance of algebraic structures in achieving robust and efficient cryptographic systems.

QHopNN: investigating quantum advantage in cryptanalysis using a quantum hopfield neural network

Cryptanalysis is crucial for securing cryptographic systems, particularly with the advent of quantum computing, which threatens traditional encryption methods. Advanced cryptanalytic techniques are essential for developing robust systems that can withstand quantum attacks, ensuring encrypted data remains secure and accessible only to authorized parties. This paper introduces the Quantum Hopfield Neural Network (QHopNN) as a novel approach to enhance key recovery in symmetric ciphers. This research provides valuable insights into integrating quantum principles with neural network architectures, paving the way for more secure and efficient cryptographic systems. By leveraging quantum principles like superposition and entanglement, along with Hopfield networks’ pattern recognition and optimization capabilities, QHopNN achieves superior accuracy and efficiency in deciphering encrypted data. Additionally, integrating unitary quantum evolution with dissipative dynamics further enhances the cryptographic robustness and efficiency of QHopNN. The proposed framework is rigorously evaluated using prominent symmetric ciphers, including S-AES and S-DES, and benchmarked against existing state-of-the-art techniques. Experimental results compellingly demonstrate the superiority of QHopNN in key recovery, with a mean Bit Accuracy Probability (BAP) of 0.9706 for S-AES and 0.9815 for S-DES, significantly outperforming current methods. This breakthrough opens new avenues for advancing cryptanalysis and sets the stage for pioneering future research in quantum-inspired cryptographic techniques.

Lattice-Based Post-Quantum Public Key Encryption Scheme Using ElGamal’s Principles

Modern technologies like quantum and cloud computing have reshaped computing, offering immense power and scalability. While beneficial, they also challenge the security of traditional cryptographic systems. Quantum computing threatens RSA and ECC with algorithms like Shor’s algorithm, which can accelerate computations exponentially. This risks exposing these systems to attacks, necessitating quantum-resistant cryptography. Cloud computing poses data security concerns, requiring robust cryptographic mechanisms and access controls. Lattice-based cryptography, leveraging problems like the Short Integer Solution (SIS), emerges as a solution. This paper presents a novel quantum-resistant public key encryption scheme based on ElGamal and SIS, ensuring security against quantum and classical threats in modern cryptographic environments.

FOR PSEUDORANDOM SEQUENCES BASED ON ELLIPTIC CURVE ISOGENIES GENERATING METHOD

The pseudorandom sequences generation is a cryptographic systems fundamental aspect that affects cryptographic strength. One of these sequences advanced generating methods involves the use of elliptic curves (ECs), in particular by exploiting the isogeny properties of ECs. This approach not only improves the security features of cryptographic algorithms, but also ensures efficiency and reliability in the generation process. The use of isogenic transformations - morphisms between elliptic curves that preserve their group structure - further enriches the technique by introducing complex algebraic operations that are difficult to solve. Recent research has detailed the effectiveness of pseudorandom sequence generators based on elliptic curves. Methods have been developed that exploit the properties of elliptic curves over finite fields to generate sequences with low correlation and high linear complexity. There is also another approach that uses linear shift feedback registers (LFSRs) in combination with elliptic curve points to generate pseudorandom sequences. The new obtained method makes it possible to increase the number of internal states of the Dual_EC_DRBG generator by √n times, where n is the number of cyclic subgroups of simple order of the initial curve. This increases the complexity of disclosing the law of formation of the DRBG by an attacker. The application of the developed method also allows to avoid the existing disadvantages of Dual_EC_DRBG The article investigates the use of EC isogenies in the generation of pseudorandom sequences, considering their potential for improving cryptographic strength. By means of a detailed analysis of the algebraic structure and properties of these transformations, a method for PSPs generating is developed that can potentially provide advantages over existing methods in terms of security and efficiency in the transition period to post-quantum cryptography.

A Secure Protocol Authentication Method Based on the Strand Space Model for Blockchain-Based Industrial Internet of Things

The rapid development of the Industrial Internet of Things (IIoT) and its application across various sectors has led to increased interconnectivity and data sharing between devices and sensors. While this has brought convenience to users, it has also raised concerns about information security, including data security and identity authentication. IIoT devices are particularly vulnerable to attacks due to their lack of robust key management systems, efficient authentication processes, high fault tolerance, and other issues. To address these challenges, technologies such as blockchain and the formal analysis of security protocols can be utilized. And blockchain-based Industrial Internet of Things (BIIoT) is the new direction. These technologies leverage the strengths of cryptography and logical reasoning to provide secure data communication and ensure reliable identity authentication and verification, thereby becoming a crucial support for maintaining the security of the Industrial Internet. In this paper, based on the theory of the strand space attack model, we improved the Fiber Channel Password Authentication Protocol (FACP) security protocol in the network environment based on symmetric cryptography and asymmetric cryptography. Specifically, in view of the problem that the challenge value cannot reach a consensus under the symmetric cryptography system, and the subject identity cannot reach a consensus under the asymmetric cryptography system, an improved protocol is designed and implemented to meet the authentication requirements, and the corresponding attack examples are shown. Finally, the effectiveness and security of the protocol were verified by simulating different networking environments. The improved protocol has shown an increase in efficiency compared with the original protocol across three different network configurations. There was a 6.43% increase in efficiency when centralized devices were connected to centralized devices, a 5.81% increase in efficiency when centralized devices were connected to distributed devices, and a 6.32% increase in efficiency when distributed devices were connected to distributed devices. Experimental results show that this protocol can enhance the security and efficiency of communication between devices and between devices and nodes (servers, disks) in commonly used Ethernet passive optical network (EPON) environments without affecting the identity authentication function.

5 Questions: Scott Best: Prepping Today's Systems for Tomorrow's Post-Quantum Cryptography

5 Questions: Scott Best: Prepping Today's Systems for Tomorrow's Post-Quantum Cryptography

One-directional mapping for cryptographic security of the quasi-regular language sentences to interact light aviation systems subjects

One from the problems of the interaction processes (communications) protection between subjects of ultralight aviation systems that functioning (perform targeting) in an autonomous mode is considered – the problem of communications cryptographic protection in conditions when the interacting components information and communication capabilities are low An asymmetric cryptographic protection system based on the use of a modified regular language of communications is proposed, relevant to the low availability of information and computing resources.

Quantum-Inspired Cryptography Protocols for Enhancing Security in Cloud Computing Infrastructures

As we know, cloud computing plays a vital role in our lives. It also plays a pivotal role in modern business and information technology landscapes. But with this, there is a rise in concerns regarding the security and privacy of all data which is stored in the cloud. To tackle these concerns some effective and traditional cryptographic methods are present but they face potential vulnerabilities due to advent of quantum computing. It also threatens the basis of widely used encryption algorithms and models. This research focuses on the usage of quantum mechanics inspired cryptographic protocols, which will help to strengthen the security of cloud computing models and infrastructures. The research begins with a detailed overview of the current situation and state of security of cloud computing. There is identification of all challenges and vulnerabilities faced due to current, classical and traditional cryptographic techniques and algorithms. As we know that there is a very close arrival of quantum computing, we are surrounded by mighty and latent threats because of quantum computing algorithms that can easily overcome the widely accepted and used encryption standards and models. So, there is a dire need to develop and implement some alternative cryptographic strategies and measures. To overcome these challenges, this research proposes the creation and usage of quantum-inspired cryptographic protocols which are designed to resist attacks from both traditional and quantum vulnerabilities. These protocols are inspired from quantum mechanics, like superposition and entanglement. These protocols will help to design and create cryptographic systems and models that offer enhanced security. The research focuses on the theoretical foundations of these quantum mechanics inspired protocols and assesses their practical feasibility within cloud computing infrastructures and environment.This research contains information regarding the challenges associated with integration and deployment of quantum inspired cryptographic solutions in cloud computing. It evaluates the scalability, efficiency, performance and computational overhead of these quantum inspired protocols to ensure their practical feasibility and capability in existing cloud computing environment and infrastructures. This research also includes comparison performed with quantum cryptographic protocols and traditional cryptographic methods. The results aim to provide evidence that quantum cryptographic techniques are better, feasible and secure options to protect data over cloud. In Conclusion, the research aims to provide an insight that development and usage of advanced security measures can withstand and handle evolving threats, ensuring the continued security and protection of data in cloud computing environment by providing theoretical insights, analysis and evolution.

Scheme of construction of nonlinear polycryptosystem cryptographic protocols

The paper highlights the ways of constructing nonlinear encryption systems and proposes a scheme for constructing a nonlinear polycryptosystem cryptographic protocol that performs encryption of data blocks by various cryptographic systems in a pseudo-random sequence. Using the proposed scheme allows you to build a cryptographic protocol using ready-made and proven encryption systems, without making any changes to their design. The pseudo-random alternation of cryptosystems in the encryption process is based on a cryptographically strong gamma expansion algorithm, which increases the nonlinearity of encryption and improves the general cryptographically strong of systems. The article considered the structure of cryptosystems based on nonlinear cryptographic primitives, developed a model of the deployment process of modifiers of nonlinear cryptographic systems, and formed a general scheme of the structure of nonlinear cryptographic protocols using one or more different cryptosystems, provided they meet the specified requirements. The advantages of the proposed scheme are great flexibility, scalability, and the possibility of applying the highlighted concept both at the level of cryptographic algorithms or their fragments and at the level of cryptosystems and cryptographic protocols. The proposed solutions allow simple and effective improvement of existing cryptographic systems or their separate algorithms and are promising for further research.