arXiv subjects

Jens Zumbrägel

Publications and source records attributed to Jens Zumbrägel.

33 records · Page 2Linked to original sources

arXiv2016

Indiscreet logarithms in finite fields of small characteristic

Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) in finite fields of small characteristic, despite progress having remained essentially static for nearly thirty years, with the best known algorithms being of subexponential complexity. In this expository article we describe the key insights and constructions which culminated in two independent quasi-polynomial algorithms. To put these developments into both a historical and a mathematical context, as well as to provide a comparison with the cases of so-called large and medium characteristic fields, we give an overview of the state-of-the-art algorithms for computing discrete logarithms in all finite fields. Our presentation aims to guide the reader through the algorithms and their complexity analyses ab initio.

math.NT↗

arXiv2015

Every simple compact semiring is finite

A Hausdorff topological semiring is called simple if every non-zero continuous homomorphism into another Hausdorff topological semiring is injective. Classical work by Anzai and Kaplansky implies that any simple compact ring is finite. We generalize this result by proving that every simple compact semiring is finite, i.e., every infinite compact semiring admits a proper non-trivial quotient.

math.RA↗

arXiv2015

Simpleness of Leavitt Path Algebras with Coefficients in a Commutative Semiring

In this paper, we study ideal- and congruence-simpleness for the Leavitt path algebras of directed graphs with coefficients in a commutative semiring S, as well as establish some fundamental properties of those algebras. We provide a complete characterization of ideal-simple Leavitt path algebras with coefficients in a semifield S that extends the well-known characterizations when the ground semiring S is a field. Also, extending the well-known characterizations when S is a field or commutative ring, we present a complete characterization of congruence-simple Leavitt path algebras over row-finite graphs with coefficients in a commutative semiring S.

math.RA↗

arXiv2014

New Results on the Pseudoredundancy

The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding minimum pseudoweight equals its minimum Hamming distance. By using the value assignment of Chen and Kløve we present new results on the pseudocodeword redundancy of binary linear codes. In particular, we give several upper bounds on the pseudoredundancies of certain codes with repeated and added coordinates and of certain shortened subcodes. We also investigate several kinds of k-dimensional binary codes and compute their exact pseudocodeword redundancy.

cs.IT↗

arXiv2014

Breaking `128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in ${\mathbb F}_{2^{4 \cdot 1223}}$ and ${\mathbb F}_{2^{12 \cdot 367}}$)

In late 2012 and early 2013 the discrete logarithm problem (DLP) in finite fields of small characteristic underwent a dramatic series of breakthroughs, culminating in a heuristic quasi-polynomial time algorithm, due to Barbulescu, Gaudry, Joux and Thomé. Using these developments, Adj, Menezes, Oliveira and Rodríguez-Henríquez analysed the concrete security of the DLP, as it arises from pairings on (the Jacobians of) various genus one and two supersingular curves in the literature, which were originally thought to be $128$-bit secure. In particular, they suggested that the new algorithms have no impact on the security of a genus one curve over ${\mathbb F}_{2^{1223}}$, and reduce the security of a genus two curve over ${\mathbb F}_{2^{367}}$ to $94.6$ bits. In this paper we propose a new field representation and efficient general descent principles which together make the new techniques far more practical. Indeed, at the `128-bit security level' our analysis shows that the aforementioned genus one curve has approximately $59$ bits of security, and we report a total break of the genus two curve.

math.NT↗

arXiv2013

MacWilliams' Extension Theorem for Bi-Invariant Weights over Finite Principal Ideal Rings

A finite ring R and a weight w on R satisfy the Extension Property if every R-linear w-isometry between two R-linear codes in R^n extends to a monomial transformation of R^n that preserves w. MacWilliams proved that finite fields with the Hamming weight satisfy the Extension Property. It is known that finite Frobenius rings with either the Hamming weight or the homogeneous weight satisfy the Extension Property. Conversely, if a finite ring with the Hamming or homogeneous weight satisfies the Extension Property, then the ring is Frobenius. This paper addresses the question of a characterization of all bi-invariant weights on a finite ring that satisfy the Extension Property. Having solved this question in previous papers for all direct products of finite chain rings and for matrix rings, we have now arrived at a characterization of these weights for finite principal ideal rings, which form a large subclass of the finite Frobenius rings. We do not assume commutativity of the rings in question.

math.RA↗

arXiv2012

Finite simple additively idempotent semirings

Since for the classification of finite (congruence-)simple semirings it remains to classify the additively idempotent semirings, we progress on the characterization of finite simple additively idempotent semirings as semirings of join-morphisms of a semilattice. We succeed in doing this for many cases, amongst others for every semiring of this kind with an additively neutral element. As a consequence we complete the classification of finite simple semirings with an additively neutral element. To complete the classification of all finite simple semirings it remains to classify some very specific semirings, which will be discussed here. Our results employ the theory of idempotent irreducible semimodules, which we develop further.

math.RA↗

arXiv2012

Invertible matrices over finite additively idempotent semirings

