Tootfinder

Obfuscated Quantum and Post-Quantum Cryptography
Anju Rani, Xiaoyu Ai, Aman Gupta, Ravi Singh Adhikari, Robert Malaney
https://arxiv.org/abs/2508.07635 https://

Obfuscated Quantum and Post-Quantum Cryptography
In this work, we present an experimental deployment of a new design for combined quantum key distribution (QKD) and post-quantum cryptography (PQC). Novel to our system is the dynamic obfuscation of the QKD-PQC sequence of operations, the number of operations, and parameters related to the operations; coupled to the integration of a GPS-free quantum synchronization protocol within the QKD process. We compare the performance and overhead of our QKD-PQC system relative to a standard QKD system wi…

from my link log —
Ascon lightweight cryptography.
https://ascon.isec.tugraz.at/
saved 2025-08-13 https://dotat.at/:/0C8XF.html

Had a lovely evening while playing an experimental board game on post-quantum #cryptography with people from Tampere University, the OpenSSL Foundation and Cybernetica.
A fitting end for the 2025 #OpenSSL Conference.

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- Robustness of Locally Differentially Private Graph Analysis Against Poisoning
Jacob Imola, Amrita Roy Chowdhury, Kamalika Chaudhuri

Deep holes of a class of twisted Reed-Solomon codes
Haojie Gu, Nan Wang, Jun Zhang
https://arxiv.org/abs/2509.08526 https://arxiv.org/pdf/2509.08526…

Deep holes of a class of twisted Reed-Solomon codes
The deep hole problem is a fundamental problem in coding theory, and it has many important applications in code constructions and cryptography. The deep hole problem of Reed-Solomon codes has gained a lot of attention. As a generalization of Reed-Solomon codes, we investigate the problem of deep holes of a class of twisted Reed-Solomon codes in this paper. Firstly, we provide the necessary and sufficient conditions for $\boldsymbol{a}=(a_{0},a_{1},\cdots,a_{n-k-1})\in\mathbb{F}_{q}^{n-k}$ to …

I think the best summary until now about Post-quantum cryptography is from Peter Gutmann in the cryptography mailing-list.

Given that after 20 years and hundreds of millions of dollars spent researchers have yet to demonstrate a single legitimate cryptanalysis result using a quantum physics experiment, it's a bit like arguing over which brand of unicorn repellent is the most cromulent.

The current state of things in terms of pure vs. hybrid systems seems to be:

- …

Crosslisted article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- Hammer and Anvil: A Principled Defense Against Backdoors in Federated Learning
Lucas Fenaux, Zheng Wang, Jacob Yan, Nathan Chung, Florian Kerschbaum

Analyzing the capabilities of HLS and RTL tools in the design of an FPGA Montgomery Multiplier
Rares Ifrim, Decebal Popescu
https://arxiv.org/abs/2509.08067 https://

Analyzing the capabilities of HLS and RTL tools in the design of an FPGA Montgomery Multiplier
We present the analysis of various FPGA design implementations of a Montgomery Modular Multiplier, compatible with the BLS12-381 elliptic curve, using the Coarsely Integrated Operand Scanning approach of working with complete partial products on different digit sizes. The scope of the implemented designs is to achieve a high-frequency, high-throughput solution capable of computing millions of operations per second, which can provide a strong foundation for different Elliptic Curve Cryptography …

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- UnsafeBench: Benchmarking Image Safety Classifiers on Real-World and AI-Generated Images
Yiting Qu, Xinyue Shen, Yixin Wu, Michael Backes, Savvas Zannettou, Yang Zhang

Less is More: On Copy Complexity in Quantum Cryptography
Prabhanjan Ananth, Eli Goldin
https://arxiv.org/abs/2510.04992 https://arxiv.org/pdf/2510.04992

Less is More: On Copy Complexity in Quantum Cryptography
Quantum cryptographic definitions are often sensitive to the number of copies of the cryptographic states revealed to an adversary. Making definitional changes to the number of copies accessible to an adversary can drastically affect various aspects including the computational hardness, feasibility, and applicability of the resulting cryptographic scheme. This phenomenon appears in many places in quantum cryptography, including quantum pseudorandomness and unclonable cryptography. To address th…

Crosslisted article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- Adtech and Real-Time Bidding under European Data Protection Law
Michael Veale, Frederik Zuiderveen Borgesius

