An Assessment Framework for Application-Level Cryptographic Agility
- URL: http://arxiv.org/abs/2606.13425v1
- Date: Thu, 11 Jun 2026 14:54:10 GMT
- Title: An Assessment Framework for Application-Level Cryptographic Agility
- Abstract summary: The impending post-quantum transition to new cryptography will require complete replacement of algorithms within all software.<n> cryptographic APIs used today make this transition challenging because they were not designed with agility as a concern.<n>We introduce a component-based assessment framework that characterizes application-level cryptographic agility along seven dimensions.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The impending post-quantum transition to new cryptography will require complete replacement of algorithms within all software. The cryptographic APIs used today make this transition challenging because they were not designed with agility as a concern. There is no method for systematically assessing cryptographic agility as an overall ability. In addition to this, the term itself refers to multiple independent capabilities. Specifically, it includes replacing algorithms, selecting by policy, and substituting implementations. This lack of structured decomposition limits both the evaluation of systems and the development of cryptographically agile APIs. We introduce a component-based assessment framework that characterizes application-level cryptographic agility along seven orthogonal dimensions: three coupling dimensions that measure what the application code knows about algorithms and providers, a cross-cutting decoupling mechanism, a governance authority dimension, and two agility enablers that measure actual migration capability. The framework is non-linear and captures non-hierarchical profiles: a system may achieve high operation decoupling yet low creation decoupling, or strong versioning without externalized configuration. We evaluate six representative APIs (PKCS#11, OpenSSL~3.0, JCA, Google Tink, AWS KMS, and HashiCorp Vault Transit) against the framework, revealing three pervasive and independent gaps: no system supports intent-based key creation, none provides policy-driven algorithm selection (as distinct from access control), and none offers dedicated/first-class operations for algorithm transformation of existing keys. These gaps are individually sufficient to prevent agile migration, explaining why the post-quantum transition remains a software engineering problem despite decades of API progress.
Related papers
- Blind Transpiler: An open-source library for universally blind and homomorphic quantum computations [1.1333522464162373]
Blind quantum computation is a cryptographic primitive that allows a limited-capability client to delegate its computation to a remote server without revealing its data and/or computation.<n>We describe the development of the first such library for transpiling circuits written in Qiskit to its blind counterpart.
arXiv Detail & Related papers (2026-07-19T08:37:25Z) - Intent-Based Cryptographic API Design for Cryptographic Agility [0.0]
Most cryptographic APIs in use today were designed around specific algorithms.<n>These APIs expect explicit use of specific algorithms, provide little or no support for policy-based algorithm selection, and offer no straightforward way to migrate existing keys to newer algorithms.<n>This paper identifies the barriers to cryptographic agility and explains why algorithm transition is largely a software engineering problem.
arXiv Detail & Related papers (2026-06-11T15:05:37Z) - From Prompt to Process: a Process Taxonomy and Comparative Assessment of Frameworks Supporting AI Software Development Agents [0.0]
We focus on the operational frameworks that turn AI capabilities into process.<n>Each attack AI development through a different path: spec-driven development in full and lightweight variants, agent-driven agile planning, context engineering over the agent, worktree isolation and review, and recovery of operational specifications from legacy systems.<n>Our central contribution is a six-dimension process taxonomy: specification, context, roles, execution, validation and portability, with a scoring rubric that turns it into a replicable instrument.
arXiv Detail & Related papers (2026-06-03T14:49:15Z) - PRIMA: Operational Patterns for Resilient Multi-Agent Research with Verifiable Identity and Convergent Feedback [0.0]
PRIMA operates as coordinated multi-agent research systems over multi-hour runs.<n>Main contributions are three operational patterns for surviving failure modes.<n>A Graph Isomorphism case study grounds the architectural claims in a generated artifact.
arXiv Detail & Related papers (2026-05-23T23:27:46Z) - Beyond Binary Success: A Diagnostic Meta-Evaluation Framework for Fine-Grained Manipulation [98.79811866787263]
We introduce MetaFine, a diagnostic meta-evaluation framework that disentangles manipulation competency along three axes.<n>We identify the visual encoder's ability to preserve local spatial structure as a key bottleneck for fine-grained precision.<n>By shifting evaluation from ranking to diagnosis, MetaFine turns benchmarking into an actionable compass for repairing the layered capacities underlying genuine physical dexterity.
arXiv Detail & Related papers (2026-05-19T15:25:13Z) - FrontierSmith: Synthesizing Open-Ended Coding Problems at Scale [73.57353294235223]
We introduce FrontierSmith, an automated system for evolving open-ended problems from existing closed-ended coding tasks.<n>On two open-ended coding benchmarks, training on our synthesized data yields substantial gains over the base models.<n>The synthesized problems also make agents take more turns and use more tokens, similar to human-curated ones.
arXiv Detail & Related papers (2026-05-14T06:39:42Z) - PRISM: : Planning and Reasoning with Intent in Simulated Embodied Environments [59.07829883257003]
Built on five multi-room apartments, PRISM structures 300 human-verified tasks into three capability tiers.<n>PRISM exposes an agent-agnostic executable action API that allows arbitrary agents to be evaluated end-to-end.
arXiv Detail & Related papers (2026-05-12T04:59:47Z) - Post-Quantum Cryptography: An Analysis of Code-Based and Lattice-Based Cryptosystems [55.49917140500002]
Quantum computers will be able to break modern cryptographic systems using Shor's Algorithm.<n>We first examine the McEliece cryptosystem, a code-based scheme believed to be secure against quantum attacks.<n>We then explore NTRU, a lattice-based system grounded in the difficulty of solving the Shortest Vector Problem.
arXiv Detail & Related papers (2025-05-06T03:42:38Z) - Verification Learning: Make Unsupervised Neuro-Symbolic System Feasible [49.084647802326366]
This paper introduces a novel learning paradigm, Verification Learning (VL), which transforms the label-based reasoning process in Nesy into a label-free verification process.<n>VL achieves excellent learning results solely by relying on unlabeled data and a function that verifies whether the current predictions conform to the rules.<n>Our theoretical analysis points out which tasks in Nesy systems can be completed without labels and explains why rules can replace infinite labels for some tasks, while for others the rules have no effect.
arXiv Detail & Related papers (2025-03-17T08:28:58Z) - Cryptanalysis via Machine Learning Based Information Theoretic Metrics [58.96805474751668]
We propose two novel applications of machine learning (ML) algorithms to perform cryptanalysis on any cryptosystem.<n>These algorithms can be readily applied in an audit setting to evaluate the robustness of a cryptosystem.<n>We show that our classification model correctly identifies the encryption schemes that are not IND-CPA secure, such as DES, RSA, and AES ECB, with high accuracy.
arXiv Detail & Related papers (2025-01-25T04:53:36Z) - Incorprating Prompt tuning for Commit classification with prior
Knowledge [0.76146285961466]
Commit Classification(CC) is an important task in software maintenance.
We propose a generative framework that incorporates prompt-tuning for commit classification with prior knowledge.
Our framework can solve the CC problem simply but effectively in few-shot and zeroshot scenarios.
arXiv Detail & Related papers (2023-08-21T09:17:43Z) - Benchmarking Quality-Dependent and Cost-Sensitive Score-Level Multimodal
Biometric Fusion Algorithms [58.156733807470395]
This paper reports a benchmarking study carried out within the framework of the BioSecure DS2 (Access Control) evaluation campaign.
The campaign targeted the application of physical access control in a medium-size establishment with some 500 persons.
To the best of our knowledge, this is the first attempt to benchmark quality-based multimodal fusion algorithms.
arXiv Detail & Related papers (2021-11-17T13:39:48Z)
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.