The worst-case hardness of finding short vectors in ideals of cyclotomic number fields (Ideal-SVP) is a central matter in lattice based cryptography. Assuming the worst-case hardness of Ideal-SVP allows to prove the Ring-LWE and Ring-SIS assumptions, and t ...
Nowadays, one area of research in cryptanalysis is solving the Discrete Logarithm Problem (DLP) in finite groups whose group representation is not yet exploited. For such groups, the best one can do is using a generic method to attack the DLP, the fastest ...
Let B be a positive quaternion algebra, and let O subset of B be an Eichler order. There is associated, in a natural way, a variety X = X(O) the connected components of which are indexed by the ideal classes of O and are isomorphic to spheres. This variety ...
We study periodic torus orbits on spaces of lattices. Using the action of the group of adelic points of the underlying tori, we define a natural equivalence relation on these orbits, and show that the equivalence classes become uniformly distributed. This ...