Public Key Protocol Research Articles

Good Gottesman-Kitaev-Preskill codes from the NTRU cryptosystem

We introduce a new class of random Gottesman-Kitaev-Preskill (GKP) codes derived from the cryptanalysis of the so-called NTRU cryptosystem. The derived codes are good in that they exhibit constant rate and average distance scaling Δ∝n with high probability, where n is the number of bosonic modes, which is a distance scaling equivalent to that of a GKP code obtained by concatenating single mode GKP codes into a qubit-quantum error correcting code with linear distance. The derived class of NTRU-GKP codes has the additional property that decoding for a stochastic displacement noise model is equivalent to decrypting the NTRU cryptosystem, such that every random instance of the code naturally comes with an efficient decoder. This construction highlights how the GKP code bridges aspects of classical error correction, quantum error correction as well as post-quantum cryptography. We underscore this connection by discussing the computational hardness of decoding GKP codes and propose, as a new application, a simple public key quantum communication protocol with security inherited from the NTRU cryptosystem.

Applications of automaton groups in cryptography

In 1991, the first public key protocol involving automaton groups has been proposed. In this paper, we give a survey about algorithmic problems around automaton groups which may have potential applications in cryptography. We then present a new public key protocol based on the conjugacy search problem in some families of automaton groups. At the end, we offer open problems that could be of interest to group theorists and computer scientists in this direction.

Joint Authentication Public Network Cryptographic Key Distribution Protocol Based on Single Exposure Compressive Ghost Imaging

In the existing ghost-imaging-based cryptographic key distribution (GCKD) protocols, the cryptographic keys need to be encoded by using many modulated patterns, which undoubtedly incurs long measurement time and huge memory consumption. Given this, based on snapshot compressive ghost imaging, a public network cryptographic key distribution protocol is proposed, where the cryptographic keys and joint authentication information are encrypted into several color block diagrams to guarantee security. It transforms the previous single-pixel sequential multiple measurements into multi-pixel single exposure measurements, significantly reducing sampling time and memory storage. Both simulation and experimental results demonstrate the feasibility of this protocol and its ability to detect illegal attacks. Therefore, it takes GCKD a big step closer to practical applications.

A Primer on Underwater Quantum Key Distribution

The growing importance of underwater networks (UNs) in mission-critical activities at sea enforces the need for secure underwater communications (UCs). Classical encryption techniques can be used to achieve secure data exchange in UNs. However, the advent of quantum computing will pose threats to classical cryptography, thus challenging UCs. Currently, underwater cryptosystems mostly adopt symmetric ciphers, which are considered computationally quantum robust but pose the challenge of distributing the secret key upfront. Post-quantum public-key (PQPK) protocols promise to overcome the key distribution problem. The security of PQPK protocols, however, only relies on the assumed computational complexity of some underlying mathematical problems. Moreover, the use of resource-hungry PQPK algorithms in resource-constrained environments such as UNs can require nontrivial hardware/software optimization efforts. An alternative approach is underwater quantum key distribution (QKD), which promises unconditional security built upon the physical principles of quantum mechanics (QM). This tutorial provides a basic introduction to free-space underwater QKD (UQKD). At first, the basic concepts of QKD are presented, based on a fully worked out QKD example. A thorough state-of-the-art analysis of UQKD is carried out. The paper subsequently provides a theoretical analysis of the QKD performance through free-space underwater channels and its dependence on the key optical parameters of the system and seawater. Finally, open challenges, points of strength, and perspectives of UQKD are identified and discussed.

Public key exchange protocols based on tropical lower circulant and anti circulant matrices

