{"title":"Public-Key Cryptosystems and Signature Schemes from $$p$$ -Adic Lattices","authors":"","doi":"10.1134/s2070046624010035","DOIUrl":null,"url":null,"abstract":"<span> <h3>Abstract</h3> <p> In 2018, the longest vector problem and closest vector problem in local fields were introduced, as the <span> <span>\\(p\\)</span> </span>-adic analogues of the shortest vector problem and closest vector problem in lattices of Euclidean spaces. They are considered to be hard and useful in constructing cryptographic primitives, but no applications in cryptography were given. In this paper, we construct the first signature scheme and public-key encryption cryptosystem based on <span> <span>\\(p\\)</span> </span>-adic lattice by proposing a trapdoor function with the norm-orthogonal basis of <span> <span>\\(p\\)</span> </span>-adic lattice. These cryptographic schemes have reasonable key size and the signature scheme is efficient, while the encryption scheme works only for short messages, which shows that <span> <span>\\(p\\)</span> </span>-adic lattice can be a new alternative to construct cryptographic primitives and well worth studying. </p> </span>","PeriodicalId":44654,"journal":{"name":"P-Adic Numbers Ultrametric Analysis and Applications","volume":"15 1","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"P-Adic Numbers Ultrametric Analysis and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1134/s2070046624010035","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
In 2018, the longest vector problem and closest vector problem in local fields were introduced, as the \(p\)-adic analogues of the shortest vector problem and closest vector problem in lattices of Euclidean spaces. They are considered to be hard and useful in constructing cryptographic primitives, but no applications in cryptography were given. In this paper, we construct the first signature scheme and public-key encryption cryptosystem based on \(p\)-adic lattice by proposing a trapdoor function with the norm-orthogonal basis of \(p\)-adic lattice. These cryptographic schemes have reasonable key size and the signature scheme is efficient, while the encryption scheme works only for short messages, which shows that \(p\)-adic lattice can be a new alternative to construct cryptographic primitives and well worth studying.
期刊介绍:
This is a new international interdisciplinary journal which contains original articles, short communications, and reviews on progress in various areas of pure and applied mathematics related with p-adic, adelic and ultrametric methods, including: mathematical physics, quantum theory, string theory, cosmology, nanoscience, life sciences; mathematical analysis, number theory, algebraic geometry, non-Archimedean and non-commutative geometry, theory of finite fields and rings, representation theory, functional analysis and graph theory; classical and quantum information, computer science, cryptography, image analysis, cognitive models, neural networks and bioinformatics; complex systems, dynamical systems, stochastic processes, hierarchy structures, modeling, control theory, economics and sociology; mesoscopic and nano systems, disordered and chaotic systems, spin glasses, macromolecules, molecular dynamics, biopolymers, genomics and biology; and other related fields.