Eduard Hirsch

Eduard Hirsch

Auto-generated profile, based on publicly available information

Eduard Hirsch

University of Applied Sciences Amberg-Weiden

Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 July 2026
Verified
Book Chapter
Open access
PDF file
EHEduard Hirsch
Eduard Hirsch
KRKristina Raab
Kristina Raab
Cryptographic migration driven by algorithm deprecation, regulatory change, and post-quantum readiness requires more than an inventory of cryptographic assets. Existing Cryptographic Bills of Materials (CBOMs) are typically tool- or inventory-derived. They lack architectural intent, rationale, and security context, limiting their usefulness for migration planning. This paper introduces Security-Aware Architecture Tradeoff Analysis Method (SATAM), a security-aware adaptation of scenario-based architecture evaluation that derives an architecture-grounded, context-sensitive CBOM. SATAM integrates established approaches: ATAM, arc42, STRIDE, ADR, and CARAF. These Generated artifacts are used to annotate CBOM entries with architectural context, security intent, and migration-critical metadata using CycloneDX-compatible extensions. Following a Design Science Research approach, the paper presents the method design, a conceptual traceability model, and an illustrative application. The results demonstrate that architecture-derived CBOMs capture migration-relevant context that is typically absent from inventory-based approaches. Thereby, SATAM improves availability of information required for informed cryptographic migration planning and long-term cryptographic agility.


1 January 2026 in IEEE Access
Verified
Journal Article
Open access
CNChristian Näther
Christian Näther
DHDaniel Herzinger
Daniel Herzinger
JSJan-Philipp Steghöfer
Jan-Philipp Steghöfer
SGStefan-Lukas Gazdag
Stefan-Lukas Gazdag
EHEduard Hirsch
Eduard Hirsch
DLDaniel Loebenberger
Daniel Loebenberger

9 July 2026
Verified
Book Chapter
Open access
PDF file
DLDaniel Loebenberger
Daniel Loebenberger
EHEduard Hirsch
Eduard Hirsch
SGStefan-Lukas Gazdag
Stefan-Lukas Gazdag
DHDaniel Herzinger
Daniel Herzinger
CNChristian Näther
Christian Näther
JSJan-Philipp Steghöfer
Jan-Philipp Steghöfer
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 capture the inherent dependencies and complexities of such transitions. Using classical mathematical results from combinatorics, probability theory, and combinatorial analysis, we evaluate the challenges of migrating large cryptographic IT infrastructures. We show mathematical rigorously that for certain idealized random partitions and under some standard Erdős-Rényi-type assumptions our model exhibits a certain expected structural complexity and provide numerical data for selected parameter sets. This work paves the way for future advancements in both the theoretical understanding and practical implementation of cryptographic migration strategies.