Upper Bound for the Coefficients of the Shortest Vector of Random Lattice

被引：0

作者：

Kaminaga, Masahiro ^{[1
]}

机构：

[1] Tohoku Gakuin Univ, Dept Informat Technol Engn, Sendai Shi 9858537, Japan

来源：

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2023年 / E106A卷 / 12期

基金：

日本学术振兴会;

关键词：

lattice; shortest vector problem; REDUCTION;

D O I：

10.1587/transfun.2023EAL2032

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper shows that upper bounds on the coefficients of the shortest vector of a lattice can be represented using the smallest eigenvalue of the Gram matrix for the lattice, obtains its distribution for high dimensional random Goldstein-Mayer lattice, and applies it to determine the percentage of zeros of coefficient vector.

引用

页码：1585 / 1588

页数：4

共 50 条

[31] Mott Law as Upper Bound for a Random Walk in a Random Environment
A. Faggionato
P. Mathieu
Communications in Mathematical Physics, 2008, 281 : 263 - 286
[32] THE UPPER BOUND OF VECTOR MULTIPLICATION BY BINARY MATRIX
LOSEV, VV
RADIOTEKHNIKA I ELEKTRONIKA, 1980, 25 (11): : 2464 - 2467
[33] On the upper bound for the density of any injective vector
Murin, D. M.
PRIKLADNAYA DISKRETNAYA MATEMATIKA, 2013, 19 (01): : 117 - 124
[34] AN ALGORITHM FOR FINDING A SHORTEST VECTOR IN A 2-DIMENSIONAL MODULAR LATTICE
LEMPEL, M
PAZ, A
THEORETICAL COMPUTER SCIENCE, 1994, 125 (02) : 229 - 241
[35] The shortest vector in a lattice is hard to approximate to within some constant.
Micciancio, D
39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 92 - 98
[36] Meta-heuristic approaches to solve shortest lattice vector problem
Reddy, V. Dinesh
Rao, G. S. V. R. K.
JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2021, 24 (01): : 81 - 91
[37] UPPER BOUND TO THE SPIN CORRELATION-FUNCTION OF THE N-VECTOR MODEL WITH RANDOM ANISOTROPIC INTERACTIONS
HORIGUCHI, T
MORITA, T
PHYSICS LETTERS A, 1981, 86 (08) : 432 - 436
[38] Finding a shortest vector in a two-dimensional lattice module m
Rote, G
THEORETICAL COMPUTER SCIENCE, 1997, 172 (1-2) : 303 - 308
[39] Finding a shortest vector in a two-dimensional lattice modulo m
Technische Universitat Graz, Graz, Austria
Theor Comput Sci, 1-2 (303-308):
[40] An upper bound on random walks on dihedral groups
McCollum, Joseph
STATISTICS & PROBABILITY LETTERS, 2013, 83 (08) : 1894 - 1900

← 1 2 3 4 5 →