scholarly journals An Alternative Diffie-Hellman Protocol

Cryptography ◽  
2020 ◽  
Vol 4 (1) ◽  
pp. 5
Author(s):  
Eric Järpe
Keyword(s):  
Quantum Computer ◽  
Key Generation ◽  
Arbitrary Size ◽  
Diffie Hellman ◽  
Shared Secret ◽  
Computer Based ◽  
The One ◽  
One Way Function ◽  
Encrypted Communication ◽  
Generation Procedure

The Diffie–Hellman protocol, ingenious in its simplicity, is still the major solution in protocols for generating a shared secret in cryptography for e-trading and many other applications after an impressive number of decades. However, lately, the threat from a future quantum computer has prompted successors resilient to quantum computer-based attacks. Here, an algorithm similar to Diffie–Hellman is presented. In contrast to the classic Diffie–Hellman, it involves floating point numbers of arbitrary size in the generation of a shared secret. This can, in turn, be used for encrypted communication based on symmetric cyphers. The validity of the algorithm is verified by proving that a vital part of the algorithm satisfies a one-way property. The decimal part is deployed for the one-way function in a way that makes the protocol a post-quantum key generation procedure. This is concluded from the fact that there is, as of yet, no quantum computer algorithm reverse engineering the one-way function. An example illustrating the use of the protocol in combination with XOR encryption is given.

scholarly journals Hyper-and-elliptic-curve cryptography

2014 ◽  
Vol 17 (A) ◽  
pp. 181-202 ◽  
Author(s):  
Daniel J. Bernstein ◽  
Tanja Lange
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Base Point ◽  
Scalar Multiplication ◽  
Key Generation ◽  
Diffie Hellman ◽  
Fixed Base ◽  
Shared Secret ◽  
Genus 2 ◽  
Point Scalar Multiplication

AbstractThis paper introduces ‘hyper-and-elliptic-curve cryptography’, in which a single high-security group supports fast genus-2-hyperelliptic-curve formulas for variable-base-point single-scalar multiplication (for example, Diffie–Hellman shared-secret computation) and at the same time supports fast elliptic-curve formulas for fixed-base-point scalar multiplication (for example, key generation) and multi-scalar multiplication (for example, signature verification).

scholarly journals Practical Quantum Computing

2021 ◽  
Vol 2 (1) ◽  
pp. 1-35
Author(s):  
Adrien Suau ◽  
Gabriel Staffelbach ◽  
Henri Calandra
Keyword(s):  
Wave Equation ◽  
Quantum Computer ◽  
Quantum Algorithms ◽  
Quantum Algorithm ◽  
Quantum Circuit ◽  
Equation Solving ◽  
Small Quantum ◽  
Quantum Wave ◽  
Variational Algorithms ◽  
The One

In the last few years, several quantum algorithms that try to address the problem of partial differential equation solving have been devised: on the one hand, “direct” quantum algorithms that aim at encoding the solution of the PDE by executing one large quantum circuit; on the other hand, variational algorithms that approximate the solution of the PDE by executing several small quantum circuits and making profit of classical optimisers. In this work, we propose an experimental study of the costs (in terms of gate number and execution time on a idealised hardware created from realistic gate data) associated with one of the “direct” quantum algorithm: the wave equation solver devised in [32]. We show that our implementation of the quantum wave equation solver agrees with the theoretical big-O complexity of the algorithm. We also explain in great detail the implementation steps and discuss some possibilities of improvements. Finally, our implementation proves experimentally that some PDE can be solved on a quantum computer, even if the direct quantum algorithm chosen will require error-corrected quantum chips, which are not believed to be available in the short-term.

Efficient reversible quantum design of sig-magnitude to two's complement converters

2020 ◽  
Vol 20 (9&10) ◽  
pp. 747-765
Author(s):  
F. Orts ◽  
G. Ortega ◽  
E.M. E.M. Garzon
Keyword(s):  
Quantum Computing ◽  
Scientific Community ◽  
Quantum Computer ◽  
Fault Tolerant ◽  
State Of The Art ◽  
The Other ◽  
Quantum Computers ◽  
Binary Number ◽  
Quantum Cost ◽  
The One

Despite the great interest that the scientific community has in quantum computing, the scarcity and high cost of resources prevent to advance in this field. Specifically, qubits are very expensive to build, causing the few available quantum computers are tremendously limited in their number of qubits and delaying their progress. This work presents new reversible circuits that optimize the necessary resources for the conversion of a sign binary number into two's complement of N digits. The benefits of our work are two: on the one hand, the proposed two's complement converters are fault tolerant circuits and also are more efficient in terms of resources (essentially, quantum cost, number of qubits, and T-count) than the described in the literature. On the other hand, valuable information about available converters and, what is more, quantum adders, is summarized in tables for interested researchers. The converters have been measured using robust metrics and have been compared with the state-of-the-art circuits. The code to build them in a real quantum computer is given.

Hiding Data in Plain Sight: Towards Provably Unbreakable Encryption with Short Secret Keys and One-Way Functions

2021 ◽  
Author(s):  
Mircea-Adrian Digulescu
Keyword(s):  
Encryption Scheme ◽  
Secret Key ◽  
Small Probability ◽  
Random Data ◽  
Computing Power ◽  
Plain Text ◽  
Secret Keys ◽  
The One ◽  
One Way Function ◽  
The Cost

