From 249370230abf237c4d03b90e21fc747ad0886c42 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Hassel=20Alcal=C3=A1?=
 <83148363+hasselalcala@users.noreply.github.com>
Date: Wed, 8 Jun 2022 19:17:29 -0500
Subject: [PATCH] Day05.md

---
 Day05.md | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/Day05.md b/Day05.md
index 43eab86..706fe43 100644
--- a/Day05.md
+++ b/Day05.md
@@ -4,4 +4,10 @@ One of the first interactive proof of knowledge algorithm is Fiat - Shamir, whic
 
 ![Message encryption/decryption](https://raw.githubusercontent.com/hasselalcala/DaysOfZeroKnowledge/main/images/fiatShamir.png)
 
+For the method to work, the original interactive proof must have the property of being public-coin, i.e. verifier's random coins are made public throughout the proof protocol. 
 
+The Fiat–Shamir Algorithm may also be viewed as converting a public-coin interactive proof of knowledge into a non-interactive proof of knowledge. If the interactive proof is used as an identification tool, then the non-interactive version can be used directly as a digital signature by using the message as part of the input to the random oracle.
+
+A random oracle is an oracle (a theoretical black box) that responds to every unique query with a (truly) random response chosen uniformly from its output domain. If a query is repeated, it responds the same way every time that query is submitted.
+
+That's all for this thread. Thank you for reading! If you liked this thread, follow me @Hasseru and retweet.