Featured Research

from universities, journals, and other organizations

New algorithm shakes up cryptography

Date:
May 15, 2014
Source:
CNRS
Summary:
Researchers have solved one aspect of the discrete logarithm problem. This is considered to be one of the 'holy grails' of algorithmic number theory, on which the security of many cryptographic systems used today is based. They have devised a new algorithm that calls into question the security of one variant of this problem, which has been closely studied since 1976.

Researchers at the Laboratoire Lorrain de Recherches en Informatique et ses Applications (CNRS/Université de Lorraine/Inria) and the Laboratoire d'Informatique de Paris 6 (CNRS/UPMC) have solved one aspect of the discrete logarithm problem. This is considered to be one of the 'holy grails' of algorithmic number theory, on which the security of many cryptographic systems used today is based. They have devised a new algorithm (1) that calls into question the security of one variant of this problem, which has been closely studied since 1976.

Related Articles


This result, published on the site of the International Association of Cryptologic Research and on the HAL open access archive, was presented at the international conference Eurocrypt 2014 held in Copenhagen on 11-15 May 2014 and published in Advances in cryptology. It discredits several cryptographic systems that until now were assumed to provide sufficient security safeguards. Although this work is still theoretical, it is likely to have repercussions especially on the cryptographic applications of smart cards, RFID chips (2), etc.

To protect confidentiality of information, cryptography seeks to use mathematical problems that are difficult to solve, even for the most powerful machines and the most sophisticated algorithms.

The security of a variant of the discrete logarithm, reputed to be very complex, has been called into question by four researchers from CNRS and the Laboratoire d'Informatique de Paris 6 (CNRS/UPMC), namely Pierrick Gaudry, Răzvan Bărbulescu, Emmanuel Thomé and Antoine Joux (3). The algorithm they devised stands out from the best algorithms known to date for this problem. Not only is it significantly easier to explain, but its complexity is also considerably improved. This means that it is able to solve increasingly large discrete logarithm problems, while its computing time increases at a far slower rate than with previous algorithms. The computation of discrete logarithms associated with problems that are deliberately made difficult for cryptographic applications is thus made considerably easier.

Since solving this variant of the discrete logarithm is now within the capacity of current computers, relying on its difficulty for cryptographic applications is therefore no longer an option. This work is still at a theoretical stage and the algorithm still needs to be refined before it is possible to provide a practical demonstration of the weakness of this variant of the discrete logarithm. Nonetheless, these results reveal a flaw in cryptographic security and open the way to additional research. For instance, the algorithm could be adapted in order to test the robustness of other cryptographic applications.

(1) A method consisting in a series of instructions that enables a computer to solve a complex problem.

(2) An RFID chip is a computer chip coupled with an antenna that enables it to be activated at a distance by a reader and to communicate with it.

(3) Antoine Joux, who was attached to the Laboratoire Parallélisme, Réseaux, Systèmes, Modélisation (PRISM) (CNRS/UVSQ) at the time of open access publication, is currently a researcher at the Laboratoire d'Informatique de Paris 6 (CNRS/UPMC) and has since obtained the Chair of Cryptology at the Fondation UPMC.


Story Source:

The above story is based on materials provided by CNRS. Note: Materials may be edited for content and length.


Journal Reference:

  1. Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thom. A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic. Advances in Cryptology – EUROCRYPT 2014, Lecture Notes in Computer Science, Volume 8441, 2014, pp 1-16 DOI: 10.1007/978-3-642-55220-5_1

Cite This Page:

CNRS. "New algorithm shakes up cryptography." ScienceDaily. ScienceDaily, 15 May 2014. <www.sciencedaily.com/releases/2014/05/140515163739.htm>.
CNRS. (2014, May 15). New algorithm shakes up cryptography. ScienceDaily. Retrieved April 21, 2015 from www.sciencedaily.com/releases/2014/05/140515163739.htm
CNRS. "New algorithm shakes up cryptography." ScienceDaily. www.sciencedaily.com/releases/2014/05/140515163739.htm (accessed April 21, 2015).

Share This


More From ScienceDaily



More Computers & Math News

Tuesday, April 21, 2015

Featured Research

from universities, journals, and other organizations


Featured Videos

from AP, Reuters, AFP, and other news services

Humanoid Robot Can Recognise and Interact With People

Humanoid Robot Can Recognise and Interact With People

Reuters - Innovations Video Online (Apr. 20, 2015) — An ultra-realistic humanoid robot called &apos;Han&apos; recognises and interprets people&apos;s facial expressions and can even hold simple conversations. Developers Hanson Robotics hope androids like Han could have uses in hospitality and health care industries where face-to-face communication is vital. Matthew Stock reports. Video provided by Reuters
Powered by NewsLook.com
Drones and Health Apps at Santiago's "Robotics Day"

Drones and Health Apps at Santiago's "Robotics Day"

AFP (Apr. 20, 2015) — Latin American robotics experts gather in Santiago, Chile for "Robotics Day". Video provided by AFP
Powered by NewsLook.com
Japan Humanoid Robot Receives Customers at Department Store

Japan Humanoid Robot Receives Customers at Department Store

AFP (Apr. 20, 2015) — She can smile, she can sing and she can give you guidance at one of the most upscale department stores in Tokyo...a female-looking humanoid makes her debut as a receptionist Video provided by AFP
Powered by NewsLook.com
Pending Comcast-Time Warner Merger Has DOJ, FCC Concerned

Pending Comcast-Time Warner Merger Has DOJ, FCC Concerned

Newsy (Apr. 20, 2015) — The Department of Justice reportedly has concerns a Time Warner-Comcast merger would create an entity too large in the cable and broadband markets. Video provided by Newsy
Powered by NewsLook.com

Search ScienceDaily

Number of stories in archives: 140,361

Find with keyword(s):
 
Enter a keyword or phrase to search ScienceDaily for related topics and research stories.

Save/Print:
Share:  

Breaking News:

Strange & Offbeat Stories

 

Space & Time

Matter & Energy

Computers & Math

In Other News

... from NewsDaily.com

Science News

Health News

Environment News

Technology News



Save/Print:
Share:  

Free Subscriptions


Get the latest science news with ScienceDaily's free email newsletters, updated daily and weekly. Or view hourly updated newsfeeds in your RSS reader:

Get Social & Mobile


Keep up to date with the latest news from ScienceDaily via social networks and mobile apps:

Have Feedback?


Tell us what you think of ScienceDaily -- we welcome both positive and negative comments. Have any problems using the site? Questions?
Mobile iPhone Android Web
Follow Facebook Twitter Google+
Subscribe RSS Feeds Email Newsletters
Latest Headlines Health & Medicine Mind & Brain Space & Time Matter & Energy Computers & Math Plants & Animals Earth & Climate Fossils & Ruins