Intractable Problems in Cryptography
نویسندگان
چکیده
We examine several variants of the Diffie-Hellman and Discrete Log problems that are connected to the security of cryptographic protocols. We discuss the reductions that are known between them and the challenges in trying to assess the true level of difficulty of these problems, particularly if they are interactive or have complicated input.
منابع مشابه
Number field cryptography
This paper gives an overview of the state of art in cryptography based on quadratic orders. It discusses the intractable problems in class groups and the infrastructure of quadratic orders, approaches to the solution to these problems, and the crypto-systems employing them as underlying problems.
متن کاملComputational Complexity
Computational complexity theory is the study of the minimal resources needed to solve computational problems. In particular, it aims to distinguish between those problems that possess efficient algorithms (the “easy” problems) and those that are inherently intractable (the “hard” problems). Thus computational complexity provides a foundation for most of modern cryptography, where the aim is to ...
متن کاملPolynomially Uncomputable Number-Theoretic Problems in Cryptography and Network Security
By far the most important automated tool for network and communications security is encryption, but encryption itself needs security. As we know, many cryptosystems and cryptographic protocols are based their security on some computationally intractable mathematical problems. In this paper, we shall discuss some of the number-theoretic problems that are currently polynomially uncomputable and t...
متن کاملInvestigating Methods of Kleptography
Due to the fast development in information and communication technology, new challenging problems appear in the security. So, it is important and vital that the scientific society of our country focuses on research and studies these problems and by providing new proposal try to respond to these critical needs of our country. Hence, our aim in this paper is to study and highlight one of the impo...
متن کاملPractical Lattice-Based Cryptography: NTRUEncrypt and NTRUSign
W e provide a brief history and overview of lattice based cryptography and cryptanalysis: shortest vector problems, closest vector problems, subset sum problem and knapsack systems, GGH, Ajtai-Dwork and NTRU. A detailed discussion of the algorithms NTRUEncrypt and NTRUSign follows. These algorithms have attractive operating speed and keysize and are based on hard problems that are seemingly int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2010 شماره
صفحات -
تاریخ انتشار 2010