Posts
Trying to best understand the tech behind ZK and E2EE, I build some code and need review / feedback
I just recently take the leap and try to create a small project with zero-knowledge and end-to-end encryption and would like some feedback about my architecture and implementation. [https://github.com/tacosjs/tanstack-starter-e2e-encryption?tab=readme-ov-file#zero-knowledge-architecture](https://github.com/tacosjs/tanstack-starter-e2e-encryption?tab=readme-ov-file#zero-knowledge-architecture) I am open to any feedback. Please feel free to leave comments, raise issues, or submit pull requests. Thank you! **\*FYI, …
Exploring and improving a Hybrid ARX Design in ChaCha12 with a Lightweight Nonlinear Layer
I’m a Cybersecurity student and I am interested in Cryptography and currently working on IoT Security benchmarking performance. I have been studying about Block/Stream Cipher and i compare with AES and ChaCha. i had found that AES is more complex than ChaCha so i pick the ChaCha. and had tried …
Template and CPA Side Channel Attacks on the Kyber/ML-KEM Pair-Pointwise Multiplication
I've no idea how relevant the *"40 traces to recover the [attacked part of] secret key"* is, but what interested me was that publication of power traces dataset enabled this paper. *"One of the drawbacks of the ongoing side channel analysis research related to PQC schemes is the availability of …
IETF wants non-hybrid lattice key exchanges in TLS
We've expected that lattice KEMs would only be used in hybrid combination with establish elliptic curve key exchanges, which ameliorates any weakness in the lattice KEM. In particular, there exist worse side channel attacks upon lattice KEMs than upon elliptic curves, because of how the sampling code works in lattice …
Coq vs F* vs Lean
i want to create formal verification for my rust project. i see that signal uses hax to extract rust code into F\* when searching online it looks like Coq seems popular, but i dont know enough to understand why signal would use F\*. both seem pretty capable, so id like …
Carelessness versus craftsmanship in cryptography
Cryptographic Issues in Matrix’s Rust Library Vodozemac
Don't pass on small block ciphers
How can I get an approximate answer to this simple exponentiation algorithm so the end result fits in memory?
I ve a loop applying y_tmp=y y=x x=y_tmp+((x+c[i])^5)%21888242871839275222246405745257275088548364400416034343698204186575808495617 219 times, where `x` and `y` are longint inputs and `c` is a static array of 220 255-bit integers. I would like to find an input `y` given an input and an ouput `x`. A would be possibility is to not apply …