Integer factorization and discrete logarithm problems

نویسنده

  • Pierrick Gaudry
چکیده

These are notes for a lecture given at CIRM in 2014, for the Journées Nationales du Calcul Formel . We explain the basic algorithms based on combining congruences for solving the integer factorization and the discrete logarithm problems. We highlight two particular situations where the interaction with symbolic computation is visible: the use of Gröbner basis in Joux's algorithm for discrete logarithm in nite eld of small characteristic, and the exact sparse linear algebra tools that occur in the Number Field Sieve algorithm for discrete logarithm in large characteristic. Disclaimer: These notes contain no new material. They also do not aim to be a survey, and exhaustivity is not a goal. As a consequence, many important works (old or recent) are not mentioned. 1 The problems and their cryptographic signi cance 1.1 Cryptographic context Cryptography, as a science that studies tools to secure communications in a wide sense, contains various sub-themes among which the so-called public-key cryptography covers algorithms such as digital signatures, and asymmetric encryption, i.e. encryption systems in which the key that is used to encrypt is publicly known, while the corresponding decryption key is known only by the recipient. This is useful in particular when the participants do not share a common secret prior to any interaction. Most public key algorithms used today are based on di cult problems in number theory, and more precisely integer factorization and discrete logarithm problems, which constitute the central topic of this lecture. Let us give two examples. EMV. The EMV is the standard adopted by Visa, Mastercard, the French Carte Bleue and many others, to secure the chip-and-pin smartcard transactions. The public key part of the standard is based on the RSA cryptosystem, whose security relies on the presumed di culty of factoring integers. The typical key sizes found in today's cards are 1024 bits or slightly more. Anyone who would be able to factor numbers of this size could easily break into the system and create fake transactions. SSL/TLS. The SSL/TLS standard is the one used to secure many protocols found on the internet. For instance, the s at the end of https acronym means that the connection between your webbrowser and the server is secured using SSL/TLS. By clicking on the lock picture when browsing

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Digital Signature Scheme based on two hard problems

In this paper we propose a signature scheme based on two intractable problems, namely the integer factorization problem and the discrete logarithm problem for elliptic curves. It is suitable for applications requiring long-term security and provides smaller signatures than the existing schemes based on the integer factorization and integer discrete logarithm problems.

متن کامل

Integer factorization and Discrete Logarithm problem are neither in P nor NP-complete

Though integer factorization and discrete logarithm problem are both practically and theoretically important, the computational complexity of these problems remained unknown. By comparing integer factorization problem with a problem in P and NP-complete problems, I show that the decision problem version of integer factorization problem is neither in P nor NP-complete. In addition, integer facto...

متن کامل

A Digital Signature Scheme for Long-Term Security

In this paper we propose a signature scheme based on two intractable problems, namely the integer factorization problem and the discrete logarithm problem for elliptic curves. It is suitable for applications requiring long-term security and provides smaller signatures than the existing schemes based on the integer factorization and integer discrete logarithm problems.

متن کامل

The Discrete Logarithm Problem as an Optimization Task: A First Study

Most of the contemporary cryptographic systems are based on mathematical problems whose solutions are generally intractable in polynomial time; such problems are the discrete logarithm problem and the integer factorization problem. In this contribution we consider the discrete logarithm problem as an Integer Programming Problem. Two Evolutionary Computation methods, namely the Particle Swarm Op...

متن کامل

The Elliptic Curve Cryptosystem

The Elliptic Curve Cryptosystem (ECC) provides the highest strength-per-bit of any cryptosystem known today. This paper provides an overview of the three hard mathematical problems which provide the basis for the security of publickey cryptosystems used today: the integer factorization problem (IFP), the discrete logarithm problem (DLP), and the elliptic curve discrete logarithm problem (ECDLP)...

متن کامل

Comments on Wei’s Digital Signature Scheme Based on Two Hard Problems

In 1998, Shao proposed two digital signature schemes and claimed that the security of which is based on the difficulties of computing both integer factorization and discrete logarithm. However, at the same year, Li and Xiao demonstrated that Shao’s schemes are insecure are not based on any hard problem. Recently, Wei proposed two “Digital Signature Schemes Based on Two Hard Problems” to improve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014