blintz base · Jan 24, 2025
This page cannot be shown here. You can still read it on the original site — the toolbar below keeps your place in the directory.
Cryptography is not based on NP-complete problems - let me explain why. Hard problems in cryptography Cryptographic schemes are based on the computational difficulty of solving some ‘hard’ problem. For example, RSA (specifically, RSA-2048) is based on the difficulty of a problem like this: The RSA Problem I generate two large, random prime numbers, p p p and q q q , each of length 1024…
Cryptography is not based on NP-complete problems - let me explain why.
Cryptographic schemes are based on the computational difficulty of solving some ‘hard’ problem. For example, RSA (specifically, RSA-2048) is based on the difficulty of a problem like this:
I generate two large, random prime numbers, p and q, each of length 1024 bits. I then give you the product n=p⋅q. Find p.
Read on /posts/cryptography-is-not-based-on-np-hard-problems/ ↗
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.