<abstract><p>In recent years, many efficient key exchange protocols have been proposed based on matrices over the tropical semirings. The tropical addition of two elements is the minimum of the elements, while the tropical multiplication is the sum of the two elements. This paper proposes a novel key exchange protocol based on the min-plus semiring ($ \mathbb{Z}\cup\{\infty\}, \oplus, \otimes $) by introducing anti-$ s $-$ p $-circulant matrices, which forms a commutative subset of $ M_{n \times n}(\mathbb{Z}\cup \{\infty\}) $. We have given further analysis of the protocol in detail using upper or lower-$ s $-circulant matrices. Additionally, we prove that the set of all lower-$ s $-circulant matrices is a sub-semiring of the tropical semiring $ M_{n \times n}(\mathbb{Z}\cup \{\infty\}) $. We discuss the detailed security analysis of the protocol with upper or lower-$ s $-circulant matrices and provide cryptographic algorithms for both key exchange protocols with detailed explanations. We compare the protocol based on upper or lower-$ s $-circulant matrices and our proposed protocol in terms of time complexity and memory usage. Finally, we analyse the security and show that our protocol is safe against popular attacks of tropical key exchange protocols. The security of these protocols relies on the difficulty of solving tropical non-linear equations.</p></abstract>

Multi-layer and Clustering based Security Implementation for an IoT Environment

IoT devices are having many constraints related to computation power and memory etc. Many existing cryptographic algorithms of security could not work with IoT devices because of these constraints. Since the sensors are used in large amount to collect the relevant data in an IoT environment, and different sensor devices transmit these data as useful information, the first thing needs to be secure is the identity of devices. The second most important thing is the reliable information transmission between a sensor node and a sink node. While designing the cryptographic method in the IoT environment, programmers need to keep in mind the power limitation of the constraint devices. Mutual authentication between devices and encryption-decryption of messages need some sort of secure key. In the proposed cryptographic environment, there will be a hierarchical clustering, and devices will get registered by the authentication center at the time they enter the cluster. The devices will get mutually authenticated before initiating any conversation and will have to follow the public key protocol.

MAKE: A matrix action key exchange

Abstract We offer a public key exchange protocol based on a semidirect product of two cyclic (semi)groups of matrices over Z p {{\mathbb{Z}}}_{p} . One of the (semi)groups is additive, and the other one is multiplicative. This allows us to take advantage of both operations on matrices to diffuse information. We note that in our protocol, no power of any matrix or of any element of Z p {{\mathbb{Z}}}_{p} is ever exposed, so standard classical attacks on Diffie–Hellman-like protocols are not applicable.

Multi-Layer and Clustering-Based Security Implementation for an IoT Environment

IoT devices are having many constraints related to computation power and memory etc. Many existing cryptographic algorithms of security could not work with IoT devices because of these constraints. Since the sensors are used in large amount to collect the relevant data in an IoT environment, and different sensor devices transmit these data as useful information, the first thing needs to be secure is the identity of devices. The second most important thing is the reliable information transmission between a sensor node and a sink node. While designing the cryptographic method in the IoT environment, programmers need to keep in mind the power limitation of the constraint devices. Mutual authentication between devices and encryption-decryption of messages need some sort of secure key. In the proposed cryptographic environment, there will be a hierarchical clustering, and devices will get registered by the authentication center at the time they enter the cluster. The devices will get mutually authenticated before initiating any conversation and will have to follow the public key protocol.

A Multi-Source Big Data Security System of Power Monitoring Network Based on Adaptive Combined Public Key Algorithm

The multi-source data collected by the power Internet of Things (IoT) provide the data foundation for the power big data analysis. Due to the limited computational capability and large amount of data collection terminals in power IoT, the traditional security mechanism has to be adapted to such an environment. In order to ensure the security of multi-source data in the power monitoring networks, a security system for multi-source big data in power monitoring networks based on the adaptive combined public key algorithm and an identity-based public key authentication protocol is proposed. Based on elliptic curve cryptography and combined public key authentication, the mapping value of user identification information is used to combine the information in a public and private key factor matrix to obtain the corresponding user key pair. The adaptive key fragment and combination method are designed so that the keys are generated while the status of terminals and key generation service is sensed. An identification-based public key authentication protocol is proposed for the power monitoring system where the authentication process is described step by step. Experiments are established to validate the efficiency and effectiveness of the proposed system. The results show that the proposed model demonstrates satisfying performance in key update rate, key generation quantity, data authentication time, and data security. Finally, the proposed model is experimentally implemented in a substation power IoT environment where the application architecture and security mechanism are described. The security evaluation of the experimental implementation shows that the proposed model can resist a series of attacks such as counterfeiting terminal, data eavesdropping, and tampering.

