14 citations · 35 across the 11 of their papers we have counts for
11 papers
PotLLL: A Polynomial Time Version of LLL With Deep Insertions
Felix Fontein, Michael Schneider, Urs Wagner
Lattice reduction algorithms have numerous applications in number theory, algebra, as well as in cryptanalysis. The most famous algorithm for lattice reduction is the LLL algorithm…
A Polynomial Time Version of LLL With Deep Insertions
Felix Fontein, Michael Schneider, Urs Wagner
Lattice reduction algorithms have numerous applications in number theory, algebra, as well as in cryptanalysis. The most famous algorithm for lattice reduction is the LLL algorithm…
On the Probability of Generating a Lattice
Felix Fontein, Pawel Wocjan
We study the problem of determining the probability that m vectors selected uniformly at random from the intersection of the full-rank lattice L in R^n and the window [0,B)^n gener…
On Burst Error Correction and Storage Security of Noisy Data
Felix Fontein, Kyle Marshall, Joachim Rosenthal +2
Secure storage of noisy data for authentication purposes usually involves the use of error correcting codes. We propose a new model scenario involving burst errors and present for…
Quantum Algorithm for Computing the Period Lattice of an Infrastructure
Felix Fontein, Pawel Wocjan
We present a quantum algorithm for computing the period lattice of infrastructures of fixed dimension. The algorithm applies to infrastructures that satisfy certain conditions. The…
Rigorous Computation of Fundamental Units in Algebraic Number Fields
Felix Fontein, Michael J. Jacobson
We present an algorithm that unconditionally computes a representation of the unit group of a number field of discriminant , given a full-rank subgroup as input, in asymptotic…
Class Number and Regulator Computation in Purely Cubic Function Fields of Unit Rank Two
Felix Fontein, Eric Landquist, Renate Scheidler
We describe and give computational results of a procedure to compute the divisor class number and regulator of most purely cubic function fields of unit rank 2. Our implementation…
Explicit Methods for Radical Function Fields over Finite Fields
Felix Fontein
We develop explicit formulas and algorithms for arithmetic in radical function fields K/k(x) over finite constant fields. First, we classify which places of k(x) whose local integr…
Holes in the Infrastructure of Global Hyperelliptic Function Fields
Felix Fontein
We prove that the number of "hole elements" in the infrastructure of a hyperelliptic function field of genus with finite constant field $\F_q$ with places at…
The Infrastructure of a Global Field of Arbitrary Unit Rank
Felix Fontein
In this paper, we show a general way to interpret the infrastructure of a global field of arbitrary unit rank. This interpretation generalizes the prior concepts of the giant step…
Groups from Cyclic Infrastructures and Pohlig-Hellman in Certain Infrastructures
Felix Fontein
In discrete logarithm based cryptography, a method by Pohlig and Hellman allows solving the discrete logarithm problem efficiently if the group order is known and has no large prim…