Synchronization of Tree Parity Machines using non-binary input vectors
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2021
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914989490569216 |
|---|---|
| author | Stypiński, Miłosz Niemiec, Marcin |
| author_facet | Stypiński, Miłosz Niemiec, Marcin |
| contents | 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 |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2104_11105 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Synchronization of Tree Parity Machines using non-binary input vectors Stypiński, Miłosz Niemiec, Marcin Cryptography and Security Machine Learning Neural and Evolutionary Computing 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 |
| title | Synchronization of Tree Parity Machines using non-binary input vectors |
| topic | Cryptography and Security Machine Learning Neural and Evolutionary Computing |
| url | https://arxiv.org/abs/2104.11105 |