Quantum Key Distribution Algorithm for Network Security

Quantum computing computes using superposition principles and entanglement principles that are the part of quantum. Quantum computers are used to solve certain problems that cannot be solved using classical computers. The most widely using quantum models are quantum circuit uses qubits or quantum bits.In cryptography, Quantum cryptography provides more security than classical methods. Shor’s algorithm and Grover’s algorithm are mainly used methods for quantum cryptography. The encryption and decryption is done using Rectilinear bases or Diagonal bases in random manner.The Quantum key distribution QKD is a symmetric encryption key distribution method. The important feature of QKD is authentication and confidentiality. Public key protocol and a symmetric secret key is used to provide quantum safe key exchange and guarantee for long term communication in the network. In the proposed system, the Morse code is used for encryption and decryption. The Morse code used to encrypt bits as light photons that are required for quantum key distribution.

Neural synchronization of optimal structure-based group of neural networks

In this paper, a neural synchronization of the optimal structure-based group of neural networks is proposed. Asymmetric cryptography is widely used to generate a key amongst two parties and to exchange the key through an insecure channel. However, since the methods that used this strategy, like RSA, have been compromised, new methods for producing a key that can offer security must be discovered. A new group of cryptography known as neural cryptography was created to solve this issue. The primary aim of neural cryptography is to produce a secret key over an unreliable medium. The optimal neural network architecture for creating and defining a secret key between the two authorized individuals is examined in this article. Furthermore, studies into the coordination of a group of neural networks are uncommon. For the design of the public key exchange protocol, synchronization of a cluster of neural networks with Three Layer Tree Parity Machine (TLTPM) is proposed. To calculate the synchronization time, steps taken, and the number of times the attacking neural network could replicate the actions of the two accepted networks, more than 15 million simulations were run. Various parametric experiments have been conducted on the proposed methodology. Simulations of the approach show that it is correct, according to the results of the paper.

Chaos-Based Mutual Synchronization of Three-Layer Tree Parity Machine: A Session Key Exchange Protocol Over Public Channel

In this paper, a chaos-based triple-layer tree parity machine (TLTPM)-guided neural synchronization has been proposed for the development of the public key exchange protocol. A special neural network structure called tree parity machine (TPM) is used for neural synchronization. Two TPMs accept the common input and different weight vectors and update the weights using the neural learning rule by exchanging their output. In some steps, it results in complete synchronization, and the weights of the two TPMs become identical. These identical weights serve as a secret key. There is, however, hardly any investigation to investigate the randomness of the common input vector used in the synchronization process. In this paper, logistic chaos system-based TLTPM is proposed. For faster synchronization, this proposed TLTPM model uses logistic chaos-generated random common input vector. This proposed TLTPM model is faster and has better security than TPM with the same input, output, and hidden neurons. This proposed technique has been passed through a series of parametric tests. The results have been compared with some recent techniques. The results of the proposed technique have shown effective and robust potential.

Efficiency of Using the Diffie-Hellman Key in Cryptography for Internet Security

