{"id":19519,"date":"2025-03-07T10:03:42","date_gmt":"2025-03-07T10:03:42","guid":{"rendered":"https:\/\/www.hotelsalepage.com\/feed\/cision-pr-newswire\/xjtlu-team-sets-code-breaking-record-for-testing-post-quantum-online-security\/"},"modified":"2025-03-07T10:03:42","modified_gmt":"2025-03-07T10:03:42","slug":"xjtlu-team-sets-code-breaking-record-for-testing-post-quantum-online-security-3","status":"publish","type":"post","link":"https:\/\/thaipropertynews.com\/feeds\/?p=19519","title":{"rendered":"XJTLU team sets code-breaking record for testing post-quantum online security"},"content":{"rendered":"<p><span class=\"legendSpanClass\">SUZHOU, <span class=\"xn-location\">China<\/span><\/span>, <span class=\"legendSpanClass\"><span class=\"xn-chron\">March 7, 2025<\/span><\/span> \/PRNewswire\/ &#8212; On 4 March, a research team led by Professor\u00a0Jintai Ding, Dean of the School of Mathematics and Physics at Xi&#8217;an Jiaotong-<span class=\"xn-org\">Liverpool University<\/span> (XJTLU), set a new code-breaking world record for the Lattice Shortest Vector Problem (SVP) in the International Open Darmstadt SVP Challenge. This marks a significant achievement in strengthening cybersecurity in the age of quantum computing.<\/p>\n<div class=\"PRN_ImbeddedAssetReference\">\n<p> <a href=\"https:\/\/mma.prnasia.com\/media2\/2636645\/Prof__Jintai_Ding_1.html\" target=\"_blank\" rel=\"nofollow\"> <img decoding=\"async\" src=\"https:\/\/mma.prnasia.com\/media2\/2636645\/Prof__Jintai_Ding_1.jpg?p=medium600\" title=\"Professor Jintai Ding\" alt=\"Professor Jintai Ding\" \/> <\/a> <br \/><span>Professor Jintai Ding<\/span><\/p>\n<\/div>\n<p>The rapid advancement of quantum computing technology poses a serious threat to the current encryption methods used for e-commerce, telecommunications and digital signatures. Finding alternative encryption solutions has, therefore, become a global priority. Lattice SVP-based cryptography has been identified as a promising next-generation cryptographic standard capable of safeguarding sensitive data from quantum computer attacks.<\/p>\n<p>To address vulnerabilities in cryptographic standards, the cryptography community established the global SVP challenge in 2010, attracting leading mathematicians and computer scientists worldwide to explore the limits of lattice SVP.<\/p>\n<p>Professor Ding says: &#8220;From a research perspective, our new record for solving the problem enhances our understanding of lattice-based cryptography&#8217;s security foundations, providing empirical evidence to inform future post-quantum cryptographic standards.&#8221;<\/p>\n<p>&#8220;In practical terms, it helps security experts more accurately assess the boundaries of existing cryptographic systems and guide the development of secure digital infrastructure.&#8221;<\/p>\n<p>&#8220;The security of lattice-based cryptography fundamentally depends on the computational difficulty of solving the SVP,&#8221; explains Professor Ding. &#8220;The problem&#8217;s difficulty can be increased by raising the number of dimensions of the lattice. The more dimensions there are, the harder it becomes to solve, thereby enhancing the system&#8217;s security.&#8221;<\/p>\n<p>With the new record, Professor Ding&#8217;s team has successfully solved the SVP for 200 dimensions, the highest dimension currently supported for submission on the SVP Challenge website.<\/p>\n<p>&#8220;Each additional 10 dimensions increases the computational difficulty by roughly an order of magnitude,&#8221; says Professor Ding. &#8220;A decade ago, the record stood at about 130 dimensions and reaching 200 dimensions seemed almost impossible. Yet today, we&#8217;ve solved it with relatively modest academic computing resources. This represents not only technological progress but also a triumph of human ingenuity.&#8221;<\/p>\n<p>Professor Ding notes that current cryptographic standards would become vulnerable if SVP problems of around 400 dimensions could be solved, potentially compromising global digital infrastructure.<\/p>\n<p>He says: &#8220;Solving the 200-dimensional SVP problem not only showcases XJTLU&#8217;s research strength at the forefront of cryptography but also provides important references for global lattice-based cryptographic security research.&#8221;<\/p>","protected":false},"excerpt":{"rendered":"<p><!-- wp:html --><\/p>\n<p><span class=\"legendSpanClass\">SUZHOU, <span class=\"xn-location\">China<\/span><\/span>, <span class=\"legendSpanClass\"><span class=\"xn-chron\">March 7, 2025<\/span><\/span> \/PRNewswire\/ &#8212; On 4 March, a research team led by Professor\u00a0Jintai Ding, Dean of the School of Mathematics and Physics at Xi&#8217;an Jiaotong-<span class=\"xn-org\">Liverpool University<\/span> (XJTLU), set a new code-breaking world record for the Lattice Shortest Vector Problem (SVP) in the International Open Darmstadt SVP Challenge. This marks a significant achievement in strengthening cybersecurity in the age of quantum computing.<\/p>\n<div class=\"PRN_ImbeddedAssetReference\">\n<p> <a href=\"https:\/\/mma.prnasia.com\/media2\/2636645\/Prof__Jintai_Ding_1.html\" target=\"_blank\" rel=\"nofollow\"> <img decoding=\"async\" src=\"https:\/\/mma.prnasia.com\/media2\/2636645\/Prof__Jintai_Ding_1.jpg?p=medium600\" title=\"Professor Jintai Ding\" alt=\"Professor Jintai Ding\" \/> <\/a> <br \/><span>Professor Jintai Ding<\/span><\/p>\n<\/div>\n<p>The rapid advancement of quantum computing technology poses a serious threat to the current encryption methods used for e-commerce, telecommunications and digital signatures. Finding alternative encryption solutions has, therefore, become a global priority. Lattice SVP-based cryptography has been identified as a promising next-generation cryptographic standard capable of safeguarding sensitive data from quantum computer attacks.<\/p>\n<p>To address vulnerabilities in cryptographic standards, the cryptography community established the global SVP challenge in 2010, attracting leading mathematicians and computer scientists worldwide to explore the limits of lattice SVP.<\/p>\n<p>Professor Ding says: &#8220;From a research perspective, our new record for solving the problem enhances our understanding of lattice-based cryptography&#8217;s security foundations, providing empirical evidence to inform future post-quantum cryptographic standards.&#8221;<\/p>\n<p>&#8220;In practical terms, it helps security experts more accurately assess the boundaries of existing cryptographic systems and guide the development of secure digital infrastructure.&#8221;<\/p>\n<p>&#8220;The security of lattice-based cryptography fundamentally depends on the computational difficulty of solving the SVP,&#8221; explains Professor Ding. &#8220;The problem&#8217;s difficulty can be increased by raising the number of dimensions of the lattice. The more dimensions there are, the harder it becomes to solve, thereby enhancing the system&#8217;s security.&#8221;<\/p>\n<p>With the new record, Professor Ding&#8217;s team has successfully solved the SVP for 200 dimensions, the highest dimension currently supported for submission on the SVP Challenge website.<\/p>\n<p>&#8220;Each additional 10 dimensions increases the computational difficulty by roughly an order of magnitude,&#8221; says Professor Ding. &#8220;A decade ago, the record stood at about 130 dimensions and reaching 200 dimensions seemed almost impossible. Yet today, we&#8217;ve solved it with relatively modest academic computing resources. This represents not only technological progress but also a triumph of human ingenuity.&#8221;<\/p>\n<p>Professor Ding notes that current cryptographic standards would become vulnerable if SVP problems of around 400 dimensions could be solved, potentially compromising global digital infrastructure.<\/p>\n<p>He says: &#8220;Solving the 200-dimensional SVP problem not only showcases XJTLU&#8217;s research strength at the forefront of cryptography but also provides important references for global lattice-based cryptographic security research.&#8221;<\/p>\n<p><!-- \/wp:html --><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"rop_custom_images_group":[],"rop_custom_messages_group":[],"rop_publish_now":"initial","rop_publish_now_accounts":[],"rop_publish_now_history":[],"rop_publish_now_status":"pending","footnotes":""},"categories":[5,7],"tags":[],"class_list":["post-19519","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-cision-pr-newswire","category-cision-pr-newswire-en"],"_links":{"self":[{"href":"https:\/\/thaipropertynews.com\/feeds\/index.php?rest_route=\/wp\/v2\/posts\/19519","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/thaipropertynews.com\/feeds\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/thaipropertynews.com\/feeds\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/thaipropertynews.com\/feeds\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/thaipropertynews.com\/feeds\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=19519"}],"version-history":[{"count":0,"href":"https:\/\/thaipropertynews.com\/feeds\/index.php?rest_route=\/wp\/v2\/posts\/19519\/revisions"}],"wp:attachment":[{"href":"https:\/\/thaipropertynews.com\/feeds\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=19519"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/thaipropertynews.com\/feeds\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=19519"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/thaipropertynews.com\/feeds\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=19519"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}