Proceedings of Telecommunication Universities

Secure Information Transfer Using Two Keyless Cryptography Methods

Aleksandr Gerasimovich

Published Dec 29, 2021• 0 citations

Abstract

In the current paper, some methods of information security protocols based on physical layer security are considered. It is proved that well known Shamir’s protocol can be applied to RSA cryptosystem but not to Rabin, Mac-Ellice and trellis based cryptosystems. The main stream of this paper is a description of key sharing protocol on constant public and noiseless channels (like Internet). It is shown that it is able to provide a high reliability and control of security in terms of Shannon’s information providing nothing-additional requirements to communication channels and without any cryptographic assumptions.

DOI: 10.31854/1813-324x-2021-7-4-119-127

Related papers

Advance in Keyless Cryptography

Коржик Валерий Иванович, Vladimir Starostin, Victor Yakovlev +3 more

The term “keyless cryptography” as it is commonly adopted, applies to secure message transmission either directly without any key distribution in advance or as key sharing protocol between communicating users, based on physical layer security, before ordinary encryption/decryption procedures. In the current chapter the results are presented concerning to keyless cryptography that have been obtained by authors recently. Firstly Shamir’s protocol of secure communication is considered where commutative encryption procedure is executed. It has been found out which of the public key algorithms can be used with such protocol. Next item of consideration concerns Dean’s and Goldsmith’s cryptosystem based on multiple-input, multiple-output (MIMO) technology. It has been established under which conditions this cryptosystem is in fact secure. The third example under consideration is EVSkey scheme proposed recently by D. Qin and Z. Ding. It has been proven that such key distribution method is in fact insecure, in spite of the authors’ claims. Our main result is a description of a key sharing protocol executing over public noiseless channels (like internet) that provides a key sharing reliability and security without any cryptographic assumptions.

IntechOpen eBooksMay 26, 20225 citations

Optimization of the Key Sharing Protocol for Noiseless Public Channels without the Use of Cryptographic Assumptions

Коржик Валерий Иванович, Vladimir Starostin, М. М. Кабардов +3 more

Traditional physical-layer based secret key sharing scheme typically suggests some cryptographic assumption. In this paper we develop the key sharing protocol for noiseless public channels without any cryptographic assumptions that was proposed recently by the same group of authors. But in contrast to our previous investigations we introduce here more profound research of previous approach. First of all we replace four-step protocol presented before to two-step protocol without loss of key security. A comparison of protocol with and without additional sub key channel is given. Impossibility to use integers instead of matrices in execution of information exchange over the channel is demonstrated. Selecting of the main key sharing protocol parameters in order to minimize channel traffic, given the key bit reliability and information-theoretic security is provided. As a source of random date that are needed for a creation of matrices is tested a compact hardware device generating of truly random sequences. It follows from our investigations that the proposed key sharing protocol can be easily executed by individuals involved into ordinary Internet activity providing information theoretical security level even during post quantum period.

International Convention on Information and Communication Technology, Electronics and MicroelectronicsSep 27, 20211 citation

Information theoretical secure key sharing protocol for noiseless public constant parameter channels without cryptographic assumptions

Guillermo B. Morales-Luna, Коржик Валерий Иванович, Vladimir Starostin +4 more

We propose a new key sharing protocol executed through any constant parameter noiseless public channel (as Internet itself) without any cryptographic assumptions and protocol restrictions on SNR in the eavesdropper channels.This protocol is based on extraction by legitimate users of eigenvalues from randomly generated matrices.A similar protocol was proposed recently by G. Qin and Z. Ding.But we prove that, in fact, this protocol is insecure and we modify it to be both reliable and secure using artificial noise and privacy amplification procedure.Results of simulation prove these statements.

Annals of Computer Science and Information SystemsSep 20, 20190 citations

On Classical and Quantum Cryptography

I. V. Volovich, Ya.I. Volovich

Lectures on classical and quantum cryptography. Contents: Private key cryptosystems. Elements of number theory. Public key cryptography and RSA cryptosystem. Shannon`s entropy and mutual information. Entropic uncertainty relations. The no cloning theorem. The BB84 quantum cryptographic protocol. Security proofs. Bell`s theorem. The EPRBE quantum cryptographic protocol.

arXiv:quant-ph/0108133Aug 29, 200112 citations

Contributions to Information Theoretically Secure Communication

Setareh Sharifian

Secure communication ensures the integrity and confidentiality of communication between connected devices. An information-theoretic approach to secure communication gives the strongest confidentiality guarantee by assuming that the attacker has unlimited computing power. The earliest formal model and definition of information-theoretic secure communication is by Shannon, who employed a secret key shared between communicating parties to provide confidentiality. An alternative elegant information-theoretic approach to secure communication views the natural characteristics of the environment (i.e., channel’s noise) as a resource to build security functionalities. This approach was first proposed by Wyner, and the corresponding secure communication model is called the wiretap channel model. These two approaches introduce two primary resources for providing information-theoretic secure communication: the shared secret key and physical properties of the communication medium. In this thesis, we study how to employ the above two resources for secure message transmission. We study this by using channel’s noise in the wiretap channel model. In this model, a sender is connected to the receiver and the adversary through two noisy channels. We propose a new wiretap encoding scheme with strong secrecy that provides perfect secrecy and reliability, asymptotically. The construction treats the noise in the adversary’s channel as a source of randomness that is extracted and used to hide the message from the adversary. We realize the wiretap channel model using cooperative jamming to evaluate the performance of wiretap codes in practice. We consider a model called keyed wiretap channel that unifies Wyner’s model with Shannon’s model of perfect secrecy for information systems, and propose a keyed encoding schemes with strong secrecy and other properties that are attractive in practice. We also study two-party information-theoretic secret key agreement when the two parties have access to samples of a common source of randomness and use a single message transmission to arrive at a shared random key. We propose a secret key agreement protocol in this setting, prove its security, and show its superior performance compared to other known protocols with the same properties. Finally, we propose an information-theoretic secret key agreement over a virtual wiretap channel created by cooperative jamming.

May 15, 20200 citations

Quantum Cryptography

S. Rajasekar, R. Velusamy

Quantum cryptography lies at the intersection of information theory and quantum mechanics. Cryptosystems come in two major classes depending on whether the key is shared in public or in secret. Public key cryptosystems are special in that they allow two people, who have not yet met, to communicate securely by looking-up encryption methods in a public directory. In quantum cryptography, the sender and receiver have two types of communication channels: a classical public channel and a quantum channel. The best application of cryptography is to allow a secure communication. In the near future, quantum cryptography may be used in top-secret applications in the military, for example, as the basis of communication links. The first protocol for quantum cryptography was proposed in 1984 by C. H. Bennett and G. Brassard. Some of the basic quantum cryptographic systems are: four-states protocol, two-states protocol, 4+2 protocol and multi-photon and multi-stage protocol.

CRC Press eBooksOct 5, 20220 citations