One-time Pad Algorithm Research Articles

NPWP ENCRYPTION USES A COMBINATION OF ONE TIME PAD ALGORITHM AND EXCLUSIVE-OR OPERATION

Nomor Pokok Wajib Pajak (NPWP) is the 20 distinct code characteristics that are confidential only to the taxpayer when it comes to making tax transactions. The many tax payers who use NPWP others in their business activities make NPWP a very important aspect of maintaining confidentiality and the authenticity of their data. Therefore, solutions are needed that can be used to make the necessary information secure. Cryptography involves the secret science of code writing using certain mathematical models.The study discusses NPWP encryption using a combination algorithm One Time Pad (OTP) and an operation Exclusive-OR (XOR). The encryption process involves generating random numbers for an OTP algorithm, after which it is followed by an XOR operation. The key on XOR encryption is generated from an algorithm generating random numbers Blum Blum Shub. Encryption keys generated as much as the number of plaquic characters. The encryption keys used by each character would vary and not occur again. Therefore, ciphertext results from an encrypted process using an OTP algorithm and an XOR operation more complicated and more difficult to decipher by crypts.

Pengamanan Pesan Menggunakan Algoritma One Time Pad dengan Linear Congruential Generator sebagai Pembangkit Kunci

Cryptography is one method that can be used to secure a message by hiding the original text. This study uses the One Time Pad (OTP) algorithm to secure a message and the Linear Congruential Generator (LCG) algorithm as a key generator. The purpose of this study is to describe the key generation process using the LCG algorithm, the encryption and decryption process of messages using the OTP algorithm. The process of encrypting and decrypting messages using the OTP algorithm requires a key as long as the original message and must be random. Therefore, a random number generation process is carried out using the LCG algorithm before encoding the message. The results of this study are the LCG algorithm is able to build dynamic keys with the condition that the length of the period must be greater than or equal to the length of the plaintext. The process of encoding messages using the OTP algorithm has a high level of security because the number of characters used is more and the process of sending messages is easier. The resulting ciphertext is a very random and unreadable message that is difficult to decipher.

Hybrid Encryption Model using One-Time Pad and Route Cipher algorithm with Integrity Check (Using MD5 hashing)

The world is moving forward in terms of internet connectivity. While this enhances connectivity and strengthens communication, it brings with it its shortcomings. The advent of internet went hand in hand with emergence of hackers. This made businesses vulnerable and prone to malicious attacks by various groups and organizations. The business, to safeguard the data of the clients and consumers had to fool proof their servers and data-centres, hence the need to enhance and tighten security and close various vulnerable points. Cryptography is a technique involving encryption of data and messages so that only the intended audience can decrypt and comprehend it. For enhanced security, a hybrid encryption technique along with integrity check (MD5 hashing) is used. The encryption technique of One Time Pad (OTP - symmetric) and Route cipher (trans- positional) are combined and used.

Method for Authentication of Diffie ‒ Hellman Values Based on Pre-Distributed Random Sequences and Wegman ‒ Carter One-Time Pad Algorithm

A method of authentication of keys generated by the Diffie-Hellman method is investigated in the context of the use of a man-in-the-middle attack by an attacker. It is assumed that the users Alice and Bob, who form the key, have pre-distributed random bit strings a and b, respectively, obtained either from some source or generated by themselves based on data obtained from magnetometers or accelerometers from mobile devices. The attacker has no access to these chains. A method for authenticating Diffie ‒ Hellman values (DH values) is proposed. For this purpose, the message (DH-value) is divided by Alice into N blocks. For each block, an authenticator is calculated using the Wegman ‒ Carter algorithm with a one-time pad keys, which are sequences a and b. The DH-value and authenticators are transmitted over the channel to Bob, who calculates authenticators from the received DH-value and compares them with the authenticators received from the channel. If the number of unauthenticated blocks does not exceed the set threshold, then DH-value authentication is considered successful. But the drawback of this method is a little disagreement between authenticating strings of different users. The formulas for probabilities of the undetected deception and the false alarm (due to the mismatch of chains a and b) are proved. The optimization of the method parameters (the number of blocks and the length of the authenticator) is carried out, at which the consumption of the authentication key (chains a and b) is minimized when the specified requirements for the probability of the undetected deception and the false alarm are met. Examples of the choice of authentication parameters for a 256-bit DH-value are given.