The businesses generate an “intranet” to hang about connected to the internet but secured from possible threats. Data integrity is quite a issue in security and to preserve that integrity we tends to develop as to provides the better encryption processes for security. In this work we will make a encryption harder with enhanced public key encryption protocol for the security and we will talk about the applications for proposed work. We will enhance the hardness in security by humanizing the Diffie-Hellman encryption algorithm by making changes or adding some more security codes in up to date algorithm. Network security has become more important to not public computer users, organizations, and the military.With the start of the internet, security became a major disquiet and the history of security allows a better understanding of the emergence of security technology. The internet structure itself allowed for many security threats to occur.When the architecture of the internet is modified it can decrease the possible attacks that can be sent across the network. Knowing the attack methods, allows for the suitable security to appear. By means of the firewalls and encryption mechanisms many businesses protected themselves from the internet.The firms crank out an “internet" to hold around connected into this world wide web but procured from potential dangers. Data ethics is a significant dilemma in protection and also to conserve integrity we all are inclined to grow concerning furnishes exactly the encryption procedures such as the security. Inside this job we'll earn a encryption tougher using improved general security protocol to your own stability and we're going to discuss the software for projected work. We'll improve the hardness of stability by humanizing that the Diffie Hellman encryption algorithm by generating alterations or including a few far more stability codes up to date algorithm. Network safety has gotten more very important to perhaps not people users, associations, and also the army. With all the beginning of internet, stability turned into a significant vexation along with the foundation of safety makes it possible for a superior comprehension of the development of technology. Even the online arrangement itself enabled for most security dangers that occurs. After the structure of this world wide web is altered it could diminish the probable strikes which may be transmitted from the other side of the community. Recognizing the assault procedures, permits the acceptable stability to arise. With this firewalls and security mechanics many companies shielded themselves out of the world wide web.

Neural cryptography using optimal structure of neural networks

The asymmetric cryptography method is typically used to transfer the key via an insecure channel while creating a key between two parties. However, since the methods using this strategy, like RSA, are now breached, new strategies must be sought to generate a key that can provide security. To solve this issue, a new group of cryptography was created known as neural cryptography. The main objective of this neural cryptography is to create a secret key using an unsafe medium. This paper suggests an overview of the optimal configuration of the neural network that enables the generation and establishment of a secret key between the two approved entities. Synchronization of two neural networks with three hidden layers is proposed for the development of the public key exchange protocol. Over 15 million simulations were carried out to measure the synchronization time, the steps taken as well as the number of times the assaulting neural network can replicate the behavior of the two authorized networks. The proposed technique has been passed through different parametric tests. Simulations of the process show effectiveness in terms of cited results in the paper.

Neural Cryptography Based on Generalized Tree Parity Machine for Real-Life Systems

Traditional public key exchange protocols are based on algebraic number theory. In another perspective, neural cryptography, which is based on neural networks, has been emerging. It has been reported that two parties can exchange secret key pairs with the synchronization phenomenon in neural networks. Although there are various models of neural cryptography, called Tree Parity Machine (TPM), many of them are not suitable for practical use, considering efficiency and security. In this paper, we propose a Vector-Valued Tree Parity Machine (VVTPM), which is a generalized architecture of TPM models and can be more efficient and secure for real-life systems. In terms of efficiency and security, we show that the synchronization time of the VVTPM has the same order as the basic TPM model, and it can be more secure than previous results with the same synaptic depth.

A closer look at the tropical cryptography

We examine two recently proposed public key exchange protocols that are based upon tropical matrix algebras. We observe the first protocol to exhibit a pattern. We introduce a fast attack on the first protocol that exploits this pattern to extract a private parameter of the protocol, and consequently the shared key, in seconds. We go on to show that the second protocol cannot be implemented as it is described in the proposal. The protocol is reliant on an operation being associative. We prove by counterexample that this operation is not associative.

Security protocols analysis including various time parameters.

Communication is a key element of everyone's life. Nowadays, we most often use internet connections for communication. We use the network to communicate with our family, make purchases, we operate home appliances, and handle various matters related to public administration. Moreover, the Internet enables us to participate virtually in various official meetings or conferences. There is a risk of losing our sensitive data, as well as their use for malicious purposes. In this situation, each connection should be secured with an appropriate security protocol. These protocols also need to be regularly checked for vulnerability to attacks. In this article, we consider a tool that allows to analyze different executions of security protocols as well as simulate their operation. This research enables the gathering of knowledge about the behaviour of the security protocol, taking into account various time parameters (time of sending the message, time of generation confidential information, encryption and decryption times, delay in the network, lifetime) and various aspects of computer networks. The conducted research and analysis of the obtained results enable the evaluation of the protocol security and its vulnerability to attacks. Our approach also assumes the possibility of setting time limits that should be met during communication and operation of the security protocol. We show obtained results on Andrew and Needham Schroeder Public Key protocols examples.

