A One-Way Function Based On The Extended Euclidean Algorithm
Ephraim Feig, Vivian Feig
TL;DR
This paper proposes a new one-way function derived from the Extended Euclidean Algorithm applied to complex polynomials, aiming to enhance digital signature security.
Contribution
It introduces a novel one-way function based on polynomial factorization and the Extended Euclidean Algorithm, with potential cryptographic applications.
Findings
The problem is believed to be computationally hard.
The proposed function is suitable for digital signatures.
Further analysis of security properties is suggested.
Abstract
A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed to be hard. If so, it is a one-way function well suited for applications in digital signicatures.
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
Topicsgraph theory and CDMA systems · DNA and Biological Computing · Algorithms and Data Compression