Collaborate Disseminate
I read this answer Ransomware encryption keys and understood how wannacry works. But I still have a question: as I understand, the hacker will put the hacker’s RSA public key in the malware, the victim machine will randomly generate an AES… Continue reading Why Ransomware generate keypair in victim?
I need to establish a secure method for transmitting shared secret keys between a mobile app and an API server to ensure the integrity of the data.
When initially exchanging shared secret keys, I’am employ X25519. However, if a previously … Continue reading Secure Transmission of Secret Keys Between Mobile App and API Server
I downloaded an application, based on electron. I then decompiled the app.asar file. And I found two strange files: "server.cert" and "server.key".
The private RSA key corresponds to the certificate.
I was wondering wha… Continue reading Why does this application include a private RSA key?
User Crover has given a very great explanation for this question:
RSA or ECDHE for x.509 certificates-what does each do?
I have one question to Crover and/or any other member.
What I understand from the Crover’s answer, if client (a Web Br… Continue reading Web Browser and server using ECDHE_RSA cypher suite, then what is the use of X.509 certificate public key for?
We don’t have a useful quantum computer yet, but we do have quantum algorithms. Shor’s algorithm has the potential to factor large numbers faster than otherwise possible, which—if the run times are actually feasible—could break both the RSA and Diffie-Hellman public-key algorithms.
Now, computer scientist Oded Regev has a significant speed-up to Shor’s algorithm, at the cost of more storage.
Details are in this article. Here’s the result:
The improvement was profound. The number of elementary logical steps in the quantum part of Regev’s algorithm is proportional to …
RFC 2313 has this specific callout:
1. An RSA private key logically consists of only the
modulus n and the private exponent d. The presence of the
values p, q, d mod (p-1), d mod (p-1), and q-1 mod p is
int… Continue reading In RFC 2313 (PKCS1/RSA) said you could recreate the Private key from ‘n’ and ‘d’, which later versions removed. Why? [migrated]
I’ve watched a lot of videos on Shor’s Algorithm and Quantum Computers. Most of these videos say these two things undermine RSA via fast-factoring, but they never really explain how fast-factoring is used to these break things; just very h… Continue reading RSA vs Shor’s Algorithm/Fast Factoring — Server Credentials & MITM
For my project in uni I need to combine asymmetric and symmetric cryptosystems. I wanted to do thing with AES and RSA but it’s a little difficult for me and I want something easier. So I thought that maybe I can go with these steps:
the m… Continue reading Is it possible to combine RSA and XOR?
It’s time to strap on our propeller beanies, because we’re going to talk crypto. The short version is that some SSH handshakes can expose enough information for a third party …read more Continue reading This Week in Security: SSH, FTP, and Reptar
I created a signature with:
openssl pkeyutl -sign -inkey rsa.key.bob -in plain -out plain.sig.bob
and to verify, Alice just needs to use Bob public key to check the authenticity of the message.
So why I have to use this (which require th… Continue reading Why in "openssl pkeyutl -verify" is needed both public and private keys? Why isn’t public key enough?