A New Key-Agreement-Protocol
Bjoern Grohmann
TL;DR
This paper introduces a novel 4-pass key-agreement protocol that leverages one-way functions and the difficulty of solving certain equations to ensure security.
Contribution
It presents a new key-agreement protocol based on polynomial-time computable one-way functions and a specific hard problem, enhancing cryptographic methods.
Findings
Protocol is secure under assumed hardness of the equation system.
Relies on polynomially computable one-way functions.
Provides a new approach to key agreement in cryptography.
Abstract
A new 4-pass Key-Agreement Protocol is presented. The security of the protocol mainly relies on the existence of a (polynomial-computable) One-Way-Function and the supposed computational hardness of solving a specific system of equations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Chaos-based Image/Signal Encryption · Cryptographic Implementations and Security