What are some unbreakable ciphers
Could public key cryptography like RSA be useful and secure without a computer in the late Middle Ages?
Cryptography has a long history. Really long.
Needless to say, there was no need to say how important the security of secret messages was between rulers and generals.
In ancient times, the ciphers used were pretty simple, but they evolved into more complex ones.
Old ciphers had one big flaw: they were symmetrical, which made it possible to crack them.
But what about asymmetric key encryption (for example RSA)? It is the most important encryption technique today. One might think that the Middle Ages would create a completely unbreakable cipher.
But mathematical calculations associated with encoding and decoding RSA messages require a lot of work. That's why we use computers for this. In the Middle Ages there were no computers and no way to create one, even with knowledge from the future.
Of course, it would still be possible - just train some scholars (and accidentally bring up some big math theories, but who cares?) And use small enough keys.
But would keys be small enough that a scholar (for security reasons only one) at the royal court could decrypt messages in a few hours and still be powerful? Maybe such small keys don't offer enough protection?
Is it really safe to use asymmetric key encryption in these terms?
Clarification: All calculations in the encryption and decryption process are done by hand or using techniques available in the late Middle Ages and should not take more than a day for a man to finish.
RSA is just one example of asymmetric key encryption. If RSA turns out to be useless but another type is fine, I'll accept the answer.
For security reasons, I expect something similar to our time definition: Nobody knows a quick way to break, and brute force solutions take at least years.
Not a duplicate of cryptography in a world without a computer as this question is about a special family of ciphers, while the above question is about cryptography as a whole.
a CVn ♦
It is entirely possible that your problem occurs while trying to encrypt the message.
Let's go through the RSA algorithm:
- Choose two prime numbers, p and q.
- set n = p ∗ q
- find ϕ (n) that is equal to (p-1) (q-1)
- choose a number, 1
- solve for d in view of which d ∗ e≡1 (mod n)
Let us now consider each step individually.
Choose two prime numbers, p and q.
Pretty easy to do; I learned about the Eratosthenes screen in middle school.
set n = p ∗ q and find ϕ (n) that is equal to (p-1) (q-1)
Easy again. A multiplication by hand is entirely possible.
choose a number, 1
- Is Africa a good place for crypto currency
- Win great nations without fighting
- How to say cake in Vietnamese
- How would your closest friend describe you
- Why don't companies install solar panels
- Have you ever had 3D dreams
- How can I make political art
- Where does the moon rise and set
- Why do authors use elegy in poetry
- Who started the Rajput 1
- How is Raman classes in Roorkee
- What are some natural wasp repellants
- How does Stack Overflow manage tags
- What is the definition of super hard materials
- MCA graduates are eligible for BSNL JTO
- What is a floating entry gate
- Is power perceived or possessed
- Under what light are mosquitoes visible?
- Can you make me go through Chegg
- What color meat is venison
- Where is CoffeeScript used in the industry?
- Who is your greatest hero and why
- What is the IRS Form CP 575
- What is Waylon Jennings famous for