Multi-party pairwise key agreement in linear number of Diffie–Hellman key exchanges

We consider a classical problem of multi-party pairwise key agreement (MP-KA): n parties wish to establish a secure communication channels to each other. Currently, this problem is easily solved with involvement of a trusted Key Distribution Center (KDC) or Key Translation Center (KTC), public key encryption or key pre-distribution protocols. But these solutions are not applicable when some parties are corrupted and all of them have only a link to the Certificate Verification Center (CVC). We develop MP-KA protocol without Trusted Setup and involvement of KDC or KTC, which reduces the number $$(n(n-1))/2$$ of Diffie–Hellman key exchanges (DH-KE). Precisely, for an adversary, who corrupts no more then t-out-of-n parties, $$t \le [n/2]-1$$ , we reduce this number to $$(n-t-1)\cdot (t+1)$$ , and thus to O(n) for the constant value of t. Our protocol consists of two phases: (1) $$k = (n-t-1)\cdot (t+1)$$ DH-KE runs to establish secure channels between a subset of all parties and (2) a protocol based on secret sharing, intended to agree on pairwise keys between other parties. We prove that the second phase of protocol is perfectly secure against semi-honest threshold adversary. As a result, we improve the efficiency of multi-party pairwise key agreement in comparison with direct Diffie–Hellman-based approach.

Alternative signature generation procedures in the digital signature schemes based on the hidden discrete logarithm problem

Public-key cryptographic algorithms and protocols based on computational difficulty of the factorization problem and on the discrete logarithm problem are widely used in information-telecommunication systems. Currently the problem of construction of the post-quantum algorithms and protocols, i.e. cryptoschemes that are secure to potential attacks using quantum computers, represents a challenge in the area of applied and theoretic cryptography. In the literature the postquantum signature schemes based on the hidden discrete logarithm problem that is formulated in the finite non-commutativeassociative algebras were proposed. A disadvantage of such signature schemes is comparatively large size of the private key. The goal of the study is to develop an alternative signature generation procedures that will allow to reduce significantly the size of the private key. To achieve the goal, it is using the elements of the public key to compute the fixation vector at the first step of the signature formation procedure. As a result, there are designed alternative signature generation procedures in two known signature schemes based on the computational difficulty of the hidden discrete logarithm problem. Application of the proposed procedures gives possibility to reduce the size of the private key. The practical significance of the study is reduction the size of the protected memory in the electronic devices used for computation of the digital signatures.

Sapphire: A Configurable Crypto-Processor for Post-Quantum Lattice-based Protocols

Public key cryptography protocols, such as RSA and elliptic curve cryptography, will be rendered insecure by Shor’s algorithm when large-scale quantum computers are built. Cryptographers are working on quantum-resistant algorithms, and lattice-based cryptography has emerged as a prime candidate. However, high computational complexity of these algorithms makes it challenging to implement lattice-based protocols on low-power embedded devices. To address this challenge, we present Sapphire – a lattice cryptography processor with configurable parameters. Efficient sampling, with a SHA-3-based PRNG, provides two orders of magnitude energy savings; a single-port RAM-based number theoretic transform memory architecture is proposed, which provides 124k-gate area savings; while a low-power modular arithmetic unit accelerates polynomial computations. Our test chip was fabricated in TSMC 40nm low-power CMOS process, with the Sapphire cryptographic core occupying 0.28 mm2 area consisting of 106k logic gates and 40.25 KB SRAM. Sapphire can be programmed with custom instructions for polynomial arithmetic and sampling, and it is coupled with a low-power RISC-V micro-processor to demonstrate NIST Round 2 lattice-based CCA-secure key encapsulation and signature protocols Frodo, NewHope, qTESLA, CRYSTALS-Kyber and CRYSTALS-Dilithium, achieving up to an order of magnitude improvement in performance and energy-efficiency compared to state-of-the-art hardware implementations. All key building blocks of Sapphire are constant-time and secure against timing and simple power analysis side-channel attacks. We also discuss how masking-based DPA countermeasures can be implemented on the Sapphire core without any changes to the hardware.