In pursuit of the perfect Authenticator
Reliably verifying claimed Identity in digital world is hard. This post discusses evolution of authenticator and why it is hard to build a perfect authenticator.
Category Archives: Asymmetric key cryptography
Security of public-key cryptography and hard computational problem
what brings the confidence in security of asymmetric key cryptography? How are we sure that someone knowing the public key can’t determine the corresponding private key? The security relies on three well known hard computational problems.
Digital signature – you can’t deny you authorized it
This post is from my series of short essays on cybersecurity. In the last post – Message Authentication Code (MAC) …
Adarsh Khare's Blog 