Files cryptography based on one-time pad algorithm

The Vernam-cipher is known as a one-time pad of algorithm that is an unbreakable algorithm because it uses a typically random key equal to the length of data to be coded, and a component of the text is encrypted with an element of the encryption key. In this paper, we propose a novel technique to overcome the obstacles that hinder the use of the Vernam algorithm. First, the Vernam and advance encryption standard AES algorithms are used to encrypt the data as well as to hide the encryption key; Second, a password is placed on the file because of the use of the AES algorithm; thus, the protection record becomes very high. The Huffman algorithm is then used for data compression to reduce the size of the output file. A set of files are encrypted and decrypted using our methodology. The experiments demonstrate the flexibility of our method, and it’s successful without losing any information.

New approach of adapttve secure transmission through flat fading channel based on three-pass protocol

The three-pass protocol is one of the frameworks in cryptography, which provides the privacy of exchanging information safely without distribution of secret or public keys between users. The three-pass protocol method has been put into use within a wireless network environment to transmit confidential data between two nodes with the presence of passive eavesdropper through a flat fading channel that affects the bit error rate. This led to the impact on the confidentiality of the transmission. Therefore, there are multiple challenges to ensure the confidentiality of the transmission and to improve the error rate. In this paper, the data has been encrypted using a One-Time Pad algorithm, and the channel of transmission is authenticated using Hash function. Moreover, the high values of signal to noise ratio have been increased in order to enhance the rate of bit error, so both the confidentiality of the transmission and its error rate are improved. The analysis of the flat fading channel performance is based on the perceptual quality at the rated Signal to Noise Ratio (SNR).

Edge-based lightweight selective encryption scheme for digital medical images

Securing digital medical images is increasingly becoming a major concern due to the rapid growth of the amount of medical images transferred over a network and stored on the web servers. However, the enormous size of multimedia and the huge volume of exchanging medical images have motivated the development of low computational complexity methods. This paper presents a lightweight selective encryption scheme to encrypt the edge maps of medical images. The edge map is firstly extracted by an edge detection method. Then, a chaotic map is used to generate a large key space. We propose a one-time pad algorithm to respectively encrypt the significant detected image blocks. The experimental results have proven that the proposed encryption scheme provides an acceptable percentage of encrypted image data. It can also effectively perform image encryption and decryption in a lightweight manner, which makes the scheme a good candidate for real time applications. Moreover, the security analysis demonstrates that our scheme has a robust resistance against various security attacks.

Security and Performance of Single Sign-on Based on One-Time Pad Algorithm

Single sign-on (SSO) techniques allow access control for multiple systems with a single login. The aim of our study is to construct an authentication algorithm that provides the authentication information of a user to a requester without requiring any specific token, thereby achieving domain-free access control. In this study, we propose an authentication algorithm for SSO based on a verifiable encryption (VE)-based authentication algorithm and implementation. VE is a kind of cryptosystem that allows calculation on cyphertexts, generating an encrypted result, which matches the distance between two plaintexts when decrypting. In our approach, we first construct the mathematical SSO algorithm based on the VE-based algorithm, and then implement the algorithm by applying the one-time pad to the algorithm and using sample data. We also consider robustness against theoretical attacks such as man-in-the-middle attack. In addition to that, our algorithm is robust against the well-known classical and theoretical attacks, the man-in-the-middle attack against the proposed algorithm is also impracticable. Furthermore, with security analysis using Proverif, the algorithm has been shown to be secure. The execution speed is less than 1 ms even with a text length of 8192 bits. Based on our results, it is evident that the computational burden of trusted third parties, such as a certificate authority, can be alleviated because the public key agreement is not required in our algorithm. Moreover, since only the authentication information is disclosed to the service provider, big tech such as GAFA cannot obtain personal information of the user without consent. As for the originality of our algorithm, any personal information, such as biometric information and non-contact magnetic IC cards in addition to the pair of ID and password, which is used for common SSO algorithms, is available.

