Cryptography studies mathematical techniques related to aspects of information security such as confidentiality, data integrity, message authentication, and entity authentication (Menezes et al, 2018). Applied Cryptography focuses more on the specification of natural systems which are, or could be, in use today by companies, governments, and Internet users. Nowadays, it turns out to be widely applied to the blockchain scenario, as Prof Kevin Mo suggested that in SciEcon AMA, without cryptography, it is hard to make blockchain really decentralized.
Manuel Blum | 1995 Turing Award laureate, in recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking
Chi-Chih Yao | 2000 Turing Award laureate, in recognition of his contributions to the theory of computation, including the complexity-based theory of pseudorandom number generation, cryptography, and communication complexity.
Adi Shamir, Ronald Linn Rivest, and Leonard Adleman | 2002 Turing Award laureates, in recognition of their contributions to making public-key cryptography useful in practice.
Shafi Goldwasser and Silvio M Micali | 2012 Turing Award laureates, in recognition of their contributions to transformative work that laid the complexity-theoretic foundations for the science of cryptography, and in the process they pioneered new methods for efficient verification of mathematical proofs in complexity theory.
Whitfield Diffie and Martin Hellman | 2015 Turing Award laureates, in recognition of their contributions to inventing and promulgating both asymmetric public-key cryptography, including its application to digital signatures, and a practical cryptographic key-exchange method.
Creative Commons Attribution 4.0 International License (CC-BY 4.0)