SiPearl unveils Athena1, Europe's first high-performance CPU with up to 80 cores designed for civilian and military use, slated for commercial launch in H2 2027 (Anton Shilov/Tom's Hardware)
https://www.…

SiPearl unveils Europe's first dual-use sovereign processor with 80 cores — expected in 2027 for government, aerospace, and defense applications
Rhea with advanced security and cryptography and without HBM2E.

Also yesterday at #OpenSSLCon25: Alex Gaynor of #Python #Cryptography saying their own X.509 parser written in Rust is six times faster than

»DID Method for Natural Persons«
Does anyone know about this and are there any post-quantum cryptography approaches available? How widespread is it, and is it already being used extensively? If so, where and by whom in what areas?
I thank you in advance for your answers and the retoot :BoostOK:
🧑‍💻 https://

About how AI tools can be useful.
#ai #coding

Claude Code Can Debug Low-level Cryptography
Surprisingly (to me) Claude Code debugged my new ML-DSA implementation faster than I would have, finding the non-obvious low-level issue that was making Verify fail.

AI-Driven Post-Quantum Cryptography for Cyber-Resilient V2X Communication in Transportation Cyber-Physical Systems
Akid Abrar, Sagar Dasgupta, Mizanur Rahman, Ahmad Alsharif
https://arxiv.org/abs/2510.08496

AI-Driven Post-Quantum Cryptography for Cyber-Resilient V2X Communication in Transportation Cyber-Physical Systems
Transportation Cyber-Physical Systems (TCPS) integrate physical elements, such as transportation infrastructure and vehicles, with cyber elements via advanced communication technologies, allowing them to interact seamlessly. This integration enhances the efficiency, safety, and sustainability of transportation systems. TCPS rely heavily on cryptographic security to protect sensitive information transmitted between vehicles, transportation infrastructure, and other entities within the transporta…

❄️ NSA and IETF: Can an attacker simply purchase standardization of weakened cryptography?
#cryptography

[2025-09-11 Thu (UTC), 24 new articles found for cs.CR Cryptography and Security]
toXiv_bot_toot

An Improved Quantum Algorithm for 3-Tuple Lattice Sieving
Lynn Engelberts, Yanlin Chen, Amin Shiraz Gilani, Maya-Iggy van Hoof, Stacey Jeffery, Ronald de Wolf
https://arxiv.org/abs/2510.08473

An Improved Quantum Algorithm for 3-Tuple Lattice Sieving
The assumed hardness of the Shortest Vector Problem in high-dimensional lattices is one of the cornerstones of post-quantum cryptography. The fastest known heuristic attacks on SVP are via so-called sieving methods. While these still take exponential time in the dimension $d$, they are significantly faster than non-heuristic approaches and their heuristic assumptions are verified by extensive experiments. $k$-Tuple sieving is an iterative method where each iteration takes as input a large numbe…

from my link log —
Dennis Ritchie’s story of dabbling in the cryptographic world.
https://web.archive.org/web/20250121041734/https://www.bell-labs.com/usr/dmr/www/crypt.html
saved 2025-11-04

[2025-09-12 Fri (UTC), 20 new articles found for cs.CR Cryptography and Security]
toXiv_bot_toot

[2025-08-12 Tue (UTC), 19 new articles found for cs.CR Cryptography and Security]
toXiv_bot_toot

«The raging mob of peasants is told to put away their torches and pitchforks, and to be reasonable, and to let the adults in the room get on with governance. As the saying goes, "The purpose of a system is what it does", and this system seems to overwhelmingly favour Google at the expense of all those unruly peasants»
Shouldn't we trust Google and other pertinent questions - lolnope
https://cryptography.dog/blog/shouldnt-we-trust-google/

On Cryptography and Distribution Verification, with Applications to Quantum Advantage
Bruno Cavalar, Eli Goldin, Matthew Gray, Taiga Hiroka, Tomoyuki Morimae
https://arxiv.org/abs/2510.05028

On Cryptography and Distribution Verification, with Applications to Quantum Advantage
One of the most fundamental problems in the field of hypothesis testing is the identity testing problem: whether samples from some unknown distribution $\mathcal{G}$ are actually from some explicit distribution $\mathcal{D}$. It is known that when the distribution $\mathcal{D}$ has support $[N]$, the optimal sample complexity for the identity testing problem is roughly $O(\sqrt{N})$. However, many distributions of interest, including those which can be sampled efficiently, have exponential supp…

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[2/2]:
- Obfuscated Quantum and Post-Quantum Cryptography
Anju Rani, Xiaoyu Ai, Aman Gupta, Ravi Singh Adhikari, Robert Malaney

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- Computing $\varphi(N)$ for an RSA module with a single quantum query
Luis V\'ictor Dieulefait, Jorge Urr\'oz

