pith. sign in

arxiv: 2510.03631 · v2 · submitted 2025-10-04 · 💻 cs.CR

QPADL: Post-Quantum Private Spectrum Access with Verified Location and DoS Resilience

Saleh Darzi , Saif Eddine Nouma , Kiarash Sedghighadikolaei , Attila Altay This is my paper

Pith reviewed 2026-05-18 10:44 UTC · model grok-4.3

classification 💻 cs.CR
keywords post-quantum cryptographyspectrum access systemslocation privacyanonymityDoS resilienceprivate information retrievallocation verification
0
0 comments X

The pith

QPADL is a post-quantum framework that protects spectrum access with privacy, anonymity, location verification, and DoS resilience.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Spectrum Access Systems must disclose user locations and transmission details to allocate scarce wireless spectrum, which exposes privacy and opens the door to spoofing and DoS attacks. Quantum computers threaten the encryption that currently protects these queries. The paper proposes QPADL as a single framework that layers a tailored private-information-retrieval protocol, a post-quantum Tor variant, signature-based location checks, and client-puzzle rate limiting to meet all four security goals at once while staying efficient for large numbers of users. A sympathetic reader cares because successful spectrum sharing depends on users trusting the system enough to participate without fear of surveillance or disruption.

Core claim

We propose QPADL, the first post-quantum secure framework that simultaneously ensures privacy, anonymity, location verification, and DoS resilience while maintaining efficiency for large-scale spectrum access systems. QPADL introduces SAS-tailored private information retrieval for location privacy, a PQ-variant of Tor for anonymity, and employs advanced signature constructions for location verification alongside client puzzle protocols and rate-limiting technique for DoS defense. We formally assess its security and conduct a comprehensive performance evaluation, incorporating GPU parallelization and optimization strategies to demonstrate practicality and scalability.

What carries the argument

The QPADL framework that combines an SAS-tailored private information retrieval protocol, a post-quantum Tor variant, advanced signature constructions for location verification, and client-puzzle plus rate-limiting mechanisms for DoS defense.

If this is right

  • Users can submit spectrum queries without revealing their precise locations to the database operator.
  • User identities stay hidden from both the database and other participants even under quantum threats.
  • Spoofed location claims are rejected through cryptographic verification before any spectrum is granted.
  • Computational puzzles and traffic limits prevent attackers from overwhelming the system with fake queries.
  • GPU optimizations keep response times acceptable even when thousands of users query simultaneously.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same layered approach could be reused in other location-based wireless services that face quantum and privacy risks.
  • Real deployment on live 5G or CBRS networks would show whether the measured overheads remain acceptable under regulatory load limits.
  • The framework points toward a general template for securing future dynamic spectrum sharing in dense environments.

Load-bearing premise

The listed protocols and mechanisms can be combined into one working system that delivers all claimed security properties and efficiency at the same time without new vulnerabilities or excessive overhead.

What would settle it

A working prototype implementation that measures actual query latency, bandwidth, and resistance to simulated quantum attacks plus high-volume DoS traffic on a realistic spectrum database.

Figures

Figures reproduced from arXiv: 2510.03631 by Attila Altay, Kiarash Sedghighadikolaei, Saif Eddine Nouma, Saleh Darzi.

Figure 1
Figure 1. Figure 1: QPADL Full Instantiation seed S is expanded into a k(t−1)-bit query q using a pseudo￾random generator (PRG) (Steps 1-2). The corresponding value A is computed by XORing all non-flip chunks whose positions in q are set to 1, and the resulting (S, A) pair is added to Qi (Step 3). Since each PSD holds (t − 1) non-flip chunks out of n, the preprocessing phase covers (t−1)/n of the DB, leaving only 1/n for comp… view at source ↗
Figure 3
Figure 3. Figure 3: End-to-End Cryptographic Delay transmissions due to Tor’s 512-byte packet size, resulting in an average circuit build time of about 300 ms. As each retrieved block remains under 50 KB, the PQ-Tor communication delay is bounded at approximately 175 ms. (iii) In service request phase, the client transmits the location commitment, PoL, and the signed token. The HCT solution size is ⌈log2 (nl)⌉ × |H| bits, whi… view at source ↗
read the original abstract

