Cryptography and Network Security

 Hi All ! Hope you all are doing great. ! This Blog is regarding Zero Knowledge Proof. The advance research in the area of Blockchain and Cryptographic Algorithm makes this concept very dominant.  Zero Knowledge Proof   : Let R be a polynomial time decidable binary relation. The corresponding language L which is patches of statements x such that there holds or exist witness w and (x,w)  ∈  R. We specify L as an NP Language.  Consider two entities P and V which is called as Prover and verifier term as zero knowledge proof if it has two mandatory Properties i.e.  Completeness and Soundness.  A. Completeness :   It means  ∀ x  ∈  L, (P,V)(x) is always 1.  B. Soundness  : It means  ∀ x  ∉  L, every Prover P*, Pr[<P*,V>(x) = 1] is always negligible.  Example : Consider two friends Kuk (Prover) and Goa (Verifier). Goa has color blindness. Goa has two identical apples but of differ...

 Hi Folks ! Hope you are doing well ! 😉 This Blog is regarding Byzantine attack or means Byzantine agreement.  What is Byzantine ?? 😬 A friend having capricious behavior is called byzantine. This can be your imagination also.  Example: Not sending correct message to the fellow friends, sending no message to the fellow friends or lying about the input. Note: Byzantine nature also includes collusion, i.e. , all byzantine friends are controlled by the same adversary. What is Byzantine Problem ?? Lets us consider through example. Suppose in a class of Algorithm there are 20 friends and they are planning for mass bunk but in 20 friends there are some fellow friends who are not planning for mass bunk. In this situation it is quite difficult to take decision. This Problem is called as a Byzantine Problem.  This Problem is solvable if an only if atleast two third fellows friends are loyal.  Can you solve Byzantine Problem with 3 friends ?? Answer is ob...

Hi Folks ! This blog is regarding Elliptic curves. Hope after reading this blog you will be able to know about the basics of elliptic curves.  Una and Jammu are the two best friends. One day Una saw the equation  of elliptic curve. Now, Una became curious regarding elliptic curve means what is elliptic curve and how they are generated and why they are generated ?. 😓 So he call to his friend Jammu. Una : Hey Jammu ! How are you ?? Jammu : I'm good Una. Thanks for asking.  Una : Hey Jammu ! you know about my nature 😁 so I don't want to waste your time. Yesterday, I saw the equation of elliptic curve. so can you please tell me about elliptic curve means how they generated and why they generated ?  Jammu : Hahahah !!! Ok, Sure Una. Have you know about Tunnell's  theorem ?? Una : No. 😌. Jammu : Don't Panic Una. See my below text.  Finding a simple test to determine whether or not a given integer say ‘n’ is the area of some right triangle all of ...