Crosslisted article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- What is Quantum Computer Security?
Sanjay Deshpande, Jakub Szefer
https://

Crosslisted article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- VISION: Robust and Interpretable Code Vulnerability Detection Leveraging Counterfactual Augmentation
David Egea, Barproda Halder, Sanghamitra Dutta

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- Model-Based Calculation Method of Mining Fairness in Blockchain
Akira Sakurai, Kazuyuki Shudo

Crosslisted article(s) found for cs.AR. https://arxiv.org/list/cs.AR/new
[1/1]:
- Error Detection Schemes for Barrett Reduction of CT-BU on FPGA in Post Quantum Cryptography
Paresh Baidya, Rourab Paul, Vikas Srivastava, Sumit Kumar Debnath

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/2]:
- A Quantitative Security Analysis of S-boxes in the NIST Lightweight Cryptography Finalists
Mahnoor Naseer, Sundas Tariq, Naveed Riaz, Naveed Ahmed, Shah Fahd, Mureed Hussain, Sajid Ali Khan

from my link log —
Kerberoasting: bad cryptography in Microsoft Windows Active Directory.
https://blog.cryptographyengineering.com/2025/09/10/kerberoasting/
saved 2025-09-10

[2025-10-10 Fri (UTC), 21 new articles found for cs.CR Cryptography and Security]
toXiv_bot_toot

Cheat-Penalised Quantum Weak Coin-Flipping
Atul Singh Arora, Carl A. Miller, Mauro E. S. Morales, Jamie Sikora
https://arxiv.org/abs/2510.03218 https://arx…

Cheat-Penalised Quantum Weak Coin-Flipping
Coin-flipping is a fundamental task in two-party cryptography where two remote mistrustful parties wish to generate a shared uniformly random bit. While quantum protocols promising near-perfect security exist for weak coin-flipping -- when the parties want opposing outcomes -- it has been shown that they must be inefficient in terms of their round complexity, and it is an open question of how space efficient they can be. In this work, we consider a variant called cheat-penalised weak coin-flipp…

[2025-09-10 Wed (UTC), 21 new articles found for cs.CR Cryptography and Security]
toXiv_bot_toot

Hybrid Schemes of NIST Post-Quantum Cryptography Standard Algorithms and Quantum Key Distribution for Key Exchange and Digital Signature
Abel C. H. Chen
https://arxiv.org/abs/2510.02379

Hybrid Schemes of NIST Post-Quantum Cryptography Standard Algorithms and Quantum Key Distribution for Key Exchange and Digital Signature
Since the security of post-quantum cryptography (PQC) algorithms is based on the hardness of mathematical problems, while the security of quantum key distribution (QKD) relies on the fundamental principles of quantum physics, each approach possesses distinct advantages and limitations that can complement one another. Consequently, recent studies have proposed hybrid schemes that combine QKD and PQC to establish a dual-layered security model. In response to this trend, this study proposes hybrid…

A Monoid Ring Approach to Color Visual Cryptography
Maximilian Reif, Jens Zumbr\"agel
https://arxiv.org/abs/2510.00763 https://arxiv.org/pdf/2510.0076…

A Monoid Ring Approach to Color Visual Cryptography
A visual cryptography scheme is a secret sharing scheme in which the secret information is an image and the shares are printed on transparencies, so that the secret image can be recovered by simply stacking the shares on top of each other. Such schemes do therefore not require any knowledge of cryptography tools to recover the secret, and they have widespread applications, for example, when sharing QR codes or medical images. In this work we deal with visual cryptography threshold schemes for c…

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/2]:
- Friend or Foe Inside? Exploring In-Process Isolation to Maintain Memory Safety for Unsafe Rust
Merve G\"ulmez, Thomas Nyman, Christoph Baumann, Jan Tobias M\"uhlberg

Absence of quantum Darwinism as a resource in secure quantum communication and computation
Bishal Kumar Das, Sourav Manna, Vaibhav Madhok
https://arxiv.org/abs/2510.03225 https:…

Absence of quantum Darwinism as a resource in secure quantum communication and computation
The emergence of classical world from underlying quantum mechanics is characterized by not only vanishing quantum correlations but also an unfolding of objectivity also known as quantum Darwinism. We show that the absence of this objectivity has a quantum advantage in cryptography and also provides the crucial missing link in efficient classical simulation of quantum circuits with zero discord. For this purpose, we consider a model of mixed state quantum computation where one is promised concor…

Crosslisted article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- Leveraging Large Language Models for Cybersecurity Risk Assessment -- A Case from Forestry Cyber-...
Fikret Mert G\"ultekin, Oscar Lilja, Ranim Khojah, Rebekka Wohlrab, Marvin Damschen, Mazen Mohamad

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[2/2]:
- On Rate-Optimal Partitioning Classification from Observable and from Privatised Data
Bal\'azs Csan\'ad Cs\'aji, L\'aszl\'o Gy\"orfi, Ambrus Tam\'as, Harro Walk

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/2]:
- Systematic Assessment of Tabular Data Synthesis
Yuntao Du, Ninghui Li
https://

Crosslisted article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- Enhancing Gradient Variance and Differential Privacy in Quantum Federated Learning
Duc-Thien Phan, Minh-Duong Nguyen, Quoc-Viet Pham, Huilong Pi

Crosslisted article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[2/2]:
- On Cryptography and Distribution Verification, with Applications to Quantum Advantage
Bruno Cavalar, Eli Goldin, Matthew Gray, Taiga Hiroka, Tomoyuki Morimae

Constructing a Photonic Implementation of Quantum Key Distribution
Alec L. Riso, Karthik Thyagarajan, Connor Whiting, Katherine Jimenez, Mark Hannum
https://arxiv.org/abs/2509.04389

Constructing a Photonic Implementation of Quantum Key Distribution
Quantum Key Distribution (QKD) stands as a revolutionary approach to secure communication, using the principles of quantum mechanics to establish unbreakable channels. Unlike traditional cryptography, which relies on the computational difficulty of mathematical problems, QKD utilizes the inherent properties of quantum states to achieve information-theoretic security. This means that the security of the key exchange is guaranteed by the laws of physics, making it theoretically unbreakable even b…

Embedded Off-Switches for AI Compute
James Petrie
https://arxiv.org/abs/2509.07637 https://arxiv.org/pdf/2509.07637…

Embedded Off-Switches for AI Compute
To address the risks of increasingly capable AI systems, we introduce a hardware-level off-switch that embeds thousands of independent "security blocks" in each AI accelerator. This massively redundant architecture is designed to prevent unauthorized chip use, even against sophisticated physical attacks. Our main security block design uses public key cryptography to check the authenticity of authorization licenses, and randomly generated nonces to prevent replay attacks. We evaluate attack vect…

Comparison of Fully Homomorphic Encryption and Garbled Circuit Techniques in Privacy-Preserving Machine Learning Inference
Kalyan Cheerla (University of North Texas), Lotfi Ben Othmane (University of North Texas), Kirill Morozov (University of North Texas)
https://arxiv.org/abs/2510.07457

Comparison of Fully Homomorphic Encryption and Garbled Circuit Techniques in Privacy-Preserving Machine Learning Inference
Machine Learning (ML) is making its way into fields such as healthcare, finance, and Natural Language Processing (NLP), and concerns over data privacy and model confidentiality continue to grow. Privacy-preserving Machine Learning (PPML) addresses this challenge by enabling inference on private data without revealing sensitive inputs or proprietary models. Leveraging Secure Computation techniques from Cryptography, two widely studied approaches in this domain are Fully Homomorphic Encryption (F…

Evaluating Security Properties in the Execution of Quantum Circuits
Paolo Bernardi, Antonio Brogi, Gian-Luigi Ferrari, Giuseppe Bisicchia
https://arxiv.org/abs/2509.03306 https:…

Evaluating Security Properties in the Execution of Quantum Circuits
Quantum computing is a disruptive technology that is expected to offer significant advantages in many critical fields (e.g. drug discovery and cryptography). The security of information processed by such machines is therefore paramount. Currently, modest Noisy Intermediate-Scale Quantum (NISQ) devices are available. The goal of this work is to identify a practical, heuristic methodology to evaluate security properties, such as secrecy and integrity, while using quantum processors owned by poten…

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[2/2]:
- HIPAAChecker: The Comprehensive Solution for HIPAA Compliance in Android mHealth Apps
Bilash Saha, Md Raihan Mia, Sharaban Tahora, Abdul Barek, Hossain Shahriar

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/2]:
- SCART: Simulation of Cyber Attacks for Real-Time
Eliron Rahimi, Kfir Girstein, Roman Malits, Avi Mendelson
…

Multi-Copy Security in Unclonable Cryptography
Alper \c{C}akan, Vipul Goyal, Fuyuki Kitagawa, Ryo Nishimaki, Takashi Yamakawa
https://arxiv.org/abs/2510.12626 https://

Multi-Copy Security in Unclonable Cryptography
Unclonable cryptography leverages the quantum no-cloning principle to copy-protect cryptographic functionalities. While most existing works address the basic single-copy security, the stronger notion of multi-copy security remains largely unexplored. We introduce a generic compiler that upgrades collusion-resistant unclonable primitives to achieve multi-copy security, assuming only one-way functions. Using this framework, we obtain the first multi-copy secure constructions of public-key quant…

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[2/2]:
- FinP: Fairness-in-Privacy in Federated Learning by Addressing Disparities in Privacy Risk
Tianyu Zhao, Mahmoud Srewa, Salma Elmalaki

Crosslisted article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- VeriGuard: Enhancing LLM Agent Safety via Verified Code Generation
Miculicich, Parmar, Palangi, Dvijotham, Montanari, Pfister, Le

[2025-10-09 Thu (UTC), 22 new articles found for cs.CR Cryptography and Security]
toXiv_bot_toot

CSI-IBBS: Identity-Based Blind Signature using CSIDH
Soumya Bhoumik, Sarbari Mitra, Rohit Raj Sharma, Kuldeep Namdeo
https://arxiv.org/abs/2509.06127 https://

CSI-IBBS: Identity-Based Blind Signature using CSIDH
Identity-based cryptography (IBC), proposed by Adi Shamir, revolutionized public key authentication by eliminating the need for certificates, enabling a more efficient and scalable approach to cryptographic systems. Meanwhile, in \cite{Katsumata2024group}, Katsumata et al. were the first to present the blind signature protocol based on the hardness assumption of isogeny with provable security, which resembles the Schnorr blind signature. Building upon these foundational concepts, we propose an …

Nonlocal Games Through Communication Complexity and Quantum Cryptography
Pierre Botteron
https://arxiv.org/abs/2510.09457 https://arxiv.org/pdf/2510.09457

Nonlocal Games Through Communication Complexity and Quantum Cryptography
This thesis explores foundational aspects of quantum information theory and quantum cryptography. First, we investigate quantum correlations in interactive settings, including the CHSH and graph isomorphism games. We aim to distinguish quantum correlations from non-signaling correlations by leveraging the principle of communication complexity. To this end, we employ techniques such as distributed computation, majority-function-based distillation protocols, the algebraic and geometric properti…

Introduction to Number Theoretic Transform
Banhirup Sengupta, Peenal Gupta, Souvik Sengupta
https://arxiv.org/abs/2509.05884 https://arxiv.org/pdf/2509.058…

Introduction to Number Theoretic Transform
The Number Theoretic Transform (NTT) can be regarded as a variant of the Discrete Fourier Transform. NTT has been quite a powerful mathematical tool in developing Post-Quantum Cryptography and Homomorphic Encryption. The Fourier Transform essentially decomposes a signal into its frequencies. They are traditionally sine or cosine waves. NTT works more over groups or finite fields rather than on a continuous signal and polynomials work as the analog of sine waves in case of NTT. Fast Fourier Trna…

Crosslisted article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/2]:
- Adversarial training with restricted data manipulation
David Benfield, Stefano Coniglio, Phan Tu Vuong, Alain Zemkoho

[2025-10-08 Wed (UTC), 27 new articles found for cs.CR Cryptography and Security]
toXiv_bot_toot

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- A Quantitative Security Analysis of S-boxes in the NIST Lightweight Cryptography Finalists
Mahnoor Naseer, Sundas Tariq, Naveed Riaz, Naveed Ahmed, Mureed Hussain

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[2/2]:
- Mutual Information Guided Backdoor Mitigation for Pre-trained Encoders
Han, Sun, Ding, Fang, Qian, Li, Chen, Zhang

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/2]:
- LLAMAFUZZ: Large Language Model Enhanced Greybox Fuzzing
Hongxiang Zhang, Yuyang Rong, Yifeng He, Hao Chen
…

Crosslisted article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- A High-Capacity and Secure Disambiguation Algorithm for Neural Linguistic Steganography
Yapei Feng, Feng Jiang, Shanhao Wu, Hua Zhong

A Gentle Introduction to Blind signatures: From RSA to Lattice-based Cryptography
Aditya Bhardwaj, P\'eter Kutas
https://arxiv.org/abs/2509.02189 https://

A Gentle Introduction to Blind signatures: From RSA to Lattice-based Cryptography
Blind signatures were first introduced by David Chaum. They allow a user to have a message signed by a signer without revealing the message itself. This property is particularly useful in applications such as electronic voting and digital cash, where user anonymity is important. In a blind signature scheme, the user blinds their message before sending it to the signer, who signs the blinded message. The user then unblinds the signed message to obtain a valid signature that can be verified publi…

Designing a Layered Framework to Secure Data via Improved Multi Stage Lightweight Cryptography in IoT Cloud Systems
Hojjat Farshadinia, Ali Barati, Hamid Barati
https://arxiv.org/abs/2509.01717

Designing a Layered Framework to Secure Data via Improved Multi Stage Lightweight Cryptography in IoT Cloud Systems
This paper presents a novel multi-layered hybrid security approach aimed at enhancing lightweight encryption for IoT-Cloud systems. The primary goal is to overcome limitations inherent in conventional solutions such as TPA, Blockchain, ECDSA and ZSS which often fall short in terms of data protection, computational efficiency and scalability. Our proposed method strategically refines and integrates these technologies to address their shortcomings while maximizing their individual strengths. By d…

Are Enterprises Ready for Quantum-Safe Cybersecurity?
Tran Duc Le, Phuc Hao Do, Truong Duy Dinh, Van Dai Pham
https://arxiv.org/abs/2509.01731 https://arxi…

Are Enterprises Ready for Quantum-Safe Cybersecurity?
Quantum computing threatens to undermine classical cryptography by breaking widely deployed encryption and signature schemes. This paper examines enterprise readiness for quantum-safe cybersecurity through three perspectives: (i) the technologist view, assessing the maturity of post-quantum cryptography (PQC) and quantum key distribution (QKD); (ii) the enterprise (CISO/CIO) view, analyzing organizational awareness, risk management, and operational barriers; and (iii) the threat actor view, eva…

Enhancing TreePIR for a Single-Server Setting via Resampling
Elian Morel
https://arxiv.org/abs/2510.04882 https://arxiv.org/pdf/2510.04882

Enhancing TreePIR for a Single-Server Setting via Resampling
Private Information Retrieval (PIR) allows a client to retrieve an entry $\text{DB}[i]$ from a public database $\text{DB}$ held by one or more servers, without revealing the queried index $i$. Traditional PIR schemes achieve sublinear server computation only under strong assumptions, such as the presence of multiple non-colluding servers or the use of public-key cryptography. To overcome these limitations, \textit{preprocessing PIR} schemes introduce a query-independent offline phase where the …

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[2/2]:
- Performance and Storage Analysis of CRYSTALS Kyber as a Post Quantum Replacement for RSA and ECC
Nicolas Rodriguez-Alvarez, Fernando Rodriguez-Merino

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/2]:
- Prefix Siphoning: Exploiting LSM-Tree Range Filters For Information Disclosure (Full Version)
Adi Kaufman, Moshik Hershcovitch, Adam Morrison

Crosslisted article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- A Fluid Antenna Enabled Physical Layer Key Generation for Next-G Wireless Networks
Jiacheng Guo, Ning Gao, Yiping Zuo, Hao Xu, Shi Jin, Kai Kit Wong

[2025-10-06 Mon (UTC), 36 new articles found for cs.CR Cryptography and Security]
toXiv_bot_toot

Selmer-Inspired Elliptic Curve Generation
Awnon Bhowmik
https://arxiv.org/abs/2510.02383 https://arxiv.org/pdf/2510.02383

Selmer-Inspired Elliptic Curve Generation
Elliptic curve cryptography (ECC) is foundational to modern secure communication, yet existing standard curves have faced scrutiny for opaque parameter-generation practices. This work introduces a Selmer-inspired framework for constructing elliptic curves that is both transparent and auditable. Drawing from $2$- and $3$-descent methods, we derive binary quartics and ternary cubics whose classical invariants deterministically yield candidate $(c_4,c_6)$ parameters. Local solubility checks, model…

A Survey of Post-Quantum Cryptography Support in Cryptographic Libraries
Nadeem Ahmed, Lei Zhang, Aryya Gangopadhyay
https://arxiv.org/abs/2508.16078 https://

A Survey of Post-Quantum Cryptography Support in Cryptographic Libraries
The rapid advancement of quantum computing poses a significant threat to modern cryptographic systems, necessitating the transition to Post-Quantum Cryptography (PQC). This study evaluates the support for PQC algorithms within nine widely used open-source cryptographic libraries -- OpenSSL, wolfSSL, BoringSSL, LibreSSL, Bouncy Castle, libsodium, Crypto++, Botan, and MbedTLS -- focusing on their implementation of the NIST-selected PQC finalists: CRYSTALS-Kyber, CRYSTALS-Dilithium, FALCON, and SP…

Evolving k-Threshold Visual Cryptography Schemes
Xiaoli Zhuo, Xuehu Yan, Lintao Liu, Wei Yan
https://arxiv.org/abs/2508.15917 https://arxiv.org/pdf/2508.15…

Evolving k-Threshold Visual Cryptography Schemes
In evolving access structures, the number of participants is countably infinite with no predetermined upper bound. While such structures have been realized in secret sharing, research in secret image sharing has primarily focused on visual cryptography schemes (VCS). However, there exists no construction for $(k,\infty)$ VCS that applies to arbitrary $k$ values without pixel expansion currently, and the contrast requires enhancement. In this paper, we first present a formal mathematical definit…

Crosslisted article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- Privacy-Aware Sequential Learning
Yuxin Liu, M. Amin Rahimian
https://

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[2/2]:
- Synthetic Census Data Generation via Multidimensional Multiset Sum
Cynthia Dwork, Kristjan Greenewald, Manish Raghavan

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/2]:
- A Backdoor-based Explainable AI Benchmark for High Fidelity Evaluation of Attributions
Peiyu Yang, Naveed Akhtar, Jiantong Jiang, Ajmal Mian

Crosslisted article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- Private Learning of Littlestone Classes, Revisited
Xin Lyu
https://

Optimizing Scalar Selection in Elliptic Curve Cryptography Using Differential Evolution for Enhanced Security
Takreem Haider
https://arxiv.org/abs/2508.13520 https://

Optimizing Scalar Selection in Elliptic Curve Cryptography Using Differential Evolution for Enhanced Security
Elliptic Curve Cryptography (ECC) is a fundamental component of modern public-key cryptosystems that enable efficient and secure digital signatures, key exchanges, and encryption. Its core operation, scalar multiplication, denoted as $k \cdot P$, where $P$ is a base point and $k$ is a private scalar, relies heavily on the secrecy and unpredictability of $k$. Conventionally, $k$ is selected using user input or pseudorandom number generators. However, in resource-constrained environments with wea…

[2025-09-04 Thu (UTC), 13 new articles found for cs.CR Cryptography and Security]
toXiv_bot_toot

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[2/2]:
- Safety is Not Only About Refusal: Reasoning-Enhanced Fine-tuning for Interpretable LLM Safety
Yuyou Zhang, Miao Li, William Han, Yihang Yao, Zhepeng Cen, Ding Zhao

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/2]:
- Watermark under Fire: A Robustness Evaluation of LLM Watermarking
Jiacheng Liang, Zian Wang, Lauren Hong, Shouling Ji, Ting Wang

Crosslisted article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- Polynomial Contrastive Learning for Privacy-Preserving Representation Learning on Graphs
Daksh Pandey

Crosslisted article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- ZKProphet: Understanding Performance of Zero-Knowledge Proofs on GPUs
Tarunesh Verma, Yichao Yuan, Nishil Talati, Todd Austin

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[2/2]:
- Evil Vizier: Vulnerabilities of LLM-Integrated XR Systems
Yicheng Zhang, Zijian Huang, Sophie Chen, Erfan Shayegani, Jiasi Chen, Nael Abu-Ghazaleh

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/2]:
- Digital Privacy Under Attack: Challenges and Enablers
Baobao Song, Shiva Raj Pokhrel, Mengyue Deng, Qiujun Lan, Robin Doss, Gang Li

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- CLUE-MARK: Watermarking Diffusion Models using CLWE
Kareem Shehata, Aashish Kolluri, Prateek Saxena

Crosslisted article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- Evaluating Differentially Private Generation of Domain-Specific Text
Sun, Schlegel, Nandakumar, Zahid, Wu, Del-Pinto, Nenadic, Lam, Zhang, Bharath

