Jens Zumbrägel

Affiliations:
  • University of Passau, Faculty of Computer Science and Mathematics, Germany
  • University of Zurich, Mathematics Institute, Switzerland (PhD 2008)


According to our database1, Jens Zumbrägel authored at least 31 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Pseudoredundancy for the Bit-Flipping Algorithm.
CoRR, 2024

2023
Cryptographic Group and Semigroup Actions.
IACR Cryptol. ePrint Arch., 2023

DEFEND: Towards Verifiable Delay Functions from Endomorphism Rings.
IACR Cryptol. ePrint Arch., 2023

A Plaque Test for Redundancies in Relational Data.
Proceedings of the Joint Proceedings of Workshops at the 49th International Conference on Very Large Data Bases (VLDB 2023), Vancouver, Canada, August 28, 2023

2022
List Decoding of Quaternary Codes in the Lee Metric.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
Computation of a 30750-bit binary field discrete logarithm.
Math. Comput., 2021

Lattice Enumeration on GPUs for fplll.
IACR Cryptol. ePrint Arch., 2021

Efficient Decoding of Gabidulin Codes over Galois Rings.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2018
Indiscreet logarithms in finite fields of small characteristic.
Adv. Math. Commun., 2018

Towards Collaborative Conceptual Exploration.
Proceedings of the Graph-Based Representation and Reasoning, 2018

2017
The Extension Theorem for Bi-invariant Weights over Frobenius Rings and Frobenius Bimodules.
CoRR, 2017

MacWilliams' extension theorem for infinite rings.
CoRR, 2017

2016
Designs and codes in affine geometry.
CoRR, 2016

2015
On the discrete logarithm problem in finite fields of fixed characteristic.
IACR Cryptol. ePrint Arch., 2015

2014
MacWilliams' Extension Theorem for bi-invariant weights over finite principal ideal rings.
J. Comb. Theory, Ser. A, 2014

On the Powers of 2.
IACR Cryptol. ePrint Arch., 2014

Breaking '128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in 𝔽<sub>2<sup>4·1223</sup></sub> and 𝔽<sub>2<sup>12·367</sup></sub>).
IACR Cryptol. ePrint Arch., 2014

New Results on the Pseudoredundancy.
CoRR, 2014

Notes on the pseudoredundancy.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Solving a 6120-bit DLP on a Desktop Computer.
IACR Cryptol. ePrint Arch., 2013

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in F<sub>2<sup>1971</sup></sub>.
IACR Cryptol. ePrint Arch., 2013

Characteristics of invariant weights related to code equivalence over rings.
Des. Codes Cryptogr., 2013

Algebraic decoding of negacyclic codes over $${\mathbb Z_4}$$.
Des. Codes Cryptogr., 2013

On the Function Field Sieve and the Impact of Higher Splitting Probabilities - Application to Discrete Logarithms in and.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
On the Pseudocodeword Redundancy of Binary Linear Codes.
IEEE Trans. Inf. Theory, 2012

On the algebraic representation of selected optimal non-linear binary codes.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
On the algebraic representation of certain optimal non-linear binary codes
CoRR, 2011

Algebraic Decoding of Negacyclic Codes Over Z<sub>4</sub>
CoRR, 2011

2010
Exploration of AWGNC and BSC Pseudocodeword Redundancy
CoRR, 2010

On the pseudocodeword redundancy.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2008
Efficient recovering of operation tables of black box groups and rings.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008


  Loading...