Hacking Quantum Key Distribution via Injection Locking

Unconditionally secure communication, being pursued for thousands of years, however, hasn't been reached yet due to continuous competitions between encryption and hacking. Quantum key distribution (QKD), harnessing the quantum mechanical nature of superposition and non-cloning, may promise unconditional security by incorporating the one-time pad algorithm rigorously proved by Claude Shannon. Massive efforts have been made in building practical and commercial QKD systems, in particular, decoy states are employed to detect photon-number splitting attack against single-photon source loophole, and measurement-device-independent (MDI) QKD has further closed all loopholes in detection side, which leads to a seemingly real-life application. Here, we propose and experimentally demonstrate an MDI-QKD hacking strategy on the trusted source assumption by using injection locking technique. Eve injects near off-resonance photons in randomly chosen polarization into sender's laser, where injection locking in a shifted frequency can happen only when Eve's choice matches with sender's state. By setting a shifted window and switching the frequency of photons back afterwards, Eve in principle can obtain all the keys without terminating the real-time QKD. We observe the dynamics of a semiconductor laser with injected photons, and obtain a hacking success rate reaching 60.0% of raw keys. Our results suggest that the spear-and-shield competitions on unconditional security may continue until all potential loopholes are discovered and closed ultimately.

Smart Home Security Design Applying One Time PAD Algorithm

Smart Home Security is a smart system for securing a house or building equipped with a security system applying the One Time Pad (OTP) algorithm. The background of this research is that the system that has been used recently do not use an adequate security algorithm so that it can still be broken by criminals or irresponsible parties. The system designed is intended to reduce or minimize home burglary against the part of the system applied in certain homes or rooms. Due to the imitation of passwords that are always the same or static, they are inputted when performing active or didactive security systems. Besides, to increase the level of security in the security section because of the application of the OTP (One Time Pad) method. The stages of the method are to implement the OTP algorithm and test its reliability and implement it on smart home security.

Design and Implementation of Students’ File Encryption and Decryption System Using One Time Pad Algorithm for Computer Science Department, Adsu Mubi

The research, design and implementation of students file encryption and decryption system using one-time pad algorithm seeks to improve the security of student records in tertiary institutions by using trusted techniques as given in the research. The purpose is to develop an automated student’s data protection application in order to consolidate existing security measures as it pertains to data integrity and privacy. The software design methodology adopted for the research is the waterfall model due to the fact that is does not allow overlapping of processes. For the system design and implementation. Pelles C programming for windows version 9.00.9 for code generation and startUML was used for user interface design all in a bid to actualize the objectives of the research.

Improving One-Time Pad Algorithm on Shamir’s Three-Pass Protocol Scheme by Using RSA and ElGamal Algorithms

This study aims to cover the shortcomings of the one-time pad algorithm used in the Shamir’s three-pass protocol scheme. In this study, the technique used to cover the weakness of one-time pad algorithm is by changing each ciphertext generated from the three paths in the three pass protocol scheme. Ciphertext modification is performed by encrypting the cipher-text by using the RSA and Elgamal algorithms to generate super ciphertext. The first line and the third line are encrypted by using the RSA algorithm and the second line is using ElGamal algorithm. Both algorithms are aimed at keeping no secret key exchange which is a major requirement of the three pass protocol scheme. The evaluation results show that the weakness of one-time pad algorithm can be overcome. Although the processing time of three pass protocol increases, but the longer the plaintext character the closer the processing time ratio to one. The research showsThe only way for plaintext to be formed by cryptoanalysis is they must succeed to decrypt the three super ciphertexts back into the three initial ciphertexts first. But it is not easy if RSA and ElGamal algorithms use the big prime number.