With advances in wireless communication and growing spectrum scarcity, Spectrum Access Systems (SASs) offer an opportunistic solution but face significant security challenges. Regulations require disclosure of location coordinates and transmission details, exposing user privacy and anonymity during spectrum queries, while the database operations themselves permit Denial-of-Service (DoS) attacks. As location-based services, SAS is also vulnerable to compromised or malicious users conducting spoofing attacks. These threats are further amplified given the advances in quantum computing. Thus, we propose QPADL, the first post-quantum (PQ) secure framework that simultaneously ensures privacy, anonymity, location verification, and DoS resilience while maintaining efficiency for large-scale spectrum access systems. QPADL introduces SAS-tailored private information retrieval for location privacy, a PQ-variant of Tor for anonymity, and employs advanced signature constructions for location verification alongside client puzzle protocols and rate-limiting technique for DoS defense. We formally assess its security and conduct a comprehensive performance evaluation, incorporating GPU parallelization and optimization strategies to demonstrate practicality and scalability.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 1 minor

Summary. The manuscript proposes QPADL, a post-quantum secure framework for Spectrum Access Systems (SAS) that integrates SAS-tailored private information retrieval for location privacy, a post-quantum variant of Tor for anonymity, advanced signature constructions for location verification, and client puzzle protocols combined with rate-limiting for DoS resilience. It claims to formally assess the security of this framework and conduct a performance evaluation incorporating GPU parallelization to show practicality and scalability for large-scale systems.

Significance. Should the composition of these mechanisms be shown to preserve all individual security properties without introducing new attack vectors, this work would offer a valuable contribution to post-quantum cryptography applications in wireless spectrum management by addressing privacy, anonymity, verification, and availability concerns in a unified manner. The inclusion of efficiency optimizations is a strength for real-world applicability.

major comments (1)
  1. [Security Assessment] The central claim of simultaneous guarantees for privacy, anonymity, location verification, and DoS resilience relies on the secure composition of the four components. However, while individual security arguments are provided for each (PIR, PQ-Tor, signatures, puzzles), there is no explicit joint security model, game sequence, or reduction that considers an adversary who can interact across the interfaces, for example by leveraging Tor circuit data to refine PIR queries or using signature leakage for DoS amplification. This omission is load-bearing for the 'simultaneously ensures' assertion in the abstract.
minor comments (1)
  1. [Abstract] The abstract states that formal security assessment and performance evaluation were conducted but does not reference specific theorems, reductions, or metrics; moving some of these details to the abstract or adding a summary table of security properties would improve clarity.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading and constructive feedback on the security composition of QPADL. We address the major comment below and will incorporate revisions to strengthen the formal analysis.

read point-by-point responses

  1. Referee: [Security Assessment] The central claim of simultaneous guarantees for privacy, anonymity, location verification, and DoS resilience relies on the secure composition of the four components. However, while individual security arguments are provided for each (PIR, PQ-Tor, signatures, puzzles), there is no explicit joint security model, game sequence, or reduction that considers an adversary who can interact across the interfaces, for example by leveraging Tor circuit data to refine PIR queries or using signature leakage for DoS amplification. This omission is load-bearing for the 'simultaneously ensures' assertion in the abstract.

    Authors: We agree that an explicit joint security model is necessary to rigorously support the simultaneous guarantees claimed in the abstract. The current manuscript provides per-component security arguments (detailed in the security analysis sections for the SAS-tailored PIR, PQ-Tor variant, signature constructions, and client-puzzle/rate-limiting mechanisms) under standard assumptions for each primitive. However, we acknowledge the absence of a unified game that models an adversary capable of cross-interface interactions. In the revised version, we will add a dedicated subsection defining a single security experiment in which the adversary is given oracle access to all QPADL interfaces simultaneously. This game will explicitly capture the example attack vectors mentioned (e.g., using Tor circuit metadata to inform PIR queries or leveraging signature leakage to amplify DoS attempts). We will then prove that any successful attack in this joint game implies a break in at least one of the underlying post-quantum primitives, thereby establishing that the composition preserves the individual properties without introducing new attack surfaces when the components are instantiated as described in the protocol. revision: yes

Circularity Check

0 steps flagged

No circularity: construction proposal with separate security claims

full rationale

The paper presents QPADL as a composite framework integrating PIR, a PQ-Tor variant, signatures, and puzzles, with claims of formal security assessment and performance evaluation. No equations, fitted parameters, or predictions are shown that reduce by construction to the inputs themselves. Security arguments are described as assessed separately rather than defined tautologically within the framework. No self-citation chains, uniqueness theorems, or ansatzes are invoked in the provided text to bear the central claims. This matches the default case of a self-contained proposal whose content does not collapse into its own definitions or fits.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The framework rests on standard post-quantum cryptographic hardness assumptions and domain assumptions about efficiency in large-scale systems; no new physical entities are postulated and no free parameters are fitted to data in the abstract description.

axioms (2)
  • standard math Post-quantum cryptographic primitives such as lattice-based or hash-based constructions remain secure against quantum adversaries.
    Invoked to justify the overall post-quantum security of the framework components.
  • domain assumption The combined protocols maintain practical efficiency and scalability for large numbers of spectrum users.
    Stated in the claim of practicality demonstrated via GPU parallelization and optimization.

pith-pipeline@v0.9.0 · 5722 in / 1527 out tokens · 63177 ms · 2026-05-18T10:44:09.360750+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

50 extracted references · 50 canonical work pages

  1. [1]

    Preserving the location privacy of secondary users in cooperative spectrum sensing,

    M. Grissa, A. A. Yavuz, and B. Hamdaoui, “Preserving the location privacy of secondary users in cooperative spectrum sensing,”IEEE Transactions on Information Forensics and Security, vol. 12, 2016

    work page 2016

  2. [2]

    Anonymous dynamic spectrum access and sharing mechanisms for the cbrs band,

    M. Grissa, A. A. Yavuz, B. Hamdaoui, and C. Tirupathi, “Anonymous dynamic spectrum access and sharing mechanisms for the cbrs band,” IEEE Access, vol. 9, pp. 33 860–33 879, 2021

    work page 2021

  3. [3]

    Capow: Context-aware ai- assisted proof of work based ddos defense,

    T. Chakraborty, S. Mitra, and S. Mittal, “Capow: Context-aware ai- assisted proof of work based ddos defense,”arXiv preprint, 2023

    work page 2023

  4. [4]

    Cognitive radio network: Security and reliability trade-off-status, challenges, and future trend,

    D. K. Jasim and S. B. Sadkhan, “Cognitive radio network: Security and reliability trade-off-status, challenges, and future trend,” in2021 1st Babylon International Conference on Information Technology and Science (BICITS). IEEE, 2021, pp. 149–153

    work page 2021

  5. [5]

    Privacy-preserving spectrum query with location proofs in database-driven crns,

    J. Xin, M. Li, C. Luo, and P. Li, “Privacy-preserving spectrum query with location proofs in database-driven crns,” in2016 IEEE Global Communications Conference (GLOBECOM). IEEE, 2016, pp. 1–6

    work page 2016

  6. [6]

    Privacy-preserving and post-quantum counter denial of service framework for wireless networks,

    S. Darzi and A. A. Yavuz, “Privacy-preserving and post-quantum counter denial of service framework for wireless networks,” inMILCOM 2024- IEEE Military Communications Conference. IEEE, 2024

    work page 2024

  7. [7]

    Post quantum cryptography: a review of techniques, challenges and standardizations,

    R. Bavdekar, E. J. Chopde, A. Agrawal, A. Bhatia, and K. Tiwari, “Post quantum cryptography: a review of techniques, challenges and standardizations,” in2023 International Conference on Information Networking (ICOIN). IEEE, 2023, pp. 146–151

    work page 2023

  8. [8]

    A survey on citizens broadband radio service (cbrs),

    P. Agarwal, M. Manekiya, T. Ahmad, A. Yadav, A. Kumar, M. Donelli, and S. T. Mishra, “A survey on citizens broadband radio service (cbrs),” Electronics, vol. 11, no. 23, p. 3985, 2022

    work page 2022

  9. [9]

    Lightweight privacy preservation for securing large-scale database-driven cognitive radio networks with location verification,

    R. Zhu, L. Xu, Y . Zeng, and X. Yi, “Lightweight privacy preservation for securing large-scale database-driven cognitive radio networks with location verification,”Security and Communication Networks, 2019

    work page 2019

  10. [10]

    Differential privacy in cognitive radio networks: a comprehensive survey,

    M. Ul Hassan, M. H. Rehmani, M. Rehan, and J. Chen, “Differential privacy in cognitive radio networks: a comprehensive survey,”Cognitive Computation, vol. 14, no. 2, pp. 475–510, 2022

    work page 2022

  11. [11]

    Spoofing attack and surveillance game in geo-location database driven spectrum sharing,

    N. Nguyen-Thanh, D.-T. Ta, and V .-T. Nguyen, “Spoofing attack and surveillance game in geo-location database driven spectrum sharing,” IET Communications, vol. 13, no. 1, pp. 74–84, 2019

    work page 2019

  12. [12]

    Slap: Secure location-proof and anonymous privacy-preserving spectrum access,

    S. Darzi and A. A. Yavuz, “Slap: Secure location-proof and anonymous privacy-preserving spectrum access,”preprint arXiv:2503.02019, 2025

    work page arXiv 2025

  13. [13]

    Denial-of-service attacks on dy- namic spectrum access networks,

    G. Jakimoski and K. Subbalakshmi, “Denial-of-service attacks on dy- namic spectrum access networks,” inIEEE International Conference on Communications Workshops. IEEE, 2008, pp. 524–528

    work page 2008

  14. [14]

    Counter denial of service for next-generation networks within the artificial intelligence and post-quantum era,

    S. Darzi and A. A. Yavuz, “Counter denial of service for next-generation networks within the artificial intelligence and post-quantum era,” in2024 IEEE 6th International Conference on Trust, Privacy and Security in Intelligent Systems, and Applications (TPS-ISA). IEEE, 2024

    work page 2024

  15. [15]

    Flad: adaptive federated learning for ddos attack detection,

    R. Doriguzzi-Corin and D. Siracusa, “Flad: adaptive federated learning for ddos attack detection,”Computers & Security, vol. 137, 2024

    work page 2024

  16. [16]

    Client puzzle protocols as countermeasure against auto- mated threats to web applications,

    V . Bostanov, “Client puzzle protocols as countermeasure against auto- mated threats to web applications,”IEEE Access, vol. 9, 2021

    work page 2021

  17. [17]

    Foundations, properties, and security applications of puzzles: A survey,

    I. M. Ali, M. Caprolu, and R. D. Pietro, “Foundations, properties, and security applications of puzzles: A survey,”ACM Computing Surveys (CSUR), vol. 53, no. 4, pp. 1–38, 2020

    work page 2020

  18. [18]

    Private information re- trieval,

    B. Chor, E. Kushilevitz, and O. Goldreich, “Private information re- trieval,”Journal of the ACM (JACM), vol. 45, no. 6, pp. 965–981, 1998

    work page 1998

  19. [19]

    Improving the robustness of private information retrieval,

    I. Goldberg, “Improving the robustness of private information retrieval,” in2007 IEEE Symposium on Security and Privacy. IEEE, 2007

    work page 2007

  20. [20]

    Hashcash-a denial of service counter-measure,

    A. Backet al., “Hashcash-a denial of service counter-measure,” 2002

    work page 2002

  21. [21]

    Module-lattice-based digital signature standard,

    T. Dang, J. Lichtinger, Y .-K. Liu, C. Miller, D. Moody, R. Peralta, and R. Perlner, “Module-lattice-based digital signature standard,” 2024

    work page 2024

  22. [22]

    Falcon: Fast-fourier lattice-based compact signatures over ntru,

    P.-A. Fouque, J. Hoffstein, P. Kirchner, V . Lyubashevsky, T. Pornin, T. Prest, T. Ricosset, G. Seiler, W. Whyte, Z. Zhanget al., “Falcon: Fast-fourier lattice-based compact signatures over ntru,”NIST’s post- quantum cryptography standardization process, vol. 36, no. 5, 2018

    work page 2018

  23. [23]

    Stateless hash-based digital signature standard,

    D. Cooperet al., “Stateless hash-based digital signature standard,” 2024

    work page 2024

  24. [24]

    Efficient linkable ring sig- natures: new framework and post-quantum instantiations,

    Y . Xue, X. Lu, M. H. Au, and C. Zhang, “Efficient linkable ring sig- natures: new framework and post-quantum instantiations,” inEuropean Symposium on Research in Computer Security. Springer, 2024

    work page 2024

  25. [25]

    ethstark documentation–version 1.1,

    S. Team, “ethstark documentation–version 1.1,” IACR preprint archive 2021, Tech. Rep., 2021

    work page 2021

  26. [26]

    Quantum security analysis of aes,

    X. Bonnetain, M. Naya-Plasencia, and A. Schrottenloher, “Quantum security analysis of aes,”IACR Transactions on Symmetric Cryptology, vol. 2019, no. 2, pp. 55–93, 2019

    work page 2019

  27. [27]

    Fips 203 module-lattice-based key- encapsulation mechanism standard,

    N. I. of Standards and Technology, “Fips 203 module-lattice-based key- encapsulation mechanism standard,” 2024

    work page 2024

  28. [28]

    Location privacy leaking from spectrum utilization information in database-driven cognitive radio network,

    Z. Gao, H. Zhu, Y . Liu, M. Li, and Z. Cao, “Location privacy leaking from spectrum utilization information in database-driven cognitive radio network,” inProceedings of the 2012 ACM conference on Computer and communications security, 2012, pp. 1025–1027

    work page 2012

  29. [29]

    Protecting the primary users’ operational privacy in spectrum sharing,

    B. Bahrak, S. Bhattarai, A. Ullah, J.-M. J. Park, J. Reed, and D. Gurney, “Protecting the primary users’ operational privacy in spectrum sharing,” in2014 IEEE International Symposium on Dynamic Spectrum Access Networks (DYSPAN). IEEE, 2014, pp. 236–247

    work page 2014

  30. [30]

    Geohash coding location privacy protection scheme based on entropy weight topsis,

    L. Jing, L. Ke, Z. Lei, Y . Xiaoya, J. Yuanyuan, and J. Huinan, “Geohash coding location privacy protection scheme based on entropy weight topsis,”The Journal of Supercomputing, vol. 81, no. 1, p. 85, 2025

    work page 2025

  31. [31]

    Received signal strength based location estimation of a wireless lan client,

    M. Robinson and I. Psaromiligkos, “Received signal strength based location estimation of a wireless lan client,” inIEEE Wireless Com- munications and Networking Conference, vol. 4. IEEE, 2005

    work page 2005

  32. [32]

    Localizing wifi access points using signal strength,

    J. Koo and H. Cha, “Localizing wifi access points using signal strength,” IEEE Communications letters, vol. 15, no. 2, pp. 187–189, 2010

    work page 2010

  33. [33]

    {GPU- accelerated}{PIR}with{Client-Independent}preprocessing for {Large-Scale}applications,

    D. G ¨unther, M. Heymann, B. Pinkas, and T. Schneider, “{GPU- accelerated}{PIR}with{Client-Independent}preprocessing for {Large-Scale}applications,” in31st USENIX Security Symposium (USENIX Security 22), 2022, pp. 1759–1776

    work page 2022

  34. [34]

    Dos-resistant authentication with client puzzles,

    T. Aura, P. Nikander, and J. Leiwo, “Dos-resistant authentication with client puzzles,” inInternational workshop on security protocols. Springer, 2000, pp. 170–177

    work page 2000

  35. [35]

    Finding partial hash collisions by brute force parallel programming,

    V . Chiriaco, A. Franzen, and R. Thayil, “Finding partial hash collisions by brute force parallel programming,” in2017 IEEE Long Island Systems, Applications and Technology Conference (LISAT). IEEE, 2017

    work page 2017

  36. [36]

    Hashcash tree, a data structure to mitigate denial-of-service attacks,

    M. Alviano, “Hashcash tree, a data structure to mitigate denial-of-service attacks,”Algorithms, vol. 16, no. 10, p. 462, 2023

    work page 2023

  37. [37]

    Lattice-based proof-of-work for post-quantum blockchains,

    R. Behnia, E. W. Postlethwaite, M. O. Ozmen, and A. A. Yavuz, “Lattice-based proof-of-work for post-quantum blockchains,” inInter- national Workshop on Data Privacy Management. Springer, 2021

    work page 2021

  38. [38]

    Darmstadt svp challenge,

    “Darmstadt svp challenge,” https://www.latticechallenge.org/ svp-challenge/, 2024, accessed: April, 2024

    work page 2024

  39. [39]

    Gpu-based private information retrieval for on-device machine learning inference,

    M. Lam, J. Johnson, W. Xiong, K. Maeng, and U. Gupta, “Gpu-based private information retrieval for on-device machine learning inference,” arXiv preprint arXiv:2301.10904, 2023

    work page arXiv 2023

  40. [40]

    Cat: A gpu-accelerated fhe framework with its application to high-precision private dataset query,

    Q. Li and R. Zong, “Cat: A gpu-accelerated fhe framework with its application to high-precision private dataset query,”arXiv preprint arXiv:2503.22227, 2025

    work page arXiv 2025

  41. [41]

    Nvidia cuda software and gpu parallel computing architecture,

    D. Kirket al., “Nvidia cuda software and gpu parallel computing architecture,” inISMM, vol. 7, 2007, pp. 103–104

    work page 2007

  42. [42]

    Can tensor cores benefit memory-bound kernels?(no!),

    L. Zhang, J. Huang, S. Di, S. Matsuoka, and M. Wahib, “Can tensor cores benefit memory-bound kernels?(no!),” inProceedings of the 17th Workshop on General Purpose Processing Using GPU, 2025, pp. 28–34

    work page 2025

  43. [43]

    A high- performance matrix–matrix multiplication methodology for cpu and gpu architectures,

    V . Kelefouras, A. Kritikakou, I. Mporas, and V . Kolonias, “A high- performance matrix–matrix multiplication methodology for cpu and gpu architectures,”The Journal of supercomputing, vol. 72, no. 3, 2016

    work page 2016

  44. [44]

    Fiat-shamir: from practice to theory,

    R. Canetti, Y . Chen, J. Holmgren, A. Lombardi, G. N. Rothblum, R. D. Rothblum, and D. Wichs, “Fiat-shamir: from practice to theory,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019, pp. 1082–1090

    work page 2019

  45. [45]

    The circle game: Scalable private membership test using trusted hardware,

    S. Tamrakar, J. Liu, A. Paverd, J.-E. Ekberg, B. Pinkas, and N. Asokan, “The circle game: Scalable private membership test using trusted hardware,” inProceedings of the 2017 ACM on Asia Conference on Computer and Communications Security, 2017, pp. 31–44

    work page 2017

  46. [46]

    Crystals- kyber: a cca-secure module-lattice-based kem,

    J. Bos, L. Ducas, E. Kiltz, T. Lepoint, and V . Lyubashevsky, “Crystals- kyber: a cca-secure module-lattice-based kem,” in2018 IEEE European Symposium on Security and Privacy (EuroS&P). IEEE, 2018

    work page 2018

  47. [47]

    Chandra,Parallel programming in OpenMP

    R. Chandra,Parallel programming in OpenMP. Morgan kaufmann, 2001

    work page 2001

  48. [48]

    Rescue-prime: a standard specification (sok),

    A. Szepieniec, T. Ashur, and S. Dhooghe, “Rescue-prime: a standard specification (sok),”Cryptology ePrint Archive, 2020

    work page 2020

  49. [49]

    The general sieve kernel and new records in lattice reduction,

    M. R. Albrecht, L. Ducas, G. Herold, E. Kirshanova, and E. W. Postlethwaite, “The general sieve kernel and new records in lattice reduction,” inAnnual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, 2019

    work page 2019

  50. [50]

    Tor metrics,

    “Tor metrics,” https://metrics.torproject.org/torperf.html, accessed: 2024

    work page 2024