default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJens Zumbrägel
Person information
- affiliation: University of Passau, Faculty of Computer Science and Mathematics, Germany
- affiliation (PhD 2008): University of Zurich, Mathematics Institute, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Jens Zumbrägel:
Pseudoredundancy for the Bit-Flipping Algorithm. ISIT 2024: 659-662- [i28]Jens Zumbrägel:
Pseudoredundancy for the Bit-Flipping Algorithm. CoRR abs/2402.01403 (2024) - 2023
- [c11]Christoph Köhnen, Stefan Klessinger, Jens Zumbrägel, Stefanie Scherzinger:
A Plaque Test for Redundancies in Relational Data. VLDB Workshops 2023 - [i27]Oliver W. Gnilke, Jens Zumbrägel:
Cryptographic Group and Semigroup Actions. CoRR abs/2301.01657 (2023) - [i26]Christoph Köhnen, Stefan Klessinger, Jens Zumbrägel, Stefanie Scherzinger:
A Plaque Test for Redundancies in Relational Data. CoRR abs/2306.02890 (2023) - [i25]Oliver W. Gnilke, Jens Zumbrägel:
Cryptographic Group and Semigroup Actions. IACR Cryptol. ePrint Arch. 2023: 17 (2023) - [i24]Knud Ahrens, Jens Zumbrägel:
DEFEND: Towards Verifiable Delay Functions from Endomorphism Rings. IACR Cryptol. ePrint Arch. 2023: 1537 (2023) - 2022
- [c10]Marcus Greferath, Jens Zumbrägel:
List Decoding of Quaternary Codes in the Lee Metric. ISIT 2022: 2333-2337 - [i23]Marcus Greferath, Jens Zumbrägel:
List Decoding of Quaternary Codes in the Lee Metric. CoRR abs/2202.03977 (2022) - 2021
- [j6]Robert Granger, Thorsten Kleinjung, Arjen K. Lenstra, Benjamin Wesolowski, Jens Zumbrägel:
Computation of a 30750-bit binary field discrete logarithm. Math. Comput. 90(332): 2997-3022 (2021) - [c9]Sven Puchinger, Julian Renner, Antonia Wachter-Zeh, Jens Zumbrägel:
Efficient Decoding of Gabidulin Codes over Galois Rings. ISIT 2021: 25-30 - [i22]Sven Puchinger, Julian Renner, Antonia Wachter-Zeh, Jens Zumbrägel:
Efficient Decoding of Gabidulin Codes over Galois Rings. CoRR abs/2102.02157 (2021) - [i21]Simon Pohmann, Marc Stevens, Jens Zumbrägel:
Lattice Enumeration on GPUs for fplll. IACR Cryptol. ePrint Arch. 2021: 430 (2021) - 2020
- [i20]Robert Granger, Thorsten Kleinjung, Arjen K. Lenstra, Benjamin Wesolowski, Jens Zumbrägel:
Computation of a 30750-Bit Binary Field Discrete Logarithm. IACR Cryptol. ePrint Arch. 2020: 965 (2020)
2010 – 2019
- 2018
- [j5]Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
Indiscreet logarithms in finite fields of small characteristic. Adv. Math. Commun. 12(2): 263-286 (2018) - [c8]Tom Hanika
, Jens Zumbrägel:
Towards Collaborative Conceptual Exploration. ICCS 2018: 120-134 - 2017
- [i19]Friedrich Martin Schneider, Jens Zumbrägel:
MacWilliams' extension theorem for infinite rings. CoRR abs/1709.06070 (2017) - [i18]Oliver W. Gnilke, Marcus Greferath, Thomas Honold, Jay A. Wood, Jens Zumbrägel:
The Extension Theorem for Bi-invariant Weights over Frobenius Rings and Frobenius Bimodules. CoRR abs/1711.09939 (2017) - [i17]Tom Hanika, Jens Zumbrägel:
Towards Collaborative Conceptual Exploration. CoRR abs/1712.08858 (2017) - 2016
- [i16]Jens Zumbrägel:
Designs and codes in affine geometry. CoRR abs/1605.03789 (2016) - 2015
- [i15]Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
On the discrete logarithm problem in finite fields of fixed characteristic. IACR Cryptol. ePrint Arch. 2015: 685 (2015) - 2014
- [j4]Marcus Greferath, Thomas Honold, Cathy Mc Fadden, Jay A. Wood, Jens Zumbrägel:
MacWilliams' Extension Theorem for bi-invariant weights over finite principal ideal rings. J. Comb. Theory A 125: 177-193 (2014) - [c7]Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
Breaking '128-bit Secure' Supersingular Binary Curves - (Or How to Solve Discrete Logarithms in F24 1223 and F212 367). CRYPTO (2) 2014: 126-145 - [c6]Zihui Liu, Jens Zumbrägel, Marcus Greferath, Xin-Wen Wu:
Notes on the pseudoredundancy. ISIT 2014: 2789-2793 - [i14]Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
Breaking '128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in 𝔽24·1223 and 𝔽212·367). CoRR abs/1402.3668 (2014) - [i13]Zihui Liu, Jens Zumbrägel, Marcus Greferath, Xin-Wen Wu:
New Results on the Pseudoredundancy. CoRR abs/1410.1627 (2014) - [i12]Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
Breaking '128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in 𝔽24·1223 and 𝔽212·367). IACR Cryptol. ePrint Arch. 2014: 119 (2014) - [i11]Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
On the Powers of 2. IACR Cryptol. ePrint Arch. 2014: 300 (2014) - 2013
- [j3]Eimear Byrne, Marcus Greferath, Jaume Pernas, Jens Zumbrägel:
Algebraic decoding of negacyclic codes over $${\mathbb Z_4}$$. Des. Codes Cryptogr. 66(1-3): 3-16 (2013) - [j2]Marcus Greferath, Cathy Mc Fadden, Jens Zumbrägel:
Characteristics of invariant weights related to code equivalence over rings. Des. Codes Cryptogr. 66(1-3): 145-156 (2013) - [c5]Faruk Göloglu, Robert Granger, Gary McGuire, Jens Zumbrägel:
On the Function Field Sieve and the Impact of Higher Splitting Probabilities - Application to Discrete Logarithms in and. CRYPTO (2) 2013: 109-128 - [c4]Faruk Göloglu, Robert Granger, Gary McGuire, Jens Zumbrägel:
Solving a 6120 -bit DLP on a Desktop Computer. Selected Areas in Cryptography 2013: 136-152 - [i10]Marcus Greferath, Thomas Honold, Cathy Mc Fadden, Jay A. Wood, Jens Zumbrägel:
MacWilliams' Extension Theorem for Bi-Invariant Weights over Finite Principal Ideal Rings. CoRR abs/1309.3292 (2013) - [i9]Faruk Göloglu, Robert Granger, Gary McGuire, Jens Zumbrägel:
On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in F21971. IACR Cryptol. ePrint Arch. 2013: 74 (2013) - [i8]Faruk Göloglu, Robert Granger, Gary McGuire, Jens Zumbrägel:
Solving a 6120-bit DLP on a Desktop Computer. IACR Cryptol. ePrint Arch. 2013: 306 (2013) - 2012
- [j1]Jens Zumbrägel, Vitaly Skachek, Mark F. Flanagan:
On the Pseudocodeword Redundancy of Binary Linear Codes. IEEE Trans. Inf. Theory 58(7): 4848-4861 (2012) - [c3]Marcus Greferath, Jens Zumbrägel:
On the algebraic representation of selected optimal non-linear binary codes. ISIT 2012: 3115-3119 - 2011
- [i7]Eimear Byrne, Marcus Greferath, Jaume Pernas, Jens Zumbrägel:
Algebraic Decoding of Negacyclic Codes Over Z4. CoRR abs/1102.3604 (2011) - [i6]Jens Zumbrägel, Vitaly Skachek, Mark F. Flanagan:
On the Pseudocodeword Redundancy of Binary Linear Codes. CoRR abs/1103.3641 (2011) - [i5]Marcus Greferath, Jens Zumbrägel:
On the algebraic representation of certain optimal non-linear binary codes. CoRR abs/1109.4770 (2011) - [i4]Marcus Greferath, Cathy Mc Fadden, Jens Zumbrägel:
Characteristics of Invariant Weights Related to Code Equivalence over Rings. CoRR abs/1110.1538 (2011) - 2010
- [c2]Jens Zumbrägel, Mark F. Flanagan, Vitaly Skachek:
On the pseudocodeword redundancy. ISIT 2010: 759-763 - [i3]Jens Zumbrägel, Mark F. Flanagan, Vitaly Skachek:
On the Pseudocodeword Redundancy. CoRR abs/1001.1705 (2010) - [i2]Jens Zumbrägel, Mark F. Flanagan, Vitaly Skachek:
Exploration of AWGNC and BSC Pseudocodeword Redundancy. CoRR abs/1005.3486 (2010)
2000 – 2009
- 2008
- [c1]Jens Zumbrägel, Gérard Maze, Joachim Rosenthal:
Efficient recovering of operation tables of black box groups and rings. ISIT 2008: 639-643 - [i1]Jens Zumbrägel, Gérard Maze, Joachim Rosenthal:
Efficient recovering of operation tables of black box groups and rings. CoRR abs/0805.0514 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-12 23:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