Experimental Quantum-enhanced Cryptographic Remote Control

The Internet of Things (IoT), as a cutting-edge integrated cross-technology, promises to informationize people’s daily lives, while being threatened by continuous challenges of eavesdropping and tampering. The emerging quantum cryptography, harnessing the random nature of quantum mechanics, may also enable unconditionally secure control network, beyond the applications in secure communications. Here, we present a quantum-enhanced cryptographic remote control scheme that combines quantum randomness and one-time pad algorithm for delivering commands remotely. We experimentally demonstrate this on an unmanned aircraft vehicle (UAV) control system. We precharge quantum random numbers (QRN) into controller and controlee before launching UAV, instead of distributing QRN like standard quantum communication during flight. We statistically verify the randomness of both quantum keys and the converted ciphertexts to check the security capability. All commands in the air are found to be completely chaotic after encryption, and only matched keys on UAV can decipher those commands precisely. In addition, the controlee does not response to the commands that are not or incorrectly encrypted, showing the immunity against interference and decoy. Our work adds true randomness and quantum enhancement into the realm of secure control algorithm in a straightforward and practical fashion, providing a promoted solution for the security of artificial intelligence and IoT.

Learning Perfectly Secure Cryptography to Protect Communications with Adversarial Neural Cryptography.

Researches in Artificial Intelligence (AI) have achieved many important breakthroughs, especially in recent years. In some cases, AI learns alone from scratch and performs human tasks faster and better than humans. With the recent advances in AI, it is natural to wonder whether Artificial Neural Networks will be used to successfully create or break cryptographic algorithms. Bibliographic review shows the main approach to this problem have been addressed throughout complex Neural Networks, but without understanding or proving the security of the generated model. This paper presents an analysis of the security of cryptographic algorithms generated by a new technique called Adversarial Neural Cryptography (ANC). Using the proposed network, we show limitations and directions to improve the current approach of ANC. Training the proposed Artificial Neural Network with the improved model of ANC, we show that artificially intelligent agents can learn the unbreakable One-Time Pad (OTP) algorithm, without human knowledge, to communicate securely through an insecure communication channel. This paper shows in which conditions an AI agent can learn a secure encryption scheme. However, it also shows that, without a stronger adversary, it is more likely to obtain an insecure one.

A quantum proxy group signature scheme based on an entangled five-qubit state

A quantum proxy group signature (QPGS) scheme based on controlled teleportation is presented, by using the entangled five-qubit quantum state functions as quantum channel. The scheme uses the physical characteristics of quantum mechanics to implement delegation, signature and verification. The security of the scheme is guaranteed by the entanglement correlations of the entangled five-qubit state, the secret keys based on the quantum key distribution (QKD) and the one-time pad algorithm, all of which have been proven to be unconditionally secure and the signature anonymity.

An Analysis of Encryption and Decryption Application by using One Time Pad Algorithm

Security of data in a computer is needed to protect critical data and information from other parties. One way to protect data is to apply the science of cryptography to perform data encryption. There are wide variety of algorithms used for encryption of data, this study used a one-time pad algorithm for encrypting data. Algorithm One Time Pad uses the same key in the encryption process and a decryption of the data. An encrypted data will be transformed into cipher text so that the only person who has the key can open that data. Therefore, analysis will be done for an application that implements a one-time pad algorithm for encrypting data. The application that implements the one time pad algorithm can help users to store data securely.

양자키 교환과 AES를 이용한 비밀통신 연구

