From 225196bd9f87ca8dc79244c9f297994021604a25 Mon Sep 17 00:00:00 2001 From: xtaci Date: Tue, 30 Jul 2024 17:24:59 +0800 Subject: [PATCH] Update README.md --- README.md | 7 ++----- 1 file changed, 2 insertions(+), 5 deletions(-) diff --git a/README.md b/README.md index 7c759c6..ab01b1a 100644 --- a/README.md +++ b/README.md @@ -1,4 +1,3 @@ -# DPPK ![348676962-d396d009-1f62-4273-af48-869e388c3445](https://github.com/user-attachments/assets/48f97544-64fe-463d-8984-d584e91ca9d2) [![GoDoc][1]][2] [![Go Report Card][3]][4] @@ -12,11 +11,11 @@ DPPK is an [Key encapsulation mechanism](https://en.wikipedia.org/wiki/Key_encapsulation_mechanism), a.k.a. - KEM -# Overview +## Overview The ancient [Vieta’s formulas](https://en.wikipedia.org/wiki/Vieta%27s_formulas) reveal the relationships between the coefficients of an nth-degree polynomial and its roots. It has been surprisingly found that there exists a hidden secret for a potential public key exchange: decoupling the product of all roots (or the constant term) from the summations of root products (or coefficients) of a polynomial to establish a keypair. -# Proposed Algorithm: Deterministic Polynomial Public Key (DPPK) +# Deterministic Polynomial Public Key (DPPK) ## Key Principles @@ -35,8 +34,6 @@ The ancient [Vieta’s formulas](https://en.wikipedia.org/wiki/Vieta%27s_formula - **Classical Attacks**: $O(n\sqrt{p})$. - **Quantum Attacks**: $O(\sqrt{p})$, matching the complexity level of Grover’s search algorithm. -# Practical Implementation and Performance - ## Keypair Generation and Encryption/Decryption - The central idea for keypair construction arises from Vieta’s formulas by decoupling the coefficients of a polynomial into two categories: