# US 2026/0281150 A1 · Systems and methods for estimating a crypto-agility score of a network of computing assets > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2026/0281150 A1 - Document ID: US20260281150A1 - Status: Published application - Kind: A1 - Application number: 19/674,554 - Filed: 2026-05-12 - Published: 2026-09-17 - Earliest claimed: 2024-04-09 - Assignees: Wells Fargo Bank, N.A. - Applicants: Wells Fargo Bank, N.A. - Inventors: Richard Toohey; Peter Bordow; Chao Chen - Web page: https://patentgrep.com/patent/US20260281150A1 ## CPC - H04L 63/1433: {Vulnerability analysis} - H04L 41/0869: Validating the configuration within one network element - H04L 41/145: {involving simulating, designing, planning or modelling of a network} - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## Abstract Systems, apparatuses, methods, and computer program products are disclosed for estimating a crypto-agility score of a network of computing assets. An example method includes receiving a network graph and a set of expert-determined importance weights and selecting a first network node from a set of network nodes. The example method further includes computing an upgrade cost for the first network node based on a set of dependency network nodes and applying an expert-determined importance weight to the upgrade cost for the first network node to determine a weighted upgrade cost for the first network node. The example method further includes adding the weighted upgrade cost for the first network node to a set of weighted upgrade costs and summing, by the graph circuitry, each weighted upgrade cost from the set of weighted full upgrade costs to determine the crypto-agility score for the network of computer assets. ## Claims ### Claim 1 A method for determining an optimized crypto-agile network configuration, the method comprising: receiving a network graph comprising nodes representing computing assets and edges representing relationships between the nodes; receiving importance weights corresponding to at least a subset of the nodes; computing, for a first network configuration represented by the network graph, a first crypto-agility score based on upgrade costs associated with the nodes and the importance weights; causing a plurality of perturbations of the network graph to generate a plurality of perturbed network graphs, each perturbation of the plurality of perturbations comprising at least one of: adding a node, removing a node, adding an edge, removing an edge, changing a property of a node, or changing a property of an edge; for each perturbed network graph, computing a corresponding perturbed crypto-agility score based on perturbed weighted upgrade costs determined from dependencies among the nodes of the respective perturbed network graph; determining, using the perturbed crypto-agility scores, a locally optimal network configuration; and sending, to a computing device, data indicating the locally optimal network configuration and the perturbation that generated the locally optimal network configuration. ### Claim 2 (depends on 1) The method of claim 1, further comprising: computing, by upgrade analysis circuitry, an individual upgrade cost associated with an upgrade of a first network node; determining, by the upgrade analysis circuitry, a set of dependency network nodes representing computing assets that provide dependencies for the upgrade of the first network node; generating a set of individual upgrade costs associated with the set of dependency network nodes; and computing, by the upgrade analysis circuitry, an upgrade cost for the first network node based on a set of upgrade costs associated with dependency network nodes from the set of dependency network nodes. ### Claim 3 (depends on 2) The method of claim 2, wherein computing the upgrade cost for the first network node comprises: computing, by the upgrade analysis circuitry, a dependency upgrade cost for a dependency network node from the set of dependency network nodes, wherein the dependency upgrade cost is based on a set of nested dependency upgrade costs associated with dependencies of the dependency network node. ### Claim 4 (depends on 2) The method of claim 2, wherein generating the set of individual upgrade costs associated with the dependency network nodes comprises: selecting, by graph circuitry, a next network node, wherein the next network node has not previously been selected, wherein the next network node provides a dependency for the upgrade of the first network node; computing, by the upgrade analysis circuitry, a next individual upgrade cost associated with the next network node; and adding, by the graph circuitry, the next individual upgrade cost to the set of upgrade costs associated with the dependency network nodes. ### Claim 5 (depends on 1) The method of claim 1, further comprising computing a set of weighted upgrade costs by: selecting, by graph circuitry, a next network node, wherein the next network node has not previously been selected; computing, by upgrade analysis circuitry, a next upgrade cost for the next network node based on a set of next dependency network nodes comprising dependencies of the next network node; applying, by the graph circuitry, a next weight from the set of weights to the next upgrade cost for the next network node to determine a next weighted upgrade cost for the next network node; and adding, by the graph circuitry, the next weighted upgrade cost for the next network node to the set of weighted upgrade costs. ### Claim 6 (depends on 1) The method of claim 1, further comprising: computing a set of perturbed weighted upgrade costs based on the perturbed network graph; and summing, by graph circuitry, each perturbed weighted upgrade cost from the set of perturbed weighted upgrade costs to determine the perturbed crypto-agility scores. ### Claim 7 (depends on 6) The method of claim 6, further comprising: selecting a greatest score from the perturbed crypto-agility scores to designate a locally optimal network configuration, wherein the locally optimal network configuration corresponds to the greatest score. ### Claim 8 (depends on 6) The method of claim 6, further comprising: computing a set of crypto-agility scores comprising the crypto-agility score and the perturbed crypto-agility score, wherein each particular crypto-agility score from the set of crypto-agility scores is associated with a particular network graph from a set of network graphs; providing, by communications hardware, the set of crypto-agility scores and the set of network graphs to an expert user; and receiving, by the communications hardware, an indication of a validation of the set of crypto-agility scores. ### Claim 9 (depends on 8) The method of claim 8, further comprising: modifying, by the graph circuitry, a selected weight from the set of weights based on the validation of the set of crypto-agility scores. ### Claim 10 (depends on 8) The method of claim 8, further comprising: modifying, by the graph circuitry, a selected upgrade cost associated with a particular network node from the set of network graphs based on the validation of the set of crypto-agility scores. ### Claim 11 (depends on 1) The method of claim 1, wherein the network graph is a knowledge graph. ### Claim 12 (depends on 11) The method of claim 11, wherein computing the upgrade cost is based on one or more subject-predicate-object relationships between the first network node and a dependency network node. ### Claim 13 An apparatus for determining an optimized crypto-agile network configuration, the apparatus comprising: communications hardware configured to: receive a network graph comprising nodes representing computing assets and edges representing relationships between the nodes; and receive importance weights corresponding to at least a subset of the nodes; upgrade analysis circuitry configured to: compute, for a first network configuration represented by the network graph, a first crypto-agility score based on upgrade costs associated with the nodes and the importance weights; cause a plurality of perturbations of the network graph to generate a plurality of perturbed network graphs, each perturbation of the plurality of perturbations comprising at least one of: adding a node, removing a node, adding an edge, removing an edge, changing a property of a node, or changing a property of an edge; for each perturbed network graph, compute a corresponding perturbed crypto-agility score based on perturbed weighted upgrade costs determined from dependencies among the nodes of the respective perturbed network graph; determine, using the perturbed crypto-agility scores, a locally optimal network configuration; and wherein the communications hardware is further configured to: send, to a computing device, data indicating the locally optimal network configuration and the perturbation that generated the locally optimal network configuration. ### Claim 14 (depends on 13) The apparatus of claim 13, wherein the upgrade analysis circuitry is further configured to: compute an individual upgrade cost associated with an upgrade of the first network node; determine a set of dependency network nodes representing computing assets that provide dependencies for the upgrade of the first network node; generate a set of individual upgrade costs associated with the set of dependency network nodes; and compute an upgrade cost for the first network node based on a set of upgrade costs associated with dependency network nodes from the set of dependency network nodes. ### Claim 15 (depends on 14) The apparatus of claim 14, wherein the upgrade analysis circuitry is further configured to compute the upgrade cost for the first network node by: computing a dependency upgrade cost for a dependency network node from the set of dependency network nodes, wherein the dependency upgrade cost is based on a set of nested dependency upgrade costs associated with dependencies of the dependency network node; and adding the dependency upgrade cost for the dependency network node to the upgrade cost for the first network node. ### Claim 16 (depends on 14) The apparatus of claim 14, wherein the graph circuitry is further configured to generate the set of individual upgrade costs associated with the dependency network nodes by: selecting a next network node, wherein the next network node has not previously been selected, wherein the next network node provides a dependency for the upgrade of the first network node; computing a next individual upgrade cost associated with the next network node; and adding the next individual upgrade cost to the set of upgrade costs associated with the dependency network nodes. ### Claim 17 (depends on 13) The apparatus of claim 13, wherein the graph circuitry is further configured to compute a set of weighted upgrade costs by: selecting a next network node, wherein the next network node has not previously been selected; computing a next upgrade cost for the next network node based on a set of next dependency network nodes comprising dependencies of the next network node; applying a next weight from the set of weights to the next upgrade cost for the next network node to determine a next weighted upgrade cost for the next network node; and adding the next weighted upgrade cost for the next network node to the set of weighted upgrade costs. ### Claim 18 (depends on 13) The apparatus of claim 13, wherein the graph circuitry is further configured to: computing a set of perturbed weighted upgrade costs based on the perturbed network graph; and sum each perturbed weighted upgrade cost from the set of perturbed weighted upgrade costs to determine the perturbed crypto-agility scores. ### Claim 19 (depends on 18) The apparatus of claim 18, wherein the graph circuitry is further configured to: select a greatest score from the crypto-agility scores to designate a locally optimal network configuration, wherein the locally optimal network configuration corresponds to the greatest score. ### Claim 20 A computer program product for determining an optimized crypto-agile network configuration, the computer program product comprising at least one non-transitory computer-readable storage medium storing software instructions that, when executed, cause an apparatus to: receive a network graph comprising nodes representing computing assets and edges representing relationships between the nodes; receive importance weights corresponding to at least a subset of the nodes; compute, for a first network configuration represented by the network graph, a first crypto-agility score based on upgrade costs associated with the nodes and the importance weights; cause a plurality of perturbations of the network graph to generate a plurality of perturbed network graphs, each perturbation of the plurality of perturbations comprising at least one of: adding a node, removing a node, adding an edge, removing an edge, changing a property of a node, or changing a property of an edge; for each perturbed network graph, compute a corresponding perturbed crypto-agility score based on perturbed weighted upgrade costs determined from dependencies among the nodes of the respective perturbed network graph; determine, using the perturbed crypto-agility scores, a locally optimal network configuration; and send, to a computing device, data indicating the locally optimal network configuration and the perturbation that generated the locally optimal network configuration.