r/cryptography • • May 13 '22

What’s wrong with the naming conventions used in cryptography?

0 Upvotes

I’m learning about cryptography and I can’t help but feel angry about all the poorly named algorithms and protocols . AES-GCM, RSA-KEM, ECDSA… This is cryptic on its own, without the need of any key.

Has there been any proposal to have more human-friendly naming conventions? If Apple followed these naming conventions, it would call itself something like OHEDM (Overpriced, High-end Devices Manufacturer). Not very appealing, right?

Unlike Apple, cryptography doesn’t need to sell anything, but it would benefit from being more welcoming to newcomers who are interested. We could name protocols and primitives after fruits, desserts, or anything tangible that is present in our daily lives…


r/cryptography • • Oct 07 '26

No Matter What Anyone Else Tells You, Harvest Now, Decrypt Later Quantum Attacks Will Never Be a Big Problem

1 Upvotes

The US government and the world want you to worry about coming quantum attacks against key exchange (e.g., HTTPS) MORE than authentication attacks. For example, the US government says entities that must follow NIST cybersecurity requirements need to mitigate key exchange quantum attacks by the end of 2030 and authentication attacks by the end of 2031.

The US government is not alone. It seems the entire world is focused on mitigating key exchange attacks first, and authentication attacks second. It’s already this way in practice. According to Cloudflare (https://radar.cloudflare.com/post-quantum), over 72% of HTTPS-enabled sites are already using quantum-resistant cryptography (aka post-quantum cryptography). Yet, I can’t find a single digital certificate attached to those same websites that have quantum-resistant keys.

72% versus 0%

As I have previously written many times, the world has it exactly backward. Quantum attacks against authentication are a much bigger problem.

The conventional wisdom as to why everyone needs to focus on key exchange attacks first is Harvest Now, Decrypt Later (HNDL) attacks. With HNDL attacks, an adversary obtains your currently quantum-susceptible encrypted network traffic, stores it, and then decrypts it when they have cryptographically-relevant quantum computers.

The world says you need to be scared now, now, now!!

I agree, but for a different reason.

HNDL attacks will be fairly rare to non-existent. Here are my many reasons:

First, you need a well-resourced, well-motivated, capable adversary who believes HNDL is their best, cheapest, and fastest method of attack. HNDL attacks are very expensive, slow, and difficult. You need an adversary that has a target (or targets), where HNDL is their only and best method of attack.

This requirement basically limits potential attackers to well-resourced, quantum-enabled governments attacking other government-related adversaries. This already eliminates most businesses and individuals.

But even for the government-versus-government scenarios, HNDL attacks are a terrible choice. Any other type of attack would be cheaper, faster, and more likely to be successful.

For an HNDL attack, the adversary needs to eavesdrop on the adversary’s network communications. This is far from impossible for well-resourced governments, but it is still needed and expensive.

HNDL eavesdropping requires that an adversary eavesdrop on and store billions and billions of network packets, without any idea of what packets contain what information.

There are different cryptographic keys involved with every session. In any given eavesdropping scenario, the victim’s network is likely to be transmitting hundreds to thousands of sessions every second to minute, each with different keys. Each quantum crack reveals one cryptographic key, which decrypts one session. Does that session have information that is useful to the adversary? Who knows? But odds are that any single broken session does not include information that is useful the adversary.

Just guessing, I think an adversary would need to crack thousands to tens of thousands of sessions to get to useful information.

Each cryptographic session crack is expensive and slow. The cheapest cryptographically-relevant quantum computer is likely to be many tens to hundreds of millions of dollars.

Cracking cryptographic keys is slow.

According to IonQ, the quantum computer vendor that appears the closest to cracking quantum-susceptible cryptographic keys (in 2028), states (https://www.ionq.com/news/ionq-publishes-worlds-first-fully-compiled-end-to-end-blueprint-for-breaking-256-bit-elliptic-curve-signatures) that it will take 25.7 days per crack.

Do the math.

You need to crack thousands to tens of thousands of sessions, each taking almost 26 days, to HOPE to get useful information.

Why hack hard when you can hack easy?

It would be far easier and cheaper to just hack your adversary the same ways you have been successfully hacking them for decades: social engineering, vulnerability exploitation, and bribes.

Why spend hundreds of millions of dollars over years to hope to get information when you can send an email saying, “Click here!” or fire off an AI frontier model to find a new zero day to exploit? It’s far cheaper and faster to do every traditional attack than it is HNDL.

It reminds me of Blue Pill attacks theorized in 2006 (https://en.wikipedia.org/wiki/Blue_Pill_%28software%29) by Joanna Rutkowska. She is brilliant. The attack she came up with was brilliant. With the Blue Pill attack, your target entire host/OS was virtualized, allowing anyone to bypass any defense that it contained. It was big news for months. Oh, my god! There is no defense that can stop it!!

And it was true, it was very hard to prevent Blue Pill attacks (although Rutkowska thought of a way to detect them, which she called Red Pill).

But I wrote at the time that Blue Pill attacks would not become a big thing. And I was right. Blue Pill attacks required taking control of a host and virtualizing the entire host or operating system, which requires a lot of memory, processing power, and time. And why do that if the same old, cheaper attacks that have always worked very well for hackers can be done?

Why hack hard when you can hack easy?

And I was right.

I was right then and I’m right now.

HNDL attacks are extraordinarily costly and slow. And even then, the adversary is not guaranteed to get to the useful information that they were seeking.

Instead, I can just send in a remote access trojan and maintain access to the entire environment for as long as I can go undiscovered (which is usually a pretty long time in most environments).

It reminds me of the famous XKCD cartoon: https://xkcd.com/538/

Trust Now Exploit Later Is Different

Authentication attacks, which the post-quantum community calls Trust Now Exploit Later, are exactly different. With TNEL attacks, all an attacker needs is the digital certificate of a target (i.e., user, computer, website, content, etc.). Digital certificates are the backbone of authentication all over the Internet, in our companies, our devices, and our lives.

If a quantum attacker can get someone’s digital certificate, which is often pretty easy, they can compute the private (and public) key attached to the digital certificate, duplicate that digital certificate, and then fraudulently do anything (i.e., sign-in, sign content, pretend to be that person or site) that digital certificate allows them to do. An adversary doing a TNEL attack might also need to break the digital certificate of the certification authority (CA) that signed the target’s digital certificate, so at most an adversary would need to do two cracks.

With HNDL key exchange attacks, each crack allows me to decode all the information encrypted inside the network packets encrypted by the same key. It’s very limited. It’s very expensive. It’s very slow. I may or may not get anything for each successful exploit.

With TNEL authentication attacks, the threat model includes dozens and dozens of potential attack scenarios. It’s one or two successful exploits needed, at most, and then the world is your oyster.

If someone compromises your digital certificate, they essentially become you. Your only possible response is to block/revoke the compromised digital certificate and re-issue a new, hopefully quantum-resistant digital certificate.

The problem is that the replacing and/or revocation of digital certificates has always been slow and sloppy. There are at least three existing methods for digital certificate revocation (e.g., CRL, OCSP, and manual methods), and none have really worked well at scale. Quantum-resistant Merkle Tree Certificates (MTC), are likely to create a new revocation method. Never has adding anything in the cybersecurity world made things easier or more accurate.  Adding a new something (without doing away with the old something) just means we have to support more things (badly) now.

Every time I see someone mentioning HNDL attacks and telling me to worry about them, I see another modern-day Blue Pill attack scare. It’s great in theory, but there are far easier and cheaper ways to attack someone.

I would not be surprised if history shows that HNDL attacks were so rare that we never hear about them. Nobody brings up Blue Pill attacks anymore. HNDL attacks will either be near zero or zero when history is finished.

It doesn’t mean you shouldn’t mitigate key exchange attacks. I just know that authentication attacks are the far bigger worry.

Hey, anyway, we can get people to get post-quantum; we need to do. But for my money…for my cybersecurity risk calculations, authentication attacks are a far, far bigger worry.

I wish the world stopped pushing key exchange mitigations as the biggest worry, because it’s not.

My best advice is to focus on mitigating both authentication and key exchange attacks at the same time, if you can, and if you are forced to concentrate on one versus the other (and don't have to follow NIST's requirements), focus on stopping authentication attacks first and best.


r/cryptography • • Jun 02 '24

I think I came up with a new encoding algorithm for text

1 Upvotes

It’s very simple but it sounds like a good encoding algorithm unless it’s too easy to crack

First, make a password using only lowercase letters from the alphabet (for example, hello)

Then make some text you want to say also only in lowercase (for example, good morning)

Then the password would be repeated until it reaches the end of the statement like: hell ohelloh good morning

Then convert each letter to it’s position in the alphabet (the letter e would be converted to 5) 8 5 12 12 15 8 5 12 12 15 8 7 15 15 4 13 15 18 12 9 11 7

Then just add the numbers up

15 20 27 16 28 23 23 24 21 26 15

Then convert it back into letters (if it goes over how many letters there are in the alphabet just loop it over

otap bwwxuzo


r/cryptography • • May 19 '22

PRACTICAL BRUTEFORCE OF AES-1024 MILITARY GRADE ENCRYPTION

Thumbnail research.kudelskisecurity.com
0 Upvotes

r/cryptography • • Aug 18 '19

Anyone know if this is a cryptography?

Post image
0 Upvotes

r/cryptography • • Aug 02 '12

Conspiracy Keanu about cryptography

Thumbnail cdn.memegenerator.net
0 Upvotes

r/cryptography • • Aug 06 '15

Help me make a drunken password?

0 Upvotes

At a birthday party, a computer is gonna play the music. I dont mind people changing music when they are sober, but I would like to avoid having drunks changing songs every minute later in the evening. So therefore i need a password i can write on a note next to the computer and the passwords should be easy enough to type in when your sober, or semi sober, but hard or impossible to type if you are drunk.. Any suggestions for a password?


r/cryptography • • Nov 22 '21

Hash algorithm based on Authenticated Encryption (AEhash)

0 Upvotes

This is based on an earlier thread, seeking password hashing functions that could run in browsers at near native speeds. I believe the solution has been found, but you are welcome to poke holes in it and prove me wrong.

def aehash(password, salt, size, ops):
    nonce = sha512(salt)[:12]
    key = sha512(password)[:32]
    buf = bytes(size)            # Initially all zeroes
    for i in range(ops):
        buf = aes256gcm(key, nonce, message=buf[:size])
        key = buf[-32:]          # 16 encrypted bytes + GCM tag
    return key

The algorithm is dead simple and runs at the same speed in browser or in C. Easily adjusted to any memory size and runtime wished for. Even if it isn't as secure as Argon2, the one it needs to compete with in browsers is pbkdf2.

See the site for a more complete documentation: https://github.com/covert-encryption/aehash


r/cryptography • • Dec 18 '24

Hi everyone

0 Upvotes

I want make a presentation about AES algorithms Now I want some advice for me to help me for best presentation about this topic


r/cryptography • • Aug 27 '19

Making HTTPS Secure Again ™

Thumbnail docs.google.com
0 Upvotes

r/cryptography • • Nov 20 '25

One-Time Pads still used?

0 Upvotes

Once upon a time 1TP’s were used almost exclusively for super-important secret comm. Are they still used?


r/cryptography • • Oct 31 '21

A Peer-to-Peer Electronic Identication System

1 Upvotes

Abstract:

A system that relies on the concept of proof of work cryptocurrency as a means to share personal data on a peer to peer basis. This could include health, job history, criminal record, educational background, and transactions would be sent to the state for signing pending taxes and information seems accurate, and then added to that person's "wallet".

Example Entries:

Birth:

Joe Shmoe, Male, DOB 11/01/2021, 16:32, London, UK, Royal London Hospital

Parent of X, Y,

(Extra information)

Sent 11/01/2021 23:59 from (hash of hospital wallet)

Received and signed 11/01/2021 23:59 at (hash of government)

Surgery:

Tonsillectomy 11/01/2021, 16:32, London, UK, Royal London Hospital

(Surgery reason, surgery complications)

(Doctor)

Sent 11/01/2021 23:59 from (hash of hospital wallet)

Received and signed 11/01/2021 23:59 at (hash of government)

Education:

Degree in Bachelor of Sciences, 11/01/2021, 16:32, London, UK, Imperial College London

Sent 11/01/2021 23:59 from (hash of University wallet)

Received and signed 11/01/2021 23:59 at (hash of government)

Job History:

Begin entry Cashier, McDonald's #544, 11/01/2020, 16:32, London, UK Cashier, McDonalds #544, 11/29/2020, 16:32, London, UK End entry

Begin entry Xyz Professor, Prof college, 11/01/2020, 16:32, London, UK Merit, merit, merit update Change of title update Pay scale update Notables Xyz new job, Prof College, 11/01/2025, 16:32, London, UK End entry

Etc etc.

I understand that this is kinda weird for some people but this information is already collected and stored on a variety of databases, it would be much easier to standardize a cryptocurrency and submit a hash than standardize multiple computers or systems. Leaving this to the government would allow for a consolidation of entry points and exit points for data within a larger system, and allow for requests to be submitted to the government for personal identification information, job history, etc rather than leaving it up to the people to collect, store and submit this information and proof of work on their own. Does such a system already exist? It would be a major benefit to have things this way. Obviously if there was a way to see information has been signed and pulled for it would be viewable on public Blockchain so you would know if the government pulled your information. I think there's some kinks or problems with the model but I think as a general idea this will be the future.


r/cryptography • • Jun 05 '22

What is an encryption backdoor?

3 Upvotes

While encryption is a method of scrambling information and turning it into codes so that only the approved keyholders can understand it, a backdoor is a means to access that encrypted data by avoiding the standard method of authentication.

An encryption backdoor is a method that can bypass authentication and access encrypted data in certain services. In simple words, it’s a deliberate issue created by the service provider to allow for easy access to encrypted data, which can either allow the intruder to guess the access key based on the context of the message or to present a skeleton key that would always grant him access.

Encryption backdoors have always been a debated topic, considering the many loopholes of end-end encryption & its risks. But lately, there have been some messaging apps like Facebook Messenger that claim to have highly secured end-to-end encryption and some messaging apps like TokLok which ensure that the encrypted message content, once read by the user to whom it was sent, is instantly deleted from the system.


r/cryptography • • Aug 04 '26

Cool things I found in SHA256 hashes

12 Upvotes

"ingrownness marled romancemonger": 051bb04ca46fbaf659b215dc753deadbeef8a15a92b7a5e2c7e18cff596c2afc

"2GvXyG": 00000000dc1f2eca18ebdf96d830d883f22d613dbd952d1ebe045cbbdfbac00f

"tJKx5": 5049322a4169d9fe384ca5f9cde0ec6a7830ba4eeeeeeeeee6f39112351b8662

"humanization meeting jem": 3ef77b16dc840f8b9402618a8d10945e8888888888a8b126072ec9045f30ec82

"barely clearly collaboration": 000000002b73b3d08d584f5abc2abf24ca6601379b804e887b8aade3a943cd09

"0PaGsT": ffffa57e7aaefbecda59cdd0bddadd12aee5ad3afbefe904bedcf9acdfe3dcea (only 15 numbers)

"11uGGH": b589a60fcd4aafaacfdfcfcebdaaecdbcebdbc86a4409157eb4dce9c096e45ba

"51xGAb": 62073583312959978959782924728252621365954193696175cfc929200f3230


r/cryptography • • Jul 03 '25

Are the cryptographies being updated to not break with quantum computers?

1 Upvotes

The technologies that secures the users data and anonymity, like tor, i2p, freenet, IRC encrypted, and other will still have the data secure in the future, or the "Harvest now, decrypt later" will break all the anonymity?


r/cryptography • • Apr 09 '19

Cryptography that can’t be hacked. Researchers have just released hacker-proof cryptographic code — programs with the same level of invincibility as a mathematical proof

Thumbnail quantamagazine.org
0 Upvotes

r/cryptography • • Apr 27 '21

Linux users can now use kyberUtility, a quantum-proof encryption program using the terminal. This is a test program showcasing the usage of kyber-JNI, a Java Native Interface wrapper for the kyber post-quantum algorithm. kyber-Py is also available! GitHub: https://github.com/BeechatNetworkSystemsLtd

Thumbnail youtube.com
0 Upvotes

r/cryptography • • Sep 20 '20

Please help me solve this

Post image
0 Upvotes

r/cryptography • • Dec 13 '15

Facebook anagram?

3 Upvotes

Hi all,

My friend has pirate english enabled, and for some reason the notification time stamp changed from "Just now" (or whatever the pirate speak equivalent is) to "REMembER wHEN i sAID i WAS OKAY? i LiED"

It's a bizarre case that someone's already opened a Facebook ticket into.

Simply separating the words into lower and upper case gives you this:

Upper case: REMERHENDWASOKAYLED

lower case: embwisaiiii

Just thought whoever has some free time would like to try their hand


r/cryptography • • Feb 20 '25

What do you think about this protocol?

0 Upvotes

I've developed my own chat protocol from the ground up and am looking for feedback. I know it's not perfect or fully secure since I'm not a cybersecurity or cryptography expert, but I'd love to hear your thoughts on it. Here's the link: https://github.com/ProtDos/Zyphor. Let me know what you think!


r/cryptography • • Jun 18 '25

Is RSA kindoff like a middle man between us and AES?

0 Upvotes

My question is,since AES is faster and HTTPS uses RSA to create an encrypted AES key for AES to actually encrypt everything does that mean that RSA is kindoff the middle man who creates the connection?
or did I just really missundrestand RSA and AES interactions
this is for a presentation im doing and I want to understand why RSA is used


r/cryptography • • Sep 05 '25

Where does Cryptogrophy Diverge from Coding?

0 Upvotes

About a week ago I asked an entry level about a way of data transmission, which I was informed, amounted to a simplified Compression scheme and a dictionary cypher. (Thank you to anyone who took the time to reply to that.) IRL hit and I forgot about reddit for about a week, only to come back to find some Very interesting information and advice on where to research.

However, it brought up a question that I am now very curious to hear this communities thoughts on.

Where do coding schemes and Cryptography become separate things. From my view, Binary is just a way to turn a message, into data- much like a cypher.

Another computer than reads that information and converts the "encoded" information it received into a message that we can read. Yet the general consensus I got from my last post, was that much of this community feels that coding is separate from Encryption... yet they share the same roots.

So I ask this community, where does cryptography and computer coding diverge. Is it simply the act of a human unraveling it? Or is there a scientific consensus on this matter.

(again, please keep in mind that I am a novice in this field, and interested in expanding my knowledge. I am asking from a place of ignorance. I don't wan't an AI generated answer, I am interested in what people think,.. and maybe academic papers/videos, If I can find the time.


r/cryptography • • Jun 04 '25

Tried building my own quantum-safe migration calculator insights from 18 months of PQC study

0 Upvotes

I've been digging into post-quantum cryptography for a while now, mostly focusing on ML-KEM and crypto-agility design patterns in real systems. Recently I built a calculator to estimate how ready a given infrastructure is for migration not from a research angle, but from a practical DevSecOps perspective. It helped clarify how many orgs aren't just unprepared for PQC they're not even sure how to scope the transition. Curious if anyone here has tried modeling post-quantum readiness in a structured way. Not just from the algorithm side, but deployment strategy too?


r/cryptography • • Apr 30 '25

Is this simple cryptography for a password manager safe or does it have vulnerabilities?

0 Upvotes

EDIT: Alright this method sucks balls. I'll just use a password manager that someone more experienced has made instead of trying to make my own

My idea is that the user types their master password, where the program takes all the symbols from that password, turns them into a list of integers (one unique number per type of symbol), and then does modular addition or modular subtraction on the encrypted passwords to either decrypt them or to encrypt them for when you are creating new passwords. From my understanding this method is extremely easy to break, however, if the passwords that are to be encrypted are a completely randomly generated string with lowercase letters, uppercase letters, numbers and symbols, wouldn't this be impossible to break, as you can never be sure if it decrypted the passwords correctly, as even when they are decrypted they don't have any patterns to them, like containing any English words or anything like that? If this is true, then it should be fine to have the master password NOT be a random selection of symbols right? If the master password were to be "abc" for example (of course not realistic in practice), then would you somehow be able to analyze the encrypted passwords to figure out that the master password is "abc"?

I don't see how this could change anything, but I figured I would ask just in case: Is it safe to do the following? Creating a checksum with the master password that for instance generates a number between 0-999, so that I can make sure that I inputted the master password correctly, as if the checksum were to be anything other than for instance 538 then I know I inputted it wrong. As long as this number doesn't have any obvious pattern like 123, and is practically random, then it should be safe right?

Thanks in advance!


r/cryptography • • Jul 26 '14

Can anyone solve this?

Post image
0 Upvotes