Search Results

I would like to know if there is an algorithm to generate a RSA key at the state of the art of the present cryptanalysis. … The standard key generation, as far as I know, generate a random number of the right lenght, tries to factorise it dividing it by small factors (say $\leq 10000$) and then one or more primality test (as …

I'm currently writing a paper about RSA (a self-chosen subject). I'm writing about the key-generation in RSA, and I have problem finding the public exponent e. I have chosen p = 61 and q = 53. …

Does the security of RSA rest entirely on the modulus having at least 2 large random primes? … But RSA key generation will be very cheap. …

And for a brief summary, essentially, it's possible to introduce a backdoor during RSA key generation. For example, to generate a backdoored RSA-1024 key. … $P$ and $Q$ are then used as the prime numbers for the rest of the key generation algorithm, and $A$ is kept as the backdoor key. …

What's the difference in FIPS 140-2 and FIPS 186-4 in connection with RSA key pair generation? … So if I want to securely generate RSA key pair and I want to have access to its private part in a clear-text form, I need to use FIPS 186-4 compliant generation and validation. Am I correct? …

How RSA keys are tested for primality if they are random generated? I imagine this could be time consuming task. …

In RSA private key generation e*d ≡ 1 mod φ e is public, also n is public. How to prove mathematically, generation of private key d is not possible using the same equation and public key e …

When is it generally acceptable, if ever, to generate RSA keys without encrypting the PEM output with another encryption algorithm? … At the moment I am generating the private key and extracting the public key using the following: openssl genrsa -out key.pem 4096 openssl rsa -in key.pem -outform PEM -pubout -out public.pem I then store …

Key Generation Method: Take $s \le n/2$ bits. … On the 3rd step of key generation, do I need to select between $d= d_p \bmod p-1$ and $d= d_q \bmod q-1$ or do I make the $d_p$ and $d_q$ to make same $d$ result? …

I am interested in the ways an RSA key generation implementation can or cannot be subverted so that the subverter has an advantage, but the owner of the key, and the people who interact with the owner, … I assume that the owner of the key does not have the ability to detect subtle bugs in the key-generation implementation, but that the key will be used for encryption and decryption with standard implementations …

To write a CTF challenge, I want to create an RSA key pair of size 228-bit. I want the keys exactly in the same format as OpenSSL-generated keys. …

I have two prime numbers: p = 37 q = 41 And I need to find whether any of these prime numbers, 5, 7 or 11, can be used as a valid encryption key e? … How would I find out which number could be a valid key? Does the encryption key has to be comprime with m (1440)? As if I got it right, the answer should be 5. …

Are there standard tools (ie, openssl) to deterministically generate rsa key/pairs given a seed value? … Or if there is a way of converting the derived key pairs from one algorithm into rsa using standard libraries. Thanks. …

I was reviewing RSA by hand. I picked 53 and 59 as my primes. For e I picked 5. When I solved for d using extended euclid, I got 1 which obviously doesn't decrypt anything. …

I want to know what values are appropriate for the public exponent and certainty when generating an RSA Key (for example using Bouncy Castle RSAKeyGenerationParameters function). … Is there an authoritative source that has a simple and answer to what to enter for the public exponent, certainty and string to key count? …