Automatic Generation of a Cryptography Misuse Taxonomy Using Large Language Models
Yang Zhang, Wenyi Ouyang, Yi Zhang, Liang Cheng, Chen Wu, Wenxin Hu
https://arxiv.org/abs/2509.10814

Automatic Generation of a Cryptography Misuse Taxonomy Using Large Language Models
The prevalence of cryptographic API misuse (CAM) is compromising the effectiveness of cryptography and in turn the security of modern systems and applications. Despite extensive efforts to develop CAM detection tools, these tools typically rely on a limited set of predefined rules from human-curated knowledge. This rigid, rule-based approach hinders adaptation to evolving CAM patterns in real practices. We propose leveraging large language models (LLMs), trained on publicly available cryptogr…

[2025-10-03 Fri (UTC), 19 new articles found for cs.CR Cryptography and Security]
toXiv_bot_toot

[2025-09-03 Wed (UTC), 58 new articles found for cs.CR Cryptography and Security]
toXiv_bot_toot

Post-Quantum Cryptography and Quantum-Safe Security: A Comprehensive Survey
Gaurab Chhetri, Shriyank Somvanshi, Pavan Hebli, Shamyo Brotee, Subasish Das
https://arxiv.org/abs/2510.10436

Post-Quantum Cryptography and Quantum-Safe Security: A Comprehensive Survey
Post-quantum cryptography (PQC) is moving from evaluation to deployment as NIST finalizes standards for ML-KEM, ML-DSA, and SLH-DSA. This survey maps the space from foundations to practice. We first develop a taxonomy across lattice-, code-, hash-, multivariate-, isogeny-, and MPC-in-the-Head families, summarizing security assumptions, cryptanalysis, and standardization status. We then compare performance and communication costs using representative, implementation-grounded measurements, and re…

NoMod: A Non-modular Attack on Module Learning With Errors
Cristian Bassotto, Ermes Franch, Marina Kr\v{c}ek, Stjepan Picek
https://arxiv.org/abs/2510.02162 https://

NoMod: A Non-modular Attack on Module Learning With Errors
The advent of quantum computing threatens classical public-key cryptography, motivating NIST's adoption of post-quantum schemes such as those based on the Module Learning With Errors (Module-LWE) problem. We present NoMod ML-Attack, a hybrid white-box cryptanalytic method that circumvents the challenge of modeling modular reduction by treating wrap-arounds as statistical corruption and casting secret recovery as robust linear estimation. Our approach combines optimized lattice preprocessing--in…

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- Divide, Conquer and Verify: Improving Symbolic Execution Performance
Christopher Scherb, Luc Bryan Heitz, Hermann Grieder, Olivier Mattmann

Crosslisted article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- PIR-RAG: A System for Private Information Retrieval in Retrieval-Augmented Generation
Baiqiang Wang, Qian Lou, Mengxin Zheng, Dongfang Zhao

A Comparative Performance Evaluation of Kyber, sntrup761, and FrodoKEM for Post-Quantum Cryptography
Samet \"Unsal
https://arxiv.org/abs/2508.10023 https://

A Comparative Performance Evaluation of Kyber, sntrup761, and FrodoKEM for Post-Quantum Cryptography
Post-quantum cryptography (PQC) aims to develop cryptographic algorithms that are secure against attacks from quantum computers. This paper compares the leading postquantum cryptographic algorithms, such as Kyber, sntrup761, and FrodoKEM, in terms of their security, performance, and real-world applicability. The review highlights the strengths and weaknesses of each algorithm and provides insights into future research directions. We also discuss the challenges of transitioning from classical to…

[2025-10-02 Thu (UTC), 17 new articles found for cs.CR Cryptography and Security]
toXiv_bot_toot

[2025-09-02 Tue (UTC), no new articles found for cs.CR Cryptography and Security]
toXiv_bot_toot

Replaced article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- Maven-Hijack: Software Supply Chain Attack Exploiting Packaging Order
Frank Reyes, Federico Bono, Aman Sharma, Benoit Baudry, Martin Monperrus

Crosslisted article(s) found for cs.CR. https://arxiv.org/list/cs.CR/new
[1/1]:
- Governable AI: Provable Safety Under Extreme Threat Models
Donglin Wang, Weiyun Liang, Chunyuan Chen, Jing Xu, Yulong Fu