The Plymouth Student Scientist
Document Type
Engineering, Computing and Mathematics Article
Abstract
This paper considers the application of group theory to cryptography using a nonabelian infinite group (the braid group). The practical application of cryptographic protocols are determined by their security and feasibility. Both research papers and experiments will be used to measure feasibility and security of the protocol, with the intention of ultimately deeming the protocol either effective or ineffective. Having secure cryptography is vital to providing anonymity, confidentiality and integrity to data and as the quantum threat creeps towards us, the ever greater importance of new secure cryptography is becoming clear.
Publication Date
2020-10-10
Publication Title
The Plymouth Student Scientist
Volume
13
Issue
1
First Page
432
Last Page
475
ISSN
1754-2383
Deposit Date
October 2020
Embargo Period
2024-07-08
URI
http://hdl.handle.net/10026.1/16517
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Recommended Citation
Walter, Mathew J.
(2020)
"Assessing the security of cryptographic primitives for infinite groups,"
The Plymouth Student Scientist: Vol. 13:
Iss.
1, Article 14.
Available at:
https://pearl.plymouth.ac.uk/tpss/vol13/iss1/14
