E. S. Malygina, A. V. Kutsenko, S. A. Novoselov, N. S. Kolesnikov, A. O. Bakharev, I. S. Khilchuk, A. S. Shaporenko, N. N. Tokareva
{"title":"后量子密码系统：开放问题与解决方案。基于网格的密码系统","authors":"E. S. Malygina, A. V. Kutsenko, S. A. Novoselov, N. S. Kolesnikov, A. O. Bakharev, I. S. Khilchuk, A. S. Shaporenko, N. N. Tokareva","doi":"10.1134/s1990478923040087","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p> The paper provides an overview of the main approaches to the construction of\npost-quantum cryptographic systems that are currently used. The area of lattice-based\ncryptography is analyzed in detail. We give the description and characterization of some known\nlattice-based cryptosystems whose resilience is based on the complexity of the shortest vector\nproblem, learning with errors problem, and their variations. The main approaches to solving the\nproblems from lattice theory, on which attacks on the corresponding cryptosystems are based, are\nanalyzed. In particular, some known theoretical estimates of time and memory complexity of\nlattice basis reduction and lattice sieving algorithms are presented.\n</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":null,"pages":null},"PeriodicalIF":0.5800,"publicationDate":"2024-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Post-Quantum Cryptosystems: Open Problems and Solutions. Lattice-Based Cryptosystems\",\"authors\":\"E. S. Malygina, A. V. Kutsenko, S. A. Novoselov, N. S. Kolesnikov, A. O. Bakharev, I. S. Khilchuk, A. S. Shaporenko, N. N. Tokareva\",\"doi\":\"10.1134/s1990478923040087\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<h3 data-test=\\\"abstract-sub-heading\\\">Abstract</h3><p> The paper provides an overview of the main approaches to the construction of\\npost-quantum cryptographic systems that are currently used. The area of lattice-based\\ncryptography is analyzed in detail. We give the description and characterization of some known\\nlattice-based cryptosystems whose resilience is based on the complexity of the shortest vector\\nproblem, learning with errors problem, and their variations. The main approaches to solving the\\nproblems from lattice theory, on which attacks on the corresponding cryptosystems are based, are\\nanalyzed. In particular, some known theoretical estimates of time and memory complexity of\\nlattice basis reduction and lattice sieving algorithms are presented.\\n</p>\",\"PeriodicalId\":607,\"journal\":{\"name\":\"Journal of Applied and Industrial Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.5800,\"publicationDate\":\"2024-02-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Applied and Industrial Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1134/s1990478923040087\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied and Industrial Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1134/s1990478923040087","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
Post-Quantum Cryptosystems: Open Problems and Solutions. Lattice-Based Cryptosystems
Abstract
The paper provides an overview of the main approaches to the construction of
post-quantum cryptographic systems that are currently used. The area of lattice-based
cryptography is analyzed in detail. We give the description and characterization of some known
lattice-based cryptosystems whose resilience is based on the complexity of the shortest vector
problem, learning with errors problem, and their variations. The main approaches to solving the
problems from lattice theory, on which attacks on the corresponding cryptosystems are based, are
analyzed. In particular, some known theoretical estimates of time and memory complexity of
lattice basis reduction and lattice sieving algorithms are presented.
期刊介绍：
Journal of Applied and Industrial Mathematics is a journal that publishes original and review articles containing theoretical results and those of interest for applications in various branches of industry. The journal topics include the qualitative theory of differential equations in application to mechanics, physics, chemistry, biology, technical and natural processes; mathematical modeling in mechanics, physics, engineering, chemistry, biology, ecology, medicine, etc.; control theory; discrete optimization; discrete structures and extremum problems; combinatorics; control and reliability of discrete circuits; mathematical programming; mathematical models and methods for making optimal decisions; models of theory of scheduling, location and replacement of equipment; modeling the control processes; development and analysis of algorithms; synthesis and complexity of control systems; automata theory; graph theory; game theory and its applications; coding theory; scheduling theory; and theory of circuits.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