We investigate invertible matrices over finite additively idempotent semirings. The main result provides a criterion for the invertibility of such matrices. We also give a construction of the inverse matrix and a formula for the number of invertible matrices.

math.RA↗

arXiv2012

On the Pseudocodeword Redundancy of Binary Linear Codes

The AWGNC, BSC, and max-fractional pseudocodeword redundancies of a binary linear code are defined to be the smallest number of rows in a parity-check matrix such that the corresponding minimum pseudoweight is equal to the minimum Hamming distance of the code. It is shown that most codes do not have a finite pseudocodeword redundancy. Also, upper bounds on the pseudocodeword redundancy for some families of codes, including codes based on designs, are provided. The pseudocodeword redundancies for all codes of small length (at most 9) are computed. Furthermore, comprehensive results are provided on the cases of cyclic codes of length at most 250 for which the eigenvalue bound of Vontobel and Koetter is sharp.

cs.IT↗

arXiv2012

On the algebraic representation of selected optimal non-linear binary codes

Revisiting an approach by Conway and Sloane we investigate a collection of optimal non-linear binary codes and represent them as (non-linear) codes over Z4. The Fourier transform will be used in order to analyze these codes, which leads to a new algebraic representation involving subgroups of the group of units in a certain ring. One of our results is a new representation of Best's (10, 40, 4) code as a coset of a subgroup in the group of invertible elements of the group ring Z4[Z5]. This yields a particularly simple algebraic decoding algorithm for this code. The technique at hand is further applied to analyze Julin's (12, 144, 4) code and the (12, 24, 12) Hadamard code. It can also be used in order to construct a (non-optimal) binary (14, 56, 6) code.

cs.IT↗

arXiv2011

Characteristics of Invariant Weights Related to Code Equivalence over Rings

The Equivalence Theorem states that, for a given weight on the alphabet, every linear isometry between linear codes extends to a monomial transformation of the entire space. This theorem has been proved for several weights and alphabets, including the original MacWilliams' Equivalence Theorem for the Hamming weight on codes over finite fields. The question remains: What conditions must a weight satisfy so that the Extension Theorem will hold? In this paper we provide an algebraic framework for determining such conditions, generalising the approach taken in [Greferath, Honold '06].

math.RA↗

arXiv2011

On Simpleness of Semirings and Complete Semirings

In this paper, among other results, there are described (complete) simple - simultaneously ideal- and congruence-simple - endomorphism semirings of (complete) idempotent commutative monoids; it is shown that the concepts of simpleness, congruence-simpleness and ideal-simpleness for (complete) endomorphism semirings of projective semilattices (projective complete lattices) in the category of semilattices coincide iff those semilattices are finite distributive lattices; there are described congruence-simple complete hemirings and left artinian congruence-simple complete hemirings. Considering the relationship between the concepts of "Morita equivalence" and "simpleness" in the semiring setting, we have obtained the following results: The ideal-simpleness, congruence-simpleness and simpleness of semirings are Morita invariant properties; A complete description of simple semirings containing the infinite element; The representation theorem - "Double Centralizer Property" - for simple semirings; A complete description of simple semirings containing a projective minimal one-sided ideal; A characterization of ideal-simple semirings having either infinite elements or a projective minimal one-sided ideal; A confirmation of Conjecture of [Kat04a] and solving Problem 3.9 of [Kat04b] in the classes of simple semirings containing either infinite elements or projective minimal left (right) ideals, showing, respectively, that semirings of those classes are not perfect and the concepts of "mono-flatness" and "flatness" for semimodules over semirings of those classes are the same. Finally, we give a complete description of ideal-simple, artinian additively idempotent chain semirings, as well as of congruence-simple, lattice-ordered semirings.

math.RA↗

arXiv2011

Algebraic Decoding of Negacyclic Codes Over Z_4

In this article we investigate Berlekamp's negacyclic codes and discover that these codes, when considered over the integers modulo 4, do not suffer any of the restrictions on the minimum distance observed in Berlekamp's original papers. The codes considered here have minimim Lee distance at least 2t+1, where the generator polynomial of the code has roots z,z^3,...,z^{2t+1} for a primitive 2nth root of unity z in a Galois extension of Z4. No restriction on t is imposed. We present an algebraic decoding algorithm for this class of codes that corrects any error pattern of Lee weight at most t. Our treatment uses Grobner bases and the decoding complexity is quadratic in t.

math.CO↗

arXiv2009

On simple ringoids

A ringoid is a set with two binary operations that are linked by the distributive laws. We study special classes of ringoids that are congruence-simple or ideal-simple. In particular, we examine generalised parasemifields and non-associative semirings.

math.RA↗

arXiv2007

Classification of finite congruence-simple semirings with zero

Our main result states that a finite semiring of order >2 with zero which is not a ring is congruence-simple if and only if it is isomorphic to a `dense' subsemiring of the endomorphism semiring of a finite idempotent commutative monoid. We also investigate those subsemirings further, addressing e.g. the question of isomorphy.

math.RA↗