Collaborate Disseminate
After using many APIs, I noticed that most of them offer 2 keys: API Key and Secret Key.
The secret key is used to sign the request body with HASHAGE algorithm, the most used is HMAC SHA256. This technique is used by financial platforms li… Continue reading Why REST APIs that do not use RSA encryption to secure API keys?
Answers to question RSA key length vs. Shor’s algorithm suggest that e.g. 2048 bit RSA encryption would be trivially broken with 4099 qubit quantum computer using Shor’s algorithm (best known implementation of the algorithm requiring 2n+3 qubits).
Is this really true? If I’ve understood correctly, the number of gates (logically quantum operations) needed would be around log(2^2048)^2×log(log(2^2048))×log(log(log(2^2048))) which is roughly 2.9×10⁷. Considering that not even classical computers can execute any operations with 2.9×10⁷ gates using single piece of input data it really doesn’t make sense to assume that such a high number of gates could be operated by quantum computer in non-trivial time.
I would assume that for quantum computer to execute one step executing the Shor’s algorithm would need to pass (logically) one input through all those gates which would be analogous to classical computer executing enough computer code to pass one 2048 bit input through 2.9×10⁷ gates. Because information cannot travel faster than speed of light and gates have non-zero dimensions, this cannot happen in trivial time. And if you use photons for qubits in the quantum computer, wavelength probably sets minimum dimensions for a gate regardless of manufacturing abilities.
And if you need any error correction between the gates, that will require extra space and hence increase latency, too.
In addition, if I’ve understood correctly, to actually factor big numbers with Shor’s algorithm you need to use classical computer to generate a random guess and Shor’s algorithm will then use that guess to maybe emit the data need to compute the factors. How many guesses on average you would actually need for factoring numbers used in 2048 bit RSA?
Has there been research about potential practical runtime of a big physical quantum computer trying to execute Shor’s algorithm for factoring big numbers? Does that really support the interpretation that you can simply ignore the processing time regardless of the size of the numbers?
I want to implement 2 applications app1 and app2 using Python.
app1 will encrypt a message using RSA and send it to app2 which will decrypt it.
I am totally confused about what python library I need to use.
After much research I’ve found t… Continue reading RSA encryption and decryption using Python [closed]
We want to replace traditional signature of papers by digital signature in our organazation. The process is simple:
A signs the data using his/her private key which is saved inside a secure RFID card. for this we need some biometric solut… Continue reading PKI digital signature technologies
I have the following RSA private key;
—–BEGIN RSA PRIVATE KEY—–
MIICXQIBAAKBgQDvHXjTU+ug9OXMCYimyVx+gn+vpkTYezy3OFYWuT+2b/1F8txo
FG5wutA7nE24wgDsiqo7NGbC87DvvpOCGlpkFw0y1W05XAw0uZhXPJ8i0qgmrGsC
lU5UJOuhicjM7zjUtddgNUDNZu4GFLrIg+63i9y… Continue reading Why RSA Decryption Doesn’t Work? [closed]
The vulnerability scanner recommends for SSL/TLS on Windows 2012:
Replace the certificate in the chain with the RSA key less than 2048
bits in length with a longer key, and reissue any certificates signed
by the old certificate.
How to r… Continue reading How to Replace SSL certificate using RSA key less than 2048 bits [closed]
Basically, the SafeZone library doesn’t sufficiently randomize the two prime numbers it used to generate RSA keys. They’re too close to each other, which makes them vulnerable to recovery.
There aren’t many weak keys out there, but there are some:
So far, Böck has identified only a handful of keys in the wild that are vulnerable to the factorization attack. Some of the keys are from printers from two manufacturers, Canon and Fujifilm (originally branded as Fuji Xerox). Printer users can use the keys to generate a Certificate Signing Request. The creation date for the all the weak keys was 2020 or later. The weak Canon keys are tracked as CVE-2022-26351…
Continue reading Breaking RSA through Insufficiently Random Primes
I just started to work with keys from TPM 2.0 and I was wondering how can I assign the EK key only to the admin
Continue reading How can you be sure that only an admin can use the EK?
I’ve configured the following on my IOS XE device.
!
ip ssh rsa keypair-name my-4096rsa-ssh-key
ip ssh version 2
ip ssh server algorithm mac hmac-sha2-512 hmac-sha2-256
ip ssh server algorithm encryption aes256-gcm aes256-ctr
ip ssh server… Continue reading SSH Handshake on Cisco IOS XE
Say I have an RSA private key, if encoded in PEM, it usually looks like:
—–BEGIN RSA PRIVATE KEY—–
<base64 encoded bits>
—–END RSA PRIVATE KEY—–
If I encrypt the said key with a passphrase using AES, and then encode it i… Continue reading How to properly encode in PEM an RSA private key encrypted with another RSA key?