Synchronization of Tree Parity Machines using non-binary input vectors

04/22/2021
by   Miłosz Stypiński, et al.
0

Neural cryptography is the application of artificial neural networks in the subject of cryptography. The functionality of this solution is based on a tree parity machine. It uses artificial neural networks to perform secure key exchange between network entities. This article proposes improvements to the synchronization of two tree parity machines. The improvement is based on learning artificial neural network using input vectors which have a wider range of values than binary ones. As a result, the duration of the synchronization process is reduced. Therefore, tree parity machines achieve common weights in a shorter time due to the reduction of necessary bit exchanges. This approach improves the security of neural cryptography

READ FULL TEXT

page 5

page 6

research
10/01/2018

Error correction in quantum cryptography based on artificial neural networks

Intensive work on quantum computing has increased interest in quantum cr...
research
01/26/2023

Secure synchronization of artificial neural networks used to correct errors in quantum cryptography

Quantum cryptography can provide a very high level of data security. How...
research
01/27/2021

"This item is a glaxefw, and this is a glaxuzb": Compositionality Through Language Transmission, using Artificial Neural Networks

We propose an architecture and process for using the Iterated Learning M...
research
01/27/2022

HYPERLOCK: In-Memory Hyperdimensional Encryption in Memristor Crossbar Array

We present a novel cryptography architecture based on memristor crossbar...
research
09/29/2013

An Application of Backpropagation Artificial Neural Network Method for Measuring The Severity of Osteoarthritis

The examination of Osteoarthritis disease through X-ray by rheumatology ...
research
05/29/2018

Well defined quantum key distribution using calibration, synchronization, and a programmable quantum channel

Well defined quantum key distribution between two users requires both ca...
research
07/01/2019

First Occurrence of Parity Vectors and the Regular Structure of k-Span Predecessor Sets in the Collatz Graph

We study finite paths in the Collatz graph, a directed graph with natura...

Please sign up or login with your details

Forgot password? Click here to reset