On Post-Modern Cryptography
نویسنده
چکیده
This essay relates to a recent article of Koblitz&Menezes that “criticizes several typical ‘provable security’ results” and argues that the “theorem-proof paradigm of theoretical mathematics is often of limited relevance” to cryptography. Although it should be obvious that these claims are utterly wrong, we undertake articulating this triviality. In particular, we point out some of the fundamental philosophical flaws that underly the said article and some of its misconceptions regarding theoretical research in Cryptography in the last quarter of a century.
منابع مشابه
Constructing cryptographic definitions
This paper mirrors an invited talk to ISCISC 2011. It is not a conventional paper so much as an essay summarizing thoughts on a little-talked-about subject. My goal is to intermix some introspection about definitions with examples of them, these examples drawn mostly from cryptography. Underpinning our discussion are two themes. The first is that definitions are constructed. They are i...
متن کاملAn Introduction to Differential Computation Analysis (DCA) on the withe-box cryptography algorithms
Advances in information and communication technologies lead to use of some new devices such as smart phones. The new devices provide more advantages for the adversaries hence with respect to them, one can define with-box cryptography. In this new model of cryptography, designers try to hide the key using as a kind of implementation. The Differential Computation Analysis (DCA) is a side channel ...
متن کاملBabaï round-off CVP method in RNS: Application to lattice based cryptographic protocols
Lattice based cryptography is claimed as a serious candidate for post quantum cryptography, it recently became an essential tool of modern cryptography. Nevertheless, if lattice based cryptography has made theoretical progresses, its chances to be adopted in practice are still low due to the cost of the computation. If some approaches like RSA and ECC have been strongly optimized in particular ...
متن کاملOn new multivariate cryptosystems based on hidden Eulerian equations over finite fields
We propose new multivariate cryptosystems over n-dimensional vector space over a finite field Fq based on idea of hidden discrete logarithm problem for F ∗ q. These cryptosystems are based on hidden eulerian equations x = a, (α, q − 1) = 1. The method is based on the idea of Eulerian transformations, which allow us to use asymmetric algorithms based on families of nonlinear multiplicatively inj...
متن کاملA Formula Goes to Court: Partisan Gerrymandering and the Efficiency Gap
August 2017 Notices of the AMs 709 In August 2015 the National Security Agency published a webpage announcing preliminary plans for transitioning to quantum-resistant algorithms (www.iad.gov /iad/programs/iad-initiatives/cnsa-suite.cfm). In December 2016 the National Institute of Standards and Technology (NIST) announced a call for proposals for quantum-resistant algorithms with a deadline of 3...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2006 شماره
صفحات -
تاریخ انتشار 2006