Synchronization of Tree Parity Machines using non-binary input vectors
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
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Parameterized Hardware Architecture for Frame Synchronization at all Noise Levels
Frame synchronization is the act of discerning the first bit of a valid data frame inside an incoming transmission. This is particularly important in high-noise environments where the communication channel significantly …
AllBML: A High-performance, Low-cost Gradient Synchronization Algorithm for DML Training
In distributed machine learning (DML), the network performance between machines significantly impacts the speed of iterative training. In this paper we propose BML, a new gradient synchronization algorithm with higher ne…
GPUVocal Bursts Intensity PredictionDecision Machines: Congruent Decision Trees
The decision tree recursively partitions the input space into regions and derives axis-aligned decision boundaries from data. Despite its simplicity and interpretability, decision trees lack parameterized representation,…
Computational EfficiencyMachine Learning Techniques with Fairness for Prediction of Completion of Drug and Alcohol Rehabilitation
The aim of this study is to look at predicting whether a person will complete a drug and alcohol rehabilitation program and the number of times a person attends. The study is based on demographic data obtained from Subst…
FairnessImputationThe return of AdaBoost.MH: multi-class Hamming trees
Within the framework of AdaBoost.MH, we propose to train vector-valued decision trees to optimize the multi-class edge without reducing the multi-class problem to $K$ binary one-against-all classifications. The key eleme…
Computational Efficiency