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 with proper paddings.

Filter by
Sorted by
Tagged with
1
vote
1answer
24 views

Binary verification of application image before loading it into DRAM

Working on a boot process where the application image has to be verified before loading it into DRAM. We found 2 strategies; RSA-1024, where the private key is secure in premises and the only public ...
2
votes
1answer
64 views

Why is there no “ephemeral non-DH EC” key exchange in TLS?

In RSA key exchange, the client picks a premaster secret and encrypts it with the RSA public key in the server certificate, and sends it to the server. This offers no forward secrecy. In ECDHE key ...
1
vote
1answer
45 views

number theory question in a group with unknown order

I was reading a paper and I am struggling understanding one part of it. Lets say we have a group $G$ of an unknown order $n$. we know that $B<n<B+C$. both B and C are large values). we choose a ...
1
vote
1answer
58 views

Is there an asymetric encryption whos output size is quite equal to the input size

I want to verify, that a chunk of data which has a size of around 16 bytes is sent by me, by simply encrypting it via a private rsa key, providing the public key in the source code for the ...
1
vote
2answers
124 views

Why can't ransomware practically use RSA to encrypt all files?

I understand that a few ransomware have used an RSA public key to encrypt all files belonging to the victim. This is a bullet-proof system in terms of its security because the private key is always ...
0
votes
2answers
61 views

A number theory problem in RSA

Let say we have $N=pq$ (Both $p$ and $q$ are safe primes, meaning $\gcd(p-1,q-1)=2$) let's assume $e$ is an odd number which can be efficiently factored and assume that we know the $e$'th root of 1 ...
0
votes
0answers
8 views

Openssl : Is it possible to disable RSA blinding? [migrated]

Basically I am trying to compare versions of openssl, regarding timing attacks. But is it possible to disable RSA blinding in any given version of Openssl (new versions)? I implemented everything in ...
2
votes
1answer
172 views

Information security evaluation

I saw this exercise for evaluating the security(confidentiality, integrity, authenticity, and non-repudiation) of some schemes: ENC(M) || SignA(ENC(M)) ...
1
vote
1answer
43 views

RSA Signing: SHA512 incompatible with PSS?

I am wrapping the RSACng class from the .Net API. Whilst unit testing, I run checks against an array of possibilities: Key Size = 1024, 2048, or 3072 bits Padding ...
1
vote
2answers
91 views

SHA-3 for Integrity

We used to use CRCs to check the integrity of files. For safety analysis we could associate a probability for detecting a corrupted bit in a large file. Now we are using an RSA Signed SHA-3 hash for ...
3
votes
1answer
64 views

Can a 3rd party decrypt static Diffie Hellman?

Do cipher suites that use static Diffie Hellman (not Ephemeral) allow for the same 3rd party decryption ability as RSA cipher suites? With RSA key exchange, 3rd parties can gain possession of the ...
3
votes
1answer
64 views

What is the Bilinear-map accumulator disadvantage

Bilinear-map accumulator [1] is more efficient than the RSA accumulator [2] but do you know any disadvantage for the bilinear-map accumulator when compared to RSA accumulator?
0
votes
0answers
24 views

SubtleCrypto.wrapKey usage: can exportKey but not wrapKey? [migrated]

I'm trying to wrap an RSA private key using an AES-256 key-wrapping key, using the SubtleCrypto API. I've managed to make the RSA keys and key-wrapping AES key (plus another symmetric AES key) using <...
0
votes
1answer
85 views

Exponentiating big numbers for RSA operation

I am following the book "Network security private communication in a public world - 2nd edition. Section 6.3.4.1 Exponentiating big numbers. base = 123, exponent = 54, mod = 678 What I understand is ...
8
votes
1answer
164 views

Can we break RSA with an optical Fourier Transform?

We all known that RSA can be compromised using quantum Shor's algorithm. The horsepower underlying this algorithm is the Fourier transform. However, we can use alternatives to perform this function, ...
0
votes
0answers
34 views

Is it possible to generate a membership proof using an RSA accumulator without knowing all the accumulated values?

I am currently learning about RSA accumulators and this was just a question I had since in most available implementations I see in Github accumulated primes are stored in hash tables and they are ...
2
votes
0answers
64 views

WebCrypto SubtleCrypto RSA sign/verify AND encrypt/decrypt?

I have a project where I'd like to use public-key cryptography in both typical sign/verify situations and encrypt/decrypt situations. For example, I'd like to create a self-signed X.509 certificate ...
0
votes
0answers
19 views

