{"id":25682,"date":"2014-08-25T20:42:55","date_gmt":"2014-08-26T00:42:55","guid":{"rendered":"http:\/\/www.opensource.im\/?p=25682"},"modified":"2014-08-25T20:42:55","modified_gmt":"2014-08-26T00:42:55","slug":"smartphones-set-out-to-decipher-a-cryptographic-system","status":"publish","type":"post","link":"https:\/\/euvolution.com\/open-source-convergence\/cryptography\/smartphones-set-out-to-decipher-a-cryptographic-system.php","title":{"rendered":"Smartphones set out to decipher a cryptographic system"},"content":{"rendered":"<p><p>13 hours ago by Sbastien Corthsy            Ramasany Gowthami. Credit: Alain Herzog \/ EPFL 2014      <\/p>\n<p>    While carrying out her master thesis on computer science,    Ramasany Gowthami participated in the creation of an Android    app by means of which users get together to crack a modern    cryptographic code.  <\/p>\n<p>    Modern cryptography is not infallible. All encryption types,    among which we can find the widely used RSA, can theoretically    be broken. If so, how to ensure that our data remains    protected? The answer lies on the time and computational effort    required to break the code. Cracking a sufficiently long    encryption key can be expensive up to the point    of being unattainable in practice.  <\/p>\n<p>    The LACAL laboratory at EPFL, renowned for its many    achievements in the field of cryptography and led by Arjen    Lenstra, was interested in solving a problem based on elliptic    curve cryptography developed in the early 1980s.    After having thwarted the security of our passwords by using a    network of 300 PlayStation 3 game consoles, the researchers    decided to take on this new challenge, on this occasion by    using thousands of smartphones working together. \"All of us do    not necessarily have a computer for running the algorithm,    making it difficult to gather a few dozen. On the other hand,    everyone has a smartphone, and launching the application    becomes a child's game!\" said Ramasany Gowthami, a master    student in computer science that    participated on the project. By running the algorithm a very    large number of times the code may be broken eventually. To do    this, users simply launch the application and press a button.    The app also allows users to register, form teams, view their    statistics and thus measure their participation in this    unprecedented undertaking.  <\/p>\n<p>    Despite her apprehension about the mathematical part of the    project, Ramasany Gowthami does not regret having plunged into    this domain for her master's thesis. She acknowledges that the    part of the implementation of which she was in charge required    long working weeks to get to understand the whole project.    \"Since I was in charge of the interface between the program's    components, I had to have a perfect knowledge of the elements    of the algorithm,\" she explains. \"What is my best memory? When    I managed to put it all in my head and was able to grasp the    entire project! \".  <\/p>\n<p>    Why this desire to crack an unbroken cryptographic system at    all costs? \"It's just as important as designing new and more    efficient systems,\" she explained. \"We know that the systems    can be broken at some point. That's why it is important to    constantly assess them in order to know their limitations and    adapt them if they are no longer safe. This can be done, for    example, by extending the length of the encryption key. Perhaps    a similar evaluation work on the SSL would have prevented the    (in) famous Heartbleed bug!\"<\/p>\n<p>     Explore further:     New type of cryptography that can better resist \"dictionary    attacks\"  <\/p>\n<p>      Cryptographers in China have have developed a new type of      cryptography that can better resist so-called offline      \"dictionary attacks\", denial of service (DoS) hacks, and      cracks involving eavesdroppers. Their approach, reported ...    <\/p>\n<p>      (Phys.org) A protocol based on \"discrete logarithms\", deemed      as one of the candidates for the Internet's future security      systems, was decrypted by EPFL researchers. Allegedly      tamper-proof, it could only ...    <\/p>\n<p>      Fujitsu Laboratories, National Institute of Information and      Communications Technology and Kyushu University jointly broke      a world cryptography record with the successful cryptanalysis      of a 278-digit (923-bit)-long ...    <\/p>\n<p><!-- Auto Generated --><\/p>\n<p>Link:<br \/>\n<a target=\"_blank\" href=\"http:\/\/phys.org\/news328167143.html\/RK=0\/RS=rpunWXwdEt0dqvBegsUv2kNJL1U-\" title=\"Smartphones set out to decipher a cryptographic system\">Smartphones set out to decipher a cryptographic system<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p> 13 hours ago by Sbastien Corthsy Ramasany Gowthami. <\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1600],"tags":[],"class_list":["post-25682","post","type-post","status-publish","format-standard","hentry","category-cryptography"],"_links":{"self":[{"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/posts\/25682"}],"collection":[{"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/comments?post=25682"}],"version-history":[{"count":0,"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/posts\/25682\/revisions"}],"wp:attachment":[{"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/media?parent=25682"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/categories?post=25682"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/euvolution.com\/open-source-convergence\/wp-json\/wp\/v2\/tags?post=25682"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}