r/crypto

A Cryptography Engineer’s Perspective on Quantum Computing Timelines

Bitsliced first-order masked AES-128 decryption in Cortex-M0 assembly — how many traces to break it?

Wrote this from scratch for a university smart card lab course — couldn't find any usable reference implementation of bitsliced first-order masked AES in assembly, so I had to write one. Key details: * Platform: STM32F051 (Cortex-M0, 8 MHz) * …

Mongoose: Preauth RCE and mTLS Bypass on Millions of Devices

It is possible to use the Ueli Maurer s Diffie Hellman reduction to transfer the discrete logarithm problem from an elliptic curve to a finite field?

The [original paper](https://crypto.ethz.ch/publications/files/Maurer94.ps) ("Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms") solves the discrete logarithm problem using a Diffie-Hellman oracle and auxiliary groups. It also transfers the problem from a finite field to solving the discrete …

PGP Tools: A zero-permission Chrome extension using WebAuthn PRF for PGP key management

I built Chrome extension for PGP and I think the cryptographic approach is interesting enough to share here. The extension uses WebAuthn PRF to derive a master key from a passkey, which encrypts/decrypts the user's PGP private keys and contacts …

Understanding the Ultrahonk Verifier

AI-Enhanced Traffic Analysis of Post-Quantum Encrypted Network Packets

One of my biggest concerns for online privacy is that even after PQC adoption of TLS Traffic takes off--people will simply apply statistical analysis of encrypted network packets to figure out what people are doing. Problems like this have been …

[Cryptanalysis] Theoretical reduction of logical depth (T-count) for Shor's algorithm via Z/6Z Topological Superselection (with exact MPDO simulation)

Hi everyone, I am an independent researcher and I recently published a theoretical paper focusing on quantum cryptanalysis, specifically targeting the resource estimation and initialization phase of arithmetic search algorithms like Shor's. Since this sub focuses heavily on modern cryptography …

This subreddit is now about Quantum Cryptography

In order to keep up with quantum leaps in a technology which is about to leave the lab at the rate of graphene, a change in phase is necessary and we will need to align with the virtual sea of …

It is possible to avoid square root step of this paper by chosing a different curve type?

The paper works with elliptic curves. But what about using curves in the form of y=x^(6)+Ax^(2)+B^2 or y=x^(2)+Ax+B? Of course in such cases the square root computation would no longer be needed but would it be usefull? My underlying problem …