From 8dc8903c14089e352bcd1a6725f3d83cdc71469b Mon Sep 17 00:00:00 2001 From: WitherOrNot Date: Thu, 21 Sep 2023 15:08:43 -0400 Subject: [PATCH] Update BINK.md --- BINK.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/BINK.md b/BINK.md index ffaaecf..8a61fc8 100644 --- a/BINK.md +++ b/BINK.md @@ -92,7 +92,7 @@ In real world situations developers typically use curves of 256-bits or more. An important concept is that addition can be defined between two points on an elliptic curve. This also allows a definition of integer multiplication ($nP$ is $P$ added to itself $n$ times). -The core of elliptic curve cryptography uses this multiplication definition, as solving the equation $Q=nP$ for known points $P$ and $Q$ is difficult with known algorithms, providing cryptographic security. +The core of elliptic curve cryptography uses this multiplication definition, as solving the equation $Q=nP$ for known points $P$ and $Q$ is difficult with known algorithms, but it is easy to compute knowing $n$ and $Q$. This allows elliptic curve multiplication to act as a trapdoor function. ## BINK resource