GOLDIE RANK OF PRIMITIVE QUOTIENTS VIA LATTICE POINT ENUMERATION
نویسندگان
چکیده
منابع مشابه
COMPUTATIONAL ENUMERATION OF POINT DEFECT CLUSTERS IN DOUBLE- LATTICE CRYSTALS
The cluster representation matrices have already been successfully used to enumerate close-packed vacancy clusters in all single-lattice crystals [I, 2]. Point defect clusters in double-lattice crystals may have identical geometry but are distinct due to unique atomic postions enclosing them. The method of representation matrices is extended to make it applicable to represent and enumerate ...
متن کاملcomputational enumeration of point defect clusters in double- lattice crystals
the cluster representation matrices have already been successfully used to enumerate close-packed vacancy clusters in all single-lattice crystals [i, 2]. point defect clusters in double-lattice crystals may have identical geometry but are distinct due to unique atomic postions enclosing them. the method of representation matrices is extended to make it applicable to represent and enumerate the ...
متن کاملLattice Point Enumeration on Block Reduced Bases
When analyzing lattice-based cryptosystems, we often need to solve the Shortest Vector Problem (SVP) in some lattice associated to the system under scrutiny. The go-to algorithms in practice to solve SVP are enumeration algorithms, which usually consist of a preprocessing step, followed by an exhaustive search. Obviously, the two steps offer a trade-off and should be balanced in their running t...
متن کاملFrobenius Numbers by Lattice Point Enumeration
The Frobenius number g(A) of a set A = (a1, a2, . . . , an) of positive integers is the largest integer not representable as a nonnegative linear combination of the ai. We interpret the Frobenius number in terms of a discrete tiling of the integer lattice of dimension n−1 and obtain a fast algorithm for computing it. The algorithm appears to run in average time that is softly quadratic and we p...
متن کاملFast Lattice Point Enumeration with Minimal Overhead
Enumeration algorithms are the best currently known methods to solve lattice problems, both in theory (within the class of polynomial space algorithms), and in practice (where they are routinely used to evaluate the concrete security of lattice cryptography). However, there is an uncomfortable gap between our theoretical understanding and practical performance of lattice point enumeration algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Glasgow Mathematical Journal
سال: 2013
ISSN: 0017-0895,1469-509X
DOI: 10.1017/s0017089513000566