Articles tagged with: #cryptography Clear filter
Separating Pseudorandom Generators from Logarithmic Pseudorandom States

Separating Pseudorandom Generators from Logarithmic Pseudorandom States

cs.CR updates on arXiv.org arxiv.org

arXiv:2510.20131v1 Announce Type: new Abstract: Pseudorandom generators (PRGs) are a foundational primitive in classical cryptography, underpinning a wide range of constructions. In the quantum setting, pseudorandom quantum states (PRSs) were proposed as a potentially weaker assumption that might serve as a substitute for PRGs in cryptographic applications. Two primary size regimes of PRSs have been studied: logarithmic-size and linear-size. Interestingly, logarithmic PRSs have led to powerful...

QORE : Quantum Secure 5G/B5G Core

QORE : Quantum Secure 5G/B5G Core

cs.CR updates on arXiv.org arxiv.org

arXiv:2510.19982v1 Announce Type: new Abstract: Quantum computing is reshaping the security landscape of modern telecommunications. The cryptographic foundations that secure todays 5G systems, including RSA, Elliptic Curve Cryptography (ECC), and Diffie-Hellman (DH), are all susceptible to attacks enabled by Shors algorithm. Protecting 5G networks against future quantum adversaries has therefore become an urgent engineering and research priority. In this paper we introduce QORE, a...

Q-RAN: Quantum-Resilient O-RAN Architecture

Q-RAN: Quantum-Resilient O-RAN Architecture

cs.CR updates on arXiv.org arxiv.org

arXiv:2510.19968v1 Announce Type: new Abstract: The telecommunications industry faces a dual transformation: the architectural shift toward Open Radio Access Networks (O-RAN) and the emerging threat from quantum computing. O-RAN disaggregated, multi-vendor architecture creates a larger attack surface vulnerable to crypt-analytically relevant quantum computers(CRQCs) that will break current public key cryptography. The Harvest Now, Decrypt Later (HNDL) attack strategy makes this threat...

Transmitter Identification via Volterra Series Based Radio Frequency Fingerprint

Transmitter Identification via Volterra Series Based Radio Frequency Fingerprint

cs.CR updates on arXiv.org arxiv.org

arXiv:2510.19440v1 Announce Type: new Abstract: The growing number of wireless devices increases the need for secure network access. Radio Frequency Fingerprinting (RFF), a physical-layer authentication method, offers a promising solution as it requires no cryptography and resists spoofing. However, existing RFF approaches often lack a unified theory and effective feature extraction. Many methods use handcrafted signal features or direct neural network classification, leading to limited...

A Probabilistic Computing Approach to the Closest Vector Problem for Lattice-Based Factoring

A Probabilistic Computing Approach to the Closest Vector Problem for Lattice-Based Factoring

cs.CR updates on arXiv.org arxiv.org

arXiv:2510.19390v1 Announce Type: new Abstract: The closest vector problem (CVP) is a fundamental optimization problem in lattice-based cryptography and its conjectured hardness underpins the security of lattice-based cryptosystems. Furthermore, Schnorr's lattice-based factoring algorithm reduces integer factoring (the foundation of current cryptosystems, including RSA) to the CVP. Recent work has investigated the inclusion of a heuristic CVP approximation `refinement' step in the lattice-based...

Does cipher order actually matter?

Does cipher order actually matter?

cybersecurity www.reddit.com

So a webserver has a number of ciphers it offers to the clients. Some webserver check services complain about the cipher order not being correct. https://internet.nl/ says: Verdict: Your web server does not prefer 'Good' over 'Sufficient' over 'Phase out' ciphers ('II'). https://www.ssllabs.com shows the order (and indeed has some 'weak' ones not all at the bottom) but does not complain about the order. I've asked one of our senior developers and he mentioned that the order does not matter...

CipherQ  -  experimenting with a quantum-safe API layer (looking for security feedback)

CipherQ - experimenting with a quantum-safe API layer (looking for security feedback)

cybersecurity www.reddit.com

Hey folks, I've been working on a small project called CipherQ , an API platform focused on quantum-safe encryption and key handling . Live demo: https://cipherq.fronti.tech This isn't a product pitch - I'm just testing the idea of exposing post-quantum cryptographic operations through an API for developers. If you're into cryptography or security engineering, I'd love your take on: What obvious holes or design flaws you notice right away Whether "quantum-safe API" is something devs would...

A Light Weight Cryptographic Solution for 6LoWPAN Protocol Stack

A Light Weight Cryptographic Solution for 6LoWPAN Protocol Stack

cs.CR updates on arXiv.org arxiv.org

arXiv:2510.14993v1 Announce Type: new Abstract: Lightweight cryptography is an emerging field in the field of research, which endorses algorithms which are best suited for constrained environment. Design metrics like Gate Equivalence (GE), Memory Requirement, Power Consumption, and Throughput play a vital role in the applications like IoT. This paper presents the 6LoWPAN Protocol Stack which is a popular standard of communication for constrained devices. This paper presents an implementation of...

My first Forensics toolkit

My first Forensics toolkit

cybersecurity www.reddit.com

Hello, I've built my first toolkit for Cyber Intelligence and OSINT (JAVA API); for v1, I've managed to develop some tools that help with file/image analysis and cryptography; What fields am I missing in my API list or worth implementing? I've attached the swagger doc so you can have a look. The API is currently protected with a hard coded string, if you want to become a contributor, please write to me). https://norseint.cloud/swagger-ui/index.html submitted by /u/nordiclust [link] [comments]

The Beautiful Deception: How 256 Bits Pretend to be Infinity

The Beautiful Deception: How 256 Bits Pretend to be Infinity

cs.CR updates on arXiv.org arxiv.org

arXiv:2510.12802v1 Announce Type: new Abstract: How do you store infinity in 256 bits? This paper explores the fundamental deception at the heart of computational cryptography: using finite information to simulate infinite randomness. We prove why true random oracles are impossible, then show how lazy evaluation creates a beautiful lie -- a finite automaton that successfully pretends to be infinite. We reveal that ``randomness'' in cryptography is actually computational hardness in disguise,...

TAPAS: Datasets for Learning the Learning with Errors Problem

TAPAS: Datasets for Learning the Learning with Errors Problem

cs.CR updates on arXiv.org arxiv.org

arXiv:2510.08797v1 Announce Type: cross Abstract: AI-powered attacks on Learning with Errors (LWE), an important hard math problem in post-quantum cryptography, rival or outperform "classical" attacks on LWE under certain parameter settings. Despite the promise of this approach, a dearth of accessible data limits AI practitioners' ability to study and improve these attacks. Creating LWE data for AI model training is time- and compute-intensive and requires significant domain expertise. To fill...

Assessing the Impact of Post-Quantum Digital Signature Algorithms on Blockchains

Assessing the Impact of Post-Quantum Digital Signature Algorithms on Blockchains

cs.CR updates on arXiv.org arxiv.org

arXiv:2510.09271v1 Announce Type: new Abstract: The advent of quantum computing threatens the security of traditional encryption algorithms, motivating the development of post-quantum cryptography (PQC). In 2024, the National Institute of Standards and Technology (NIST) standardized several PQC algorithms, marking an important milestone in the transition toward quantum-resistant security. Blockchain systems fundamentally rely on cryptographic primitives to guarantee data integrity and...

Post-Quantum Security of Block Cipher Constructions

Post-Quantum Security of Block Cipher Constructions

cs.CR updates on arXiv.org arxiv.org

arXiv:2510.08725v1 Announce Type: new Abstract: Block ciphers are versatile cryptographic ingredients that are used in a wide range of applications ranging from secure Internet communications to disk encryption. While post-quantum security of public-key cryptography has received significant attention, the case of symmetric-key cryptography (and block ciphers in particular) remains a largely unexplored topic. In this work, we set the foundations for a theory of post-quantum security for block...