When dealing with encryption, there is a negligible probability that an attacker will be able to try out all the possible keys used to encrypt the message. Can we make an encryption scheme which will be secure even if attacker has infinite power?
Universally Unique Identifier
Almost all the programming languages have a library function for generating a Universally Unique Identifier (UUID). These libraries are responsible for generating an identifier that is unique in the whole universe. How do these libraries go around the complete universe and generate a unique identifier in just a few milliseconds?
Course review: Cryptography-I
Cryptography-I is offered by Professor Dan Boneh from Stanford University on the Coursera platform. The course is about the theory and practice of modern cryptography and provides an in-depth view of the field.
The Birthday Paradox
We have 23 random, unrelated people in a room. What is the probability that at least two people have the same birthday?