Stack Exchange Network

Stack Exchange network consists of 174 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Questions tagged [rsa]

an asymmetric (e.g. public-key) cryptosystem, based on modular exponentiation with big exponents and modulus. RSA can be used both for signature and encryption.

0
votes
2answers
93 views

How to create a private key using $n,e,d,p,q$ where $n$ is prime

Someone has incorrectly created a public/private key pair where $N$ (modulus) is a prime number. This makes $p$ and $q$ trivial as they they are $n$ and $1$. $d$ is solved from $d \cdot e = \bmod (...
1
vote
1answer
89 views

Why does RSA signature need padding?

Actually, I think I know why, but consider RSA2048 and SHA256. What about to, instead of padding, just use pbkdf2 with just 1 iteration to expand the 256bits hash to full 2048bits and use those ...
1
vote
1answer
129 views

RSA2048 smallest possible modulus

what is the smallest possible modulus for RSA2048? I generate a random data with I want to encrypt by a textbook RSA2048 and I'm not sure where the first 1-bit should be. According to OpenSSL source ...
2
votes
0answers
57 views

Concept for a RSA “repeater”. Is it sensible?

I have been using RSA signed/encrypted mailing a lot recently. Naturally, I wanted to use RSA mailing also on my phone, not only on my computer. However, I feel uneasy having my private key on my ...
1
vote
1answer
41 views

Using Yubikey to store PIN protected secret for disk encryption

I want to store a secret on Yubikey and used it for the disk encryption. The crucial is, I want it to be PIN protected. There are a limited number of PIN tries, and after three attempts the Yubikey ...
0
votes
1answer
67 views

How to break RSA signature on XOR of hashed blocks

I'm trying to figure out if there's a way of breaking or weakening the following method of signing long messages Given $M=m_{1}m_{2}...m_{n},\,\,|m_i|=64b, \,\,h=h(m_{1})\oplus h(m_{2})\oplus\cdots\...
4
votes
2answers
243 views

How to efficiently generate a random safe prime of given length?

A prime $p$ is said to be safe prime if $(p-1)/2$ is also a prime. How to efficiently generate a safe prime? I have written the following code in sagemath which generates a random safe prime of 1536 ...
-1
votes
1answer
178 views

Creating multiple “public” keys from one private key

Is it possible to create a public key out of a private key, then create another public key from the first public key. And treat the first public key as a private key (So you have two levels of private ...
3
votes
1answer
66 views

Does choosing N to be product of safe primes avoid William's p+1 factoring attack on RSA?

In this post, I found that choosing RSA modulus $N$ to be product of safe primes avoids Willam's $p + 1$ factoring attack. Suppose $N = p \cdot q$, where $p$, $q$, $(p-1)/2$ and $(q-1)/2$ are primes. ...
2
votes
0answers
88 views

What are the known attacks on $\phi$-hiding assumption? How to chose its parameters?

$\phi$-hiding assumption states the following. Sample 2 random primes $e_0$ and $e_1$ in the range $[5, 2^{\lambda/4}]$. Sample $N = pq$ of length $\lambda$ ($p$ and $q$ are large primes of length $0....
1
vote
2answers
84 views

Why can't we find $d$ if we know $e$ and $n$ in RSA?

Say, we have RSA public key $(n,e)=(221,7)$, and the encryption of the message $m=12$ is $$c=m^e \bmod n= 12^7 \bmod (221) = 194 \bmod (221)$$ Can we find the $d$ by solving the equation; $$194^d ...
5
votes
1answer
616 views

RSA using 2 as a public exponent

I'm failing to see why 2 can never be used and what weaknesses would be associated with doing so. There's a similar question asking why it has to be in the form of $2^n$+1 but why not $2^n$
0
votes
1answer
44 views

RSA - are we able to encrypt into any possible ciphertext in $Z_n$ given a specific key?

Given a public key $(e,n)$, if we are free to choose the plaintext does that mean we are able to generate any possible ciphertext in $Z_n$ ? Because if we were given $e$ we can say that the ...
1
vote
1answer
83 views

Determine RSA modulus from encryption oracle

Suppose we have an RSA encryption oracle $E(m)$ which basically just calculates $m^e \mod n$ for a given message $m$. Here $e=65537$ is known but $n$ is not. Can we determine the value of $n$ without ...
0
votes
1answer
64 views

RSA - source and image - all are possible?

Given a key $e = 3$ (the public exponent for RSA) and a group of numbers, say $Z_n^*$ (the multiplicative group of $n = pq$, where $p$ and $q$ are primes as requested by RSA). I can find the ...
1
vote
1answer
96 views

Breaking RSA using known root

Sorry in advance if this question is silly. Suppose we want to break RSA, that is find the message $m$ s.t. $c \equiv m^e \pmod n$ Now suppose we know an $x$ s.t. $c \equiv x^e \pmod n$. Could we use ...
1
vote
1answer
79 views

Can a TLS certificate using ECC secp384r1 as PK algorithm uses RSA for signature

If a TLS certificate public-key algorithm is ECC secp384r1 or ECC prime256v1, is it possible to have RSA as a signature ...
0
votes
1answer
69 views

Does RSASSAPSS use RSA signature

I just need to know is it correct to classify the RSASSAPSS scheme and sha[256 | 512 | 1]WithRSAEncryption all under RSA ...
5
votes
1answer
870 views

In the RSA DES challenges, how did the contestants know they had found the right key considering they weren't given any plaintext?

If the contestants were given both the plaintext and ciphertext, it's straightforward. Just bruteforce all 56-bit keys until you find one that maps the given plaintext to the given ciphertext. But ...
3
votes
1answer
77 views

Is OAEP needed when encrypting a session (random) key using RSA?

My question is two parts: when encrypting a session key which is used to encrypt bulk data using a block cipher for example, is padding with OAEP really needed [i'm assuming the key is generated ...
0
votes
1answer
45 views

How to name a signature algorithm that has no hashed component

I have an API-based service that digitally signs messages with RSA or ECDSA (system decides during runtime). The input is base64 encoded SHA-256 hash and the output is: signature of this hash ...
-2
votes
1answer
115 views

RSA exercise with known $n$ and $e$

Bob decides to use $n = 697 \rightarrow 17 × 41$ and $e = 33$ as his public key for an RSA cryptosystem. Show that the decryption exponent is $97$. Find the encrypted form of the message $17$.
4
votes
1answer
768 views

Is RSA provably secure in the sense of Douglas Stinson's ``provable security''?

Here's a quote from Douglas Stinson: “[i]f a cryptosystem can be ‘broken’ in some specific way, then it would be possible to efficiently solve some well-studied problem that is thought to be ...
0
votes
1answer
39 views

Can we find the exact number given remainder of the numbers with mod m?

I have around 1500 numbers. The numbers $x_i$ are calculated as $x_i$=($p*t_i$) mod m. $p$ constant and same for all the numbers while $t_i$ are chosen randomly everytime. For example the given ...
3
votes
1answer
128 views

Break RSA given $N, e$ and lower half of $d$

I have full bits of public key $(n,e=65537)$ but from the private key, I have the lower half bits of $d$. Can I restore the whole RSA private key from that data and use it for decryption?
7
votes
1answer
339 views

The 9 lives of Bleichenbacher's CAT, it puts another scratch again

Bleichenbacher demonstrated a padding oracle attack against RSA implementations that follow the PKCS #1 v1.5. Through the years, there are various mitigation techniques developed as OAEP and limiting ...
2
votes
1answer
48 views

RSA engine with inaccessible private keys - susceptible to any attacks?

We are going to integrate some hardware accelerator for RSA into our next system on chip. This chip can accelerate the core RSA operation, i.e. modular exponentiation $y=A^x \mod(N)$. The private key (...
-1
votes
1answer
41 views

RSA limiting down the possible values for $n,q$, and $d$? given only $e$ and $p$ [duplicate]

Suppose someone forgot the value of $n$ and you only knew the values for $e$ and $p$. How could one go about limiting down the possible values for $n,q$, and $d$? I'm thinking to try and solve $\gcd(...
-2
votes
1answer
85 views

RSA find $q$ given only $e$ and $p$

Lets say hypothetically all one knew was a value of $e$ and a value of $p$. As an example, lets assume that $e = 13$ and $p = 67$. Would it be possible to find the value of $q$ from this equation? ...
0
votes
1answer
46 views

Send content to owner of gpg public key, nested content symmetric encryption

If I want to encrypt a text content file using a symmetric algorithm like AES, is there a standard format gpg will expect, where it can detect a symmetric key (encrypted with recipient gpg public key ...
0
votes
1answer
75 views

Equivalent RSA modulus for NIST P-192 and P-521 elliptic curves [duplicate]

At www.keylength.com, I found the following table of ECC field size and the corresponding RSA modulus recommended by NIST. ECC Modulus RSA Prime Size 160 1024 224 2048 ...
3
votes
1answer
178 views

Performing a dictionary attack on RSA/ECB with no padding

I have the exponent $e=2^{16}+1$ and modulus $n$ (154 digit number) of an RSA public key along with the ciphertext (64 bytes) encrypted using the same key with RSA/ECB and no padding. I am required ...
5
votes
1answer
258 views

RSA PSS security advantage

To my humble opinion, please correct me if I'm wrong, RSA-PSS (PKCS#1 ver 2.1) advantage over RSA as described in PKCS#1 ver. 1.5 is in its security proofs. Does this proof and the advantage is still ...
2
votes
3answers
66 views

For elliptic-curve cryptography, does a 256-bit key imply that $x$ and $y$ are each 256-bits or 128-bits?

In the wikipedia article, the claim is made that "256-bit elliptic curve public key should provide comparable security to a 3072-bit RSA public key". Since, in ECC, the public-key consists of a point $...
1
vote
1answer
52 views

Unable to reproduce correct signature data

"Skatteetaten" is the Norwegian tax authority. We're currently trying to implement signing of messages for digital cash registry systems and i'm not able to reproduce the desired signed data. Went ...
5
votes
2answers
449 views

What is the best way to sign a message using RSA?

I was preparing for competitive exam, and I came across this question. I had a lot of discussion with my friends before I resorted to posting it here and I wanted myself to be clear on this. Let $M$ ...
-4
votes
2answers
97 views

RSA: Is there a way to increase the partially encrypt data without knowing the private key?

EDITED QUESTION FOR A BETTER EXPLAINATION I have this crypted information (RSA): ...
2
votes
0answers
80 views

Sharing RSA private key between SSH and SSL services. How bad is it?

An appliance uses a curious way of obtaining ssh-rsa host keys: There is a single configuration option "management certificate" that sets RSA private keys both for HTTPS and SSH management. ...
1
vote
2answers
80 views

Best way to attack a small e and small m RSA problem?

I am working through a series of crypto exercises to learn a bit more about RSA and crypto in general. In the case where one has a small $e$ AND a small m, would it be correct to say that if $m<N^{...
2
votes
1answer
78 views

Proof of concept for RSA malleability

I'm trying to see how easy RSA malleability is. I generate 2 ciphertexts with a public key: ...
2
votes
1answer
73 views

RSA encrypting private keys blinding

I am studying RSA couldn't understand this question: Alice encrypts the private factors of the modulus using her private key. In order to increase security, she multiplies them with a random integer $...
0
votes
1answer
68 views

Why does the Node crypto library do Diffie Hellman this way?

I was sifting through the Node Crytpo library and I came across their Diffie Hellman utility class. Their class implements a generateKeys function that, in their ...
0
votes
2answers
107 views

brute force RSA [closed]

I have a ciphertext c_t and a RSA public key pair (e, n). I also know that the encrypted message is a three-letter word in the ...
2
votes
3answers
688 views

Input limitations on the RC6 cipher

RSA has limitation in input size for encryption and decryption. Can RC6 be used for encryption and decryption of files larger than 5 MB? Is there any limitation for input size? Is RC6 safe for using ...
0
votes
0answers
82 views

Size of group for Elliptic curves vs RSA for equal security

For my research, I would like to compare the efficiency of a scheme when instantiated with Elliptic curves and RSA. So, I would like to know a "latest" comparison (as of 2018) on what group sizes of ...
3
votes
2answers
651 views

Is RSA inspired by Diffie Hellman?

I read a bit of A Method for Obtaining Digital Signatures and Public-Key Cryptosystems that introduced RSA in 1977, and, while learning the steps in RSA a few days ago, I noticed that they are similar ...
3
votes
1answer
100 views

Inclusion and Exclusion proofs in RSA accumulators

I am reading about RSA accumulators from this video and few other sources. I had a confusion whether the complete set is needed to construct a proof of inclusion/exclusion in an RSA accumulator or is ...
1
vote
1answer
62 views

Cost of multiplication when e is randomly selected. RSA

Using schoolbook multiplication (which has cost $\mathcal{O}(n^2)$) to multiply two $n$-bit numbers) what is the cost of computing an RSA encryption with $e = 3$? What is the cost if $e$ is chosen ...
0
votes
1answer
78 views

RSA How to select a value K such that $e d = 1 + k \varphi(N)$ holds

I am learning RSA cryptography. The part I am stuck on is understanding how k and the public exponent $e$ is selected. Given the formulas; Decrypting: $c^d \bmod N = (m^e)^d \bmod N$ Which is equal ...
1
vote
1answer
119 views

How much data can I encrypt with RSA before I need to change the key

How much data can be encrypted with the same RSA key before it has to be changed? I looking for the total amount of data that can be encrypted for a single key pair, not the maximum length of data ...