On the Formalization of Cryptographic Migration

• URL: http://arxiv.org/abs/2408.05997v3
• Date: Fri, 17 Jan 2025 10:23:13 GMT
• Title: On the Formalization of Cryptographic Migration
• Authors: Daniel Loebenberger, Stefan-Lukas Gazdag, Daniel Herzinger, Eduard Hirsch, Christian Näther, Jan-Philipp Steghöfer,
• Abstract summary: Post-quantum cryptography (PQC) is becoming increasingly critical to maintain the security of modern dependable infrastructural systems. This paper presents a novel approach to gain insight into the structure of cryptographic migration problems.
• Score: 2.4739484546803334
• License:
• Abstract: With the advancement of quantum computing, the transition to post-quantum cryptography (PQC) is becoming increasingly critical to maintain the security of modern dependable infrastructural systems. This paper presents a novel approach to gain insight into the structure of cryptographic migration problems, using a semi-formal model to capture the inherent dependencies and complexities of such transitions. Using classical mathematical results from combinatorics, probability theory, and combinatorial analysis, we assess the challenges of migrating large cryptographic IT-infrastructures and prove that -- in a suitable sense -- cryptographic migration has a certain expected complexity. Furthermore, we analyze the proposed model in terms of real-world patterns as well as its practical applicability, and discuss difficulties that arise when trying to model real-world migration projects. This work sets the stage for future advances in both the theoretical understanding and practical implementation of cryptographic migration strategies in the post-quantum era.

Related papers

• Bridging Visualization and Optimization: Multimodal Large Language Models on Graph-Structured Combinatorial Optimization [56.17811386955609]
  Graph-structured challenges are inherently difficult due to their nonlinear and intricate nature. In this study, we propose transforming graphs into images to preserve their higher-order structural features accurately. By combining the innovative paradigm powered by multimodal large language models with simple search techniques, we aim to develop a novel and effective framework.
  arXiv  Detail & Related papers  (2025-01-21T08:28:10Z)
• Implementing Semiclassical Szegedy Walks in Classical-Quantum Circuits for Homomorphic Encryption [0.0]
  Quantum homomorphic encryption (QHE) is an emerging technology that facilitates secure computation on quantum data without revealing the underlying information. We reinterpret QHE schemes through classical-quantum circuits, enhancing efficiency and addressing previous limitations related to key computations. Our approach eliminates the need for exponential key preparation by calculating keys in real-time during simulation, leading to a linear complexity in classically controlled gates.
  arXiv  Detail & Related papers  (2024-12-02T20:50:48Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• The Foundations of Tokenization: Statistical and Computational Concerns [51.370165245628975]
  Tokenization is a critical step in the NLP pipeline. Despite its recognized importance as a standard representation method in NLP, the theoretical underpinnings of tokenization are not yet fully understood. The present paper contributes to addressing this theoretical gap by proposing a unified formal framework for representing and analyzing tokenizer models.
  arXiv  Detail & Related papers  (2024-07-16T11:12:28Z)
• ALPINE: Unveiling the Planning Capability of Autoregressive Learning in Language Models [48.559185522099625]
  Planning is a crucial element of both human intelligence and contemporary large language models (LLMs) This paper investigates the emergence of planning capabilities in Transformer-based LLMs via their next-word prediction mechanisms.
  arXiv  Detail & Related papers  (2024-05-15T09:59:37Z)
• It Is Time To Steer: A Scalable Framework for Analysis-driven Attack Graph Generation [50.06412862964449]
  Attack Graph (AG) represents the best-suited solution to support cyber risk assessment for multi-step attacks on computer networks. Current solutions propose to address the generation problem from the algorithmic perspective and postulate the analysis only after the generation is complete. This paper rethinks the classic AG analysis through a novel workflow in which the analyst can query the system anytime.
  arXiv  Detail & Related papers  (2023-12-27T10:44:58Z)
• Lattice real-time simulations with learned optimal kernels [49.1574468325115]
  We present a simulation strategy for the real-time dynamics of quantum fields inspired by reinforcement learning. It builds on the complex Langevin approach, which it amends with system specific prior information.
  arXiv  Detail & Related papers  (2023-10-12T06:01:01Z)
• A Framework for Migrating to Post-Quantum Cryptography: Security Dependency Analysis and Case Studies [3.890207460112498]
  cryptography, once deemed secure for decades, are now at risk of being compromised. There is an urgent need to migrate to quantum-resistant cryptographic systems. We present a comprehensive framework designed to assist enterprises with this transition.
  arXiv  Detail & Related papers  (2023-07-13T01:51:15Z)
• Enhancing SMT-based Weighted Model Integration by Structure Awareness [10.812681884889697]
  Weighted Model Integration (WMI) emerged as a unifying formalism for probabilistic inference in hybrid domains. We develop an algorithm that combines SMT-based enumeration, an efficient technique in formal verification, with an effective encoding of the problem structure.
  arXiv  Detail & Related papers  (2023-02-13T08:55:12Z)
• Reflection Equivariant Quantum Neural Networks for Enhanced Image Classification [0.7232471205719458]
  We build new machine learning models which explicitly respect the symmetries inherent in their data, so-called geometric quantum machine learning (GQML) We find that these networks are capable of consistently and significantly outperforming generic ansatze on complicated real-world image datasets.
  arXiv  Detail & Related papers  (2022-12-01T04:10:26Z)
• SMT-based Weighted Model Integration with Structure Awareness [18.615397594541665]
  We develop an algorithm that combines SMT-based enumeration, an efficient technique in formal verification, with an effective encoding of the problem structure. This allows our algorithm to avoid generating redundant models, resulting in substantial computational savings.
  arXiv  Detail & Related papers  (2022-06-28T09:46:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.