35 citations · 40 across the 8 of their papers we have counts for
8 papers
DSCH-Loss: A Dynamic Semantic Channel Objective for Deep Semantic Hashing
Tobias J. Bauer, Christian Riess, Daniel Loebenberger +1
Semantic hashing methods for generating short binary hash codes that allow efficient approximate nearest neighbor search in high-dimensional data spaces have gained extensive consi…
Detecting Cryptographically Relevant Software Packages with Collaborative LLMs
Eduard Hirsch, Kristina Raab, Tobias J. Bauer +1
IT systems are facing an increasing number of security threats, including advanced persistent attacks and future quantum-computing vulnerabilities. The move towards crypto-agility…
Time-Based State-Management of Hash-Based Signature CAs for VPN-Authentication
Daniel Herzinger, Linus Heise, Daniel Loebenberger +1
Advances in quantum computing necessitate migrating the entire technology stack to post-quantum cryptography. This includes IPsec-based VPN connection authentication. Although ther…
Toward a Common Understanding of Cryptographic Agility -- A Systematic Review
Christian Näther, Daniel Herzinger, Jan-Philipp Steghöfer +3
Cryptographic agility is gaining attention due to its crucial role in maintaining cryptographic security in a rapidly evolving technological landscape. However, despite its increas…
On the Formalization of Cryptographic Migration
Daniel Loebenberger, Stefan-Lukas Gazdag, Daniel Herzinger +3
We present a novel approach to gaining insight into the structure of cryptographic migration problems which are classic problems in applied cryptography. We use a formal model to c…
Migrating Software Systems towards Post-Quantum-Cryptography -- A Systematic Literature Review
Christian Näther, Daniel Herzinger, Stefan-Lukas Gazdag +3
Networks such as the Internet are essential for our connected world. Quantum computing poses a threat to this heterogeneous infrastructure since it threatens fundamental security m…
Notions for RSA integers
Daniel Loebenberger, Michael Nüsken
The key-generation algorithm for the RSA cryptosystem is specified in several standards, such as PKCS#1, IEEE 1363-2000, FIPS 186-3, ANSI X9.44, or ISO/IEC 18033-2. All of them sub…
Coarse-grained integers - Smooth? Rough? Both!
Daniel Loebenberger, Michael Nüsken
We count ]B, C]-grained, k-factor integers which are simultaneously B-rough and C-smooth and have a fixed number k of prime factors. Our aim is to exploit explicit versions of the…