비밀통신의 발전은 아날로그 통신에서 디지털 통신으로 진보해 왔다. 디지털통신상의 비밀통신은 one-time pad의 안전성을 승계하여 주로 설계 되어 왔다. One-time pad의 안전성은 상호 보관하는 비밀키의 안전성에 기인하고 비밀키의 교환에 의한 상호 동기화가 가장 중요한 요소이다. 본 논문에서는 quantum cryptography system 중 BB84 알고리즘의 수학적 안전도를 살펴보고 이를 이용하여 양자 키 전송을 시행한다. 생성된 키는 개인의 각 단말에서 AES의 64번 라운드를 시행한 ciphertext을 상호 교환하는 One-time Pad 형 알고리즘을 제안한다. Secret communication has developed from analogue communication to digital one. Secret communication which is based on digital communication has been designed succeeding safety of one-time pad. One-time pad's safety is attributed to the security of secret key's mutual storage and mutual synchronization that is the key's interchange basis is one of the essential factors. This manuscript examines mathematical stability of BB84 algorithm which is one of the quantum cryptography system, and conducts transmission of quantum key. The created key suggests One-time Pad algorithm which interchanges ciphertext implemented AES's 64th round.

An Arbitrated Quantum Signature with Bell States

Entanglement is the main resource in quantum communication. The main aims of the arbitrated quantum signature (AQS) scheme are to present an application of the entanglement in cryptology and to prove the possibility of the quantum signature. More specifically, the main function of quantum entangled states in the existing AQS schemes is to assist the signatory to transfer quantum states to the receiver. However, teleportation and the Leung quantum one-time pad (L-QOTP) algorithm are not enough to design a secure AQS scheme. For example, Pauli operations commute or anticommute with each other, which makes the implementation of attacks easily from the aspects of forgery and disavowal. To conquer this shortcoming, we construct an improved AQS scheme using a new QOTP algorithm. This scheme has three advantages: it randomly uses the Hadamard operation in the new QOTP to resist attacks by using the anticommutativity of nontrivial Pauli operators and it preserves almost all merits in the existing AQS schemes; even in the process of handling disputes, no party has chance to change the message and its signature without being discovered; the receiver can verify the integrity of the signature and discover the disavow of the signatory even in the last step of verification.

An arbitrated quantum signature scheme with fast signing and verifying

Existing arbitrated quantum signature (AQS) schemes are almost all based on the Leung quantum one-time pad (L-QOTP) algorithm. In these schemes, the receiver can achieve an existential forgery of the sender's signatures under the known message attack, and the sender can successfully disavow any of her/his signatures by a simple attack. In this paper, a solution of solving the problems is given, through designing a new QOTP algorithm relying largely on inserting decoy states into fixed insertion positions. Furthermore, we present an AQS scheme with fast signing and verifying, which is based on the new QOTP algorithm. It is just using single particle states and is unconditional secure. To fulfill the functions of AQS schemes, our scheme needs a significantly lower computational costs than that required by other AQS schemes based on the L-QOTP algorithm.

Walks on graphs as symmetric or asymmetric tools to encrypt data

New results on graph theoretical method of encryption will be presented. The general idea is to treat vertices of a graph as messages, and walks of a certain length as ecnryption tools. We will construct one-time pad algorithms with a certain resistance to attacks when the adversary knows plaintext and ciphertext. Special linguistic graphs of high girth whose vertices (messages) and walks (encoding tools) could be both naturally identified with vectors over the finite field, and with the so-called parallelotopic graphs, which turn out to be efficient tools for symmetric encryption. We will formulate criteria when parallelotopic graph (or the more general graph of tactical configuration) is a graph of absolutely optimal encryption scheme, producing asymptotic one-time pad algorithm. We will show how to convert one-time pads, which are related to geometries of rank 2 of simple groups of Lie type, to a real-life encryption scheme involving potentially infinite text and flexible passwords. We will discuss families of linguistic and parallelotopic graphs of increasing girth as the source for the generation of asymmetric cryptographic functions and related open key algorithms. We will construct new families of such graphs via group theoretical and geometrical technique. The software for symmetric and asymmetric ecnryption (prototype model of the package) is ready for demonstration.