It has long been known that cryptographic schemes offering provably unbreakable security exist, namely the One Time Pad (OTP). The OTP, however, comes at the cost of a very long secret key - as long as the plain-text itself. In this paper we propose an encryption scheme which we (boldly) claim offers the same level of security as the OTP, while allowing for much shorter keys, of size polylogarithmic in the computing power available to the adversary. The Scheme requires a large sequence of truly random words, of length polynomial in the both plain-text size and the logarithm of the computing power the adversary has. We claim that it ensures such an attacker cannot discern the cipher output from random data, except with small probability. We also show how it can be adapted to allow for several plain-texts to be encrypted in the same cipher output, with almost independent keys. Also, we describe how it can be used in lieu of a One Way Function.

scholarly journals Statistical Analysis using traditional technique, Microsoft Excel and Predictive Analytic Software

10.17158/514 ◽  
2016 ◽  
Vol 19 (2) ◽  
Author(s):  
Jovelyn M. Durango ◽  
Carlito P. Yurango
Keyword(s):  
Statistical Analysis ◽  
Completion Time ◽  
Microsoft Excel ◽  
Instructional Tools ◽  
Traditional Technique ◽  
Significant Difference ◽  
Before And After ◽  
Computer Based ◽  
The One ◽  
Time Required

<p>The advent of technology has improved the way statistics is taught and learned. It is claimed that the use of computer-based instructional tools can actively explore the meaning of statistical concepts among the students, as well as enhance their learning experiences. This study aimed to compare three methods of statistical analysis namely, the traditional technique (use of the calculator), Microsoft Excel and Statistical Package for Social Sciences (SPSS) software. This investigation utilized the experimental design, specifically the One-Group Pretest – Posttest Design. There were six education students who self-assessed their attitude before and after the introduction of the use of various computation techniques and performed the statistical analysis considering also the completion time required for each process. Results of the study revealed an increase in the level of attitude among the respondents form the pretest to the posttest. Also, the cognitive level regardless of the approach was very high. However, the t-test failed to establish a significant difference in the attitude among the respondents. On the other hand, there were significant differences in both the test scores and completion time of the respondents in the three methods in favor of SPSS.</p><p> </p><p><strong>Keywords: </strong>Information technology, statistics, traditional technique, Microsoft excel, SPSS, comparative analysis, experimental research design, Davao City, Philippines. </p>

scholarly journals BLOCK CIPHERS ON THE BASIS OF REVERSIBLE CELLULAR AUTOMATA

2020 ◽  
Vol 10 (1) ◽  
pp. 8-11
Author(s):  
Yuliya Tanasyuk ◽  
Petro Burdeinyi
Keyword(s):  
Cellular Automata ◽  
Block Cipher ◽  
Key Generation ◽  
One Dimensional ◽  
C Programming Language ◽  
C Programming ◽  
Shared Secret ◽  
Reversible Cellular Automata ◽  
The Given ◽  
First Time

The given paper is devoted to the software development of block cipher based on reversible one-dimensional cellular automata and the study of its statistical properties. The software implementation of the proposed encryption algorithm is performed in C# programming language in Visual Studio 2017. The paper presents specially designed approach for key generation. To ensure desired cryptographic stability, the shared secret parameters can be adjusted to contain information needed for creating substitution tables, defining reversible rules, and hiding final data. For the first time, it is suggested to create substitution tables based on iterations of a cellular automaton that is initialized by the key data.

scholarly journals A Distributed Shared Key Generation Procedure Using Fractional Keys

1998 ◽  
Author(s):  
R. Poovendran ◽  
M. S. Corson ◽  
J. S. Baras
Keyword(s):  
Key Generation ◽  
Shared Key ◽  
Generation Procedure

scholarly journals A quantum computer based on recombination processes in microelectronic devices

2005 ◽  
Vol 10 ◽  
pp. 85-88
Author(s):  
K Theodoropoulos ◽  
D Ntalaperas ◽  
I Petras ◽  
N Konofaos
Keyword(s):  
Quantum Computer ◽  
Microelectronic Devices ◽  
Recombination Processes ◽  
Computer Based

scholarly journals An efficient cryptographic technique using modified Diffie–Hellman in wireless sensor networks

2020 ◽  
Vol 16 (6) ◽  
pp. 155014772092577 ◽  
Author(s):  
Shahwar Ali ◽  
A Humaria ◽  
M Sher Ramzan ◽  
Imran Khan ◽  
Syed M Saqlain ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Security ◽  
Response Times ◽  
Base Station ◽  
Wireless Channel ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Key Generation ◽  
Diffie Hellman

In wireless sensor networks, the sensors transfer data through radio signals to a remote base station. Sensor nodes are used to sense environmental conditions such as temperature, strain, humidity, sound, vibration, and position. Data security is a major issue in wireless sensor networks since data travel over the naturally exposed wireless channel where malicious attackers may get access to critical information. The sensors in wireless sensor networks are resource-constrained devices whereas the existing data security approaches have complex security mechanisms with high computational and response times affecting the network lifetime. Furthermore, existing systems, such as secure efficient encryption algorithm, use the Diffie–Hellman approach for key generation and exchange; however, Diffie–Hellman is highly vulnerable to the man-in-the-middle attack. This article introduces a data security approach with less computational and response times based on a modified version of Diffie–Hellman. The Diffie–Hellman has been modified to secure it against attacks by generating a hash of each value that is transmitted over the network. The proposed approach has been analyzed for security against various attacks. Furthermore, it has also been analyzed in terms of encryption/decryption time, computation time, and key generation time for different sizes of data. The comparative analysis with the existing approaches shows that the proposed approach performs better in most of the cases.

Sign in / Sign up

Export Citation Format

Share Document