Simultaneous approximation problems of \(p\)-adic numbers and \(p\)-adic knapsack cryptosystems -- Alice in \(p\)-adic numberland
From MaRDI portal
Publication:1702094
DOI10.1134/S207004661604004XzbMath1387.94083OpenAlexW2548349553MaRDI QIDQ1702094
Sh. Kamada, H. Inoue, Koichiro Naito
Publication date: 27 February 2018
Published in: \(p\)-Adic Numbers, Ultrametric Analysis, and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s207004661604004x
Cites Work
- Approximation lattices of \(p\)-adic numbers
- Improved low-density subset sum algorithms
- Applied algebraic dynamics
- T-functions revisited: new criteria for bijectivity/transitivity
- Estimating Key Sizes for High Dimensional Lattice-Based Systems
- The Computational Complexity of Simultaneous Diophantine Approximation Problems
- Solving low-density subset sum problems
- Predicting Lattice Reduction
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Simultaneous approximation problems of \(p\)-adic numbers and \(p\)-adic knapsack cryptosystems -- Alice in \(p\)-adic numberland