Hi I would like to get some input on a quantum resista=
nt signature based algorithm in which I tried to email out in which you wil=
l find the details on below, open to discussion.

Most Q=
uantum Resistant Algorithms are bound to be sluggish due to the complex com=
putations used.

=

With digital s=
ignature cryptography being my focus and implementation into blockchain the=
goal I have though of a suitable alternative called Two-Factor Proof of Kn=
owledge.

Simple and to t=
he point thus removing any sluggish behavior seen in other alternatives, wh=
ich sticks to the saying why fix something that is not broken?

One could say that a simple equation=
such as x+y=3Dz can be quantum resistant=C2=A0

depe=
nding on the values used, so if a sha-256 is used as a value the equation a=
bove would be quantum resistant.

Now what would happen when a users communicated over a distribute=
d network as seen in a blockchain how can one prevent common attacks from t=
aking place in a third=C2=A0 party system?

The answer is Two-Factor Proof of Knowledge or Factorize=
d Proof of Knowledge as the more factors there are the more functionalities=
one can see in the signature being used.

The equation used in Two-Factor Proof of Knowledge is

x+e=3Dy

x+y=3Dz

In where rev=
ealing x would be the last step, something that is tied to both equations.<=
/div>

=E2=80=9CScroda busts th=
e myth that public-key cryptography on the blockchain is more secure=E2=80=
=9D by Scroda=C2=A0https://link.medium.com/3AMqHv0rgW

Would love to get some input on the matter.