{"paper":{"title":"Quantum-Aware Key Rank for Side-Channel Attacks evaluation","arxiv_id":"2610.20537","primary_cat":"quant-ph","submitted_at":"2026-10-14T17:31:48+00:00","version_compiled":"v1"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v1","sentences":[{"i":0,"p":1.0,"id":"s0","own":false,"role":"background","text":"Side-channel attacks on block ciphers rarely recover the key outright: they leave a residual key space ordered by subkey posteriors, and evaluation laboratories report the key rank of the true key against thresholds near 2^48 and 2^60.","hedge":{"p":0.98,"label":"asserted"},"own_p":0.05,"main_claim_p":0.03,"quantitative":true,"quantitative_p":0.97,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":1.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":1,"p":1.0,"id":"s1","own":false,"role":"gap","text":"No evaluation framework models an adversary who collects traces classically and finishes the search on a quantum computer, although quantum search with advice provides exactly that.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.11,"main_claim_p":0.06,"quantitative":false,"quantitative_p":0.08,"role_probabilities":{"gap":1.0,"method":0.0,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":2,"p":1.0,"id":"s2","own":true,"role":"contribution","text":"We give such an adversary a cost model and a metric.","hedge":{"p":0.96,"label":"asserted"},"own_p":0.89,"main_claim_p":0.07,"quantitative":false,"quantitative_p":0.03,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":1.0,"interpretation":0.0}},{"i":3,"p":0.93,"id":"s3","own":true,"role":"result","text":"For a device whose key has rank r, any quantum algorithm with classical access to the posteriors needs Omega(sqrt(r)) cipher evaluations, and block search achieves O(sqrt(r)); the per-instance advantage is exactly quadratic, and the super-quadratic exponents reported for search with advice are averages over the prior that apply to no single device.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.72,"main_claim_p":0.48,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.93,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.05,"interpretation":0.01}},{"i":4,"p":0.95,"id":"s4","own":true,"role":"result","text":"Under the NIST MAXDEPTH budget D and a Grover iteration of g gates and depth d, the quadratic advantage holds only for ranks up to (4D/(pi d))^2 and collapses to a constant factor beyond; with the best published AES-128 oracle and D = 2^40 the window closes near rank 2^58.6.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.71,"main_claim_p":0.16,"quantitative":true,"quantitative_p":0.99,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.95,"background":0.0,"limitation":0.03,"future_work":0.0,"contribution":0.01,"interpretation":0.01}},{"i":5,"p":0.9,"id":"s5","own":true,"role":"contribution","text":"We define the quantum-aware key rank, the classical rank of equal cost, computable from the rank estimators laboratories already run, and derive the classical rank a device must retain to keep a given threshold against each depth budget.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.23,"quantitative":false,"quantitative_p":0.07,"role_probabilities":{"gap":0.0,"method":0.1,"result":0.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.9,"interpretation":0.0}},{"i":6,"p":0.75,"id":"s6","own":true,"role":"result","text":"Block search and amplitude amplification from the product-form posterior state are within a factor of two to four of each other on Hamming-weight posteriors, so the cost of coherent indexing decides between them.","hedge":{"p":0.98,"label":"asserted"},"own_p":0.71,"main_claim_p":0.05,"quantitative":true,"quantitative_p":0.98,"role_probabilities":{"gap":0.0,"method":0.09,"result":0.75,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.03,"interpretation":0.13}},{"i":7,"p":1.0,"id":"s7","own":true,"role":"result","text":"Experiments on simulated leakage and a toy cipher confirm the predicted window: at SNR 0.125 a depth-limited quantum adversary is worth about 22 traces to a classical one, however large its gate budget.","hedge":{"p":0.98,"label":"asserted"},"own_p":0.94,"main_claim_p":0.14,"quantitative":true,"quantitative_p":0.99,"role_probabilities":{"gap":0.0,"method":0.0,"result":1.0,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}}]},"compiled":{"main_claim":{"p":0.65,"text":"Under the NIST MAXDEPTH budget D and a Grover iteration of g gates and depth d, the quadratic advantage holds only for ranks up to (4D/(pi d))^2 and collapses to a constant factor beyond; with the best published AES-128 oracle and D = 2^40 the window closes near rank 2^58.6.","location":"abstract s4","hedge_strength":{"p":1.0,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":6678,"cost_usd_reported":0.0},"compiled_at":"2026-10-15","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.54,"states_limitation":0.78,"human_participants":0.02,"controlled_comparison":0.48,"randomized_assignment":0.02,"states_quantitative_result":0.98,"compares_with_prior_results":0.89,"mentions_code_or_data_availability":0.03},"evidential_basis":{"p":0.88,"value":"proof or derivation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":0.88,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.12}},"contribution_type":{"p":0.66,"value":"theoretical result","probabilities":{"review":0.0,"method_or_tool":0.34,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.66,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.51,"text":"We define the quantum-aware key rank, the classical rank of equal cost, computable from the rank estimators laboratories already run, and derive the classical rank a device must retain to keep a given threshold against each depth budget.","location":"abstract s5"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":8,"sentences_in_abstract":8},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448}}