Can a single RSA SecureID device be used for authentication with two different applications of different organizations?

There is a RSA SecureID having PIN + token digits (dynamically changing on device) which is already in use in Company-subsidiary-A whose technology ecosystem is ...
1
vote
0answers
60 views

Looking for a group where multiplicative inverse is hard but calculating multiple pairwise inverses is easy

I have an equation that comes up in trying to do an Attribute Based Encryption scheme, where users have certificates that sign off on attributes that are also watermarked. I perform a division to ...
0
votes
0answers
54 views

Brute force integer factorization - back of the envelope calculation

RSA-240, an integer with 240 decimal digits from the original RSA Factoring Challenge, has recently been factorized. According to the researchers, the factorization took a total of 900 core-years on ...
0
votes
1answer
23 views

Nonmembership witness in universal accumulator

We can say that when compared to a Merkle tree, inclusion proofs are constant size by membership witness. Can we say that also for exclusion proof bu nonmembership witness? Is there any advantage of ...
4
votes
1answer
144 views

Create a ciphertext that decrypt to different plaintexts with different keys in RSA

(This is inspired by this question 1; have also read this question 2 but it's one-time pad) I would like to know, given two message $m_1$ and $m_2$, as well as public keys $(e,n_1)$ and $(e,n_2)$, ...
1
vote
0answers
22 views

How to design a moderated, group for private messages?

I’m trying to figure out how I could create a private group that was P2P yet still allowed someone to moderate members (no public access to messages). I’m assuming standard hybrid encryption (RSA/EC + ...
1
vote
1answer
60 views

RSA signing - does EMSA-PKCS1-v1_5 padding need to be verified?

I am working with an embedded system that accepts firmware updates only if they are validly signed by a particular 2048-bit RSA private key (the embedded system's bootloader knows the corresponding ...
1
vote
0answers
23 views

Help with next step in the Quadratic Sieve

So I am at the same step as someone from math.stackexchange but he never recieved an answer so I will copy-paste his question here: Say, for N = 90283, I compute bound 𝐵=𝑒(12+𝑜(1))(ln(𝑛)ln(ln𝑛√))...
1
vote
1answer
26 views

How RSA is implemented by authentication protocols?

I am a beginner in cryptography, i recently learned about RSA algorithm : In short, my understanding for this is : Sender needs receiver's public key to encrypt the message to a cipher so that only ...
0
votes
0answers
37 views

Is encrypting data with AES-CTR-128 and keys with RSA-2048 secure?

Here's a question. I have a file that have to be encrypted with strong cipher (I've choosen AES-CTR-128). I'm using MVC 2019 to compile C++ program. Firstly, I create RSA-2048 key pair (public and ...
3
votes
2answers
117 views

Is the RSA cipher alike to the Shift/Caesar cipher?

I'm sort of a beginner on cryptography so this is probably a really elementary question. I only know the historic ciphers and the general background on cryptography as well as it's general meaning. I'...
0
votes
2answers
78 views

RSA p and q size to encipher a block

I have a plaintext about 18 bit size. I have to encipher it using RSA. How large have to be p and q? So M (message to encipher) = 2**18 bit I tried, using a Python coded RSA alghoritm, different sizes ...
1
vote
2answers
71 views

Secure implementation of public key cryptography

Reading online I've found out that for example the RSA implementation that you usually find on textook is not secure. Where I can find some secure implementation of algorithm such as RSA, ECDH, ECDSA? ...
0
votes
1answer
78 views

Problem with calculating the correct value for $(p-1)*(q-1)$?

I came to a problem when calculating some values for RSA encryption task. So the data I have is this: $e*d=81$ $C=5$ Now I have to calculate the original message($m$) and I have an issue because I ...
0
votes
1answer
56 views

RSA: How to compute plaintexts knowing ciphertexts, public key and relation between plaintexts

I'm trying to solve an exercise where you have to compute two plaintexts $p_1$ and $p_2$, knowing the corresponding ciphertexts $c_1$ and $c_2$ and the public key, of which $e=3$, and $n$ is a large ...
1
vote
1answer
90 views

Using RSA public key as private key and vice-versa

I am writing an application that involves checking to see if data has been created by me. I do this by encrypting the data with the private key on my server, and then decrypting it using the public ...
3
votes
2answers
704 views

Is direct RSA encryption of AES keys secure?

I am wondering: If we take this scheme/procedure and each of it seems very secure (to me at least), is it truly secure or is there a vulnerability hidden in the process? This is the scheme: Bob has ...
0
votes
0answers
29 views

Nonmembership and membership witness in universal accumulator

I am trying to understand cryptographic accumulator and I dont exactly the definition of universal accumulators.I found a definition with its properties in "Universal Accumulators with Efficient ...
-2
votes
1answer
85 views

RSA - Compute signature

I have a question in (textbook) RSA. Suppose we have two public keys $pk_1=(e_1,N)$ and $pk_2=(e_2,N)$ (with $\gcd(e_1,e_2) = 1$). Assume that there are $\sigma$,$\sigma'$ such that $\sigma$ and $\...
3
votes
1answer
173 views

RSA: If the least significant bits of the factors are leaked, what advantage is there in factoring N?

For $N=pq$, if the first $x$ least significant bits of both $p$ and $q$ are leaked. what is the advantage in factoring $N$? Does this give an advantage beyond simply lowering the number of bits we ...
3
votes
2answers
85 views

Multiple (RSA) public key encryption how to verify others received the same information? Non-deterministic encryption

I have an RSA system between multiple parties. Alice takes the targets (Bob and Oliver) public keys and encrypts a message using them and sends it to them. All parties know each other's public keys ...
30
votes
4answers
7k views

The GCD strikes back to RSA in 2019 - Good randomness is the only solution?

When someone collects lots of RSA public modulus, the first thing comes to mind is; $$\text{GCD them all}$$ If you calculate the GCD of two different RSA modulus and if the result is not 1 then you ...
2
votes
1answer
78 views

Which padding is used for sha256WithRSAEncryption (1.2.840.113549.1.1.11), deterministic or random?

Questions Is the only way to know which padding was used is to know the context of how sha256WithRSAEncryption was used (that PS is 0xFF when signing, and random non-zero when encrypting)? Is there ...
0
votes
0answers
29 views

Server stored, encypted messaging app

For my personal research, I have to create a messaging app, but security is only important part of application, security from MITM (man in the middle attack), at device end, and at server level. (note:...
1
vote
1answer
81 views

Elliptic Curve vs RSA key length comparison

I'm new to ECC. From this website (GlobalSign Elliptic Curve Cryptography) a 256 elliptic curve key pair provides as much security as a 3072 bit RSA key pair. My question is: how do experts come to ...
1
vote
0answers
70 views

How does RSA encrypt a message? Are the message packets chained together?

This question is quite related to this one, but I am looking for more details. I am writing a very basic implementation to demonstrate how RSA works. My current implementation generates key pairs ...
0
votes
0answers
23 views

How to rotate keys for plaintext in DB encrypted by RSA?

I have encrypted plaintext with an RSA public key. It is stored in a database. This public key will be encrypted by another key with a different encryption algorithm. What does key rotation look like ...
2
votes
1answer
100 views

Finding a pair of exponents so that $c^a \bmod N = c^b \bmod N$

I am not very familiar with RSA, so this question may appear to be stupid. Suppose that in RSA encryption, we are given $c$ (the ciphertext) and $N$ (the semi-prime modulus), can we find a pair of ...
1
vote
1answer
130 views

My RSA decryption doesnt match answer

Break the RSA code whose key is $(n, e) = (8369428283, 1234567)$. Find the deciphering key and then decipher the message under the assumption that the plaintext consists of 7-letter blocks in the ...
0
votes
1answer
48 views

In RSA encryption, can I calculate d given only m,n,c and e? [duplicate]

Newbie here. Not familiar with cryptography; just interested and reading up about it from time to time. We know that the RSA problem (let's say $c=m^e \bmod N, c^d= m \bmod N$) is about recovering $...
2
votes
1answer
39 views

Do I have to know RSA padding scheme in advance when verifying signature with EVP_Verify*?

Is there a way to figure out what RSA padding type was used on signature during verification (when calling EVP_VerifyInit, EVP_VerifyUpdate and EVP_VerifyFinal) or is it a matter of convention which ...
2
votes
1answer
56 views

Modification of RSA using two inverses, one for P mod (Q-1) and one for Q mode (P-1), instead of inverse d mod [(p-1)(q-1)], more or less secure?

Lets say I have the following modified RSA scheme We choose two large primes P, Q, with additional restriction that these are relatively prime to (p-1) and (q-1) We choose N = PQ as public key We ...
1
vote
0answers
32 views

Verify XML digital signature

I'm trying to figure out how to verify an XML digital signature. I have received a signed XML response (in string) in following format: ...

1 2 3 4 5 40