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.

learn more… | top users | synonyms

0
votes
1answer
672 views

Is RSA with SHA1 broken?

I am using CryptSignMessage to sign a string/file. Is using RSASha1 insecure? I know Sha1 is broken as a hashing algorithm, but does that also mean that using it for signing with RSA is broken?
0
votes
1answer
567 views

Find private exponent in RSA [duplicate]

The other answers for this confuse me, I know the principle of d in terms of the equation it has to satisfy. However I'm not sure how I would go about finding the private exponent without trial and ...
0
votes
1answer
157 views

RSA CRT modulo reduction

I am working on RSA CRT and there is a point that I don't understand : So we have $n=pq$ and $c = m^e \bmod n$ an encrypted message. To decrypt $c$ with RSA CRT, we have to compute : $d_p = d \bmod ...
0
votes
2answers
155 views

Physical Level Encryption

What types of algorithms that are capable of signing a message are out there that run on a physical level, e.g. lacking the infrastructure of a standard PC, no memory, processor or motherboard in the ...
0
votes
1answer
90 views

inverse of 985 mod(φ60131)

Alright Ive been working on this one for a while I found φ(60131) to be 97294 ½(60131+60131(5)^.5) = 97294 then I worked through the GCD ...
0
votes
2answers
59 views

Stripping off message authentication or signature

If attackers can strip off RSA / EC / -DSA digital signature and conduct CCA on AES-CTR or CBC payload, why can't they do the same for AES-GCM?
0
votes
2answers
44 views

Is ssl_sign safe as it is using OPENSSL_PKCS1_PADDING

I've been hearing a lot of scare talk about PKCS1 padding attacks. Is PKCS1 v1.5 safe in signatures as it is practically transporting only message digest? I'm using it in one of my applications so i'...
0
votes
1answer
72 views

Inverting RSA using an oracle

Say you are given an efficient deterministic algorithm 'I' that can invert the RSA function on 1% of the points in $Z^*_{N}$. That is to say that if y $ \in $ $Z^*_{N}$ is a "good" point for 'I', then ...
0
votes
1answer
54 views

Is webkey a reasonably secure authentication system?

I just created Webkey in the last couple days. This should allow any website to do single-password auth with a much higher level of auth security and convenience for users (single password with ...
0
votes
2answers
68 views

In case M is small is it possible to recover the message

In the plain RSA encryption, suppose $N$ is 1024 bits and the public key $e = 17$. Is it secure to use this setting to encrypt very small message, say $3 \leq m \leq 9$? In other words, is it possible ...
0
votes
2answers
123 views

Algebraic structures in RSA

Why do we need a field for RSA and what are the two operations in this field? Why can't we have a ring or group for example? Because in a group you also have inverse elements.
0
votes
2answers
106 views

How to encrypt incomplete block with RSA as a block cipher?

I have a question about an RSA academic example. If we are using block-RSA with a block-size of 3 and we have this message: "android". It is broken into 'and', 'roi', 'd'. How to encrypt the last ...
0
votes
1answer
82 views

RSA-OAEP: How does it work?

I was looking at this image about OAEP: ..and was wondering what was happening here. We have a data block DB which consists of: ...
0
votes
1answer
135 views

How long can a RSA public key be?

If I create an RSA of 4096 bits, what would be the range of the length in bytes of the public key in DER format? Also, will the private key always be exactly 4096 bits (512 bytes)? Does the public ...
0
votes
1answer
164 views

Is it possible to correct the exponent of an RSA public key if it has been altered?

Is it possible to change the exponent of an RSA public key?
0
votes
1answer
51 views

How to deliver an encrypted message to multiple recipients without revealing keys

Let's say I have generated a private and a public key. I create a message and encrypt it with the public key. I deliver this encrypted message and a private key to multiple recipients. Why would I do ...
0
votes
1answer
38 views

Identification by RSA

Suppose we have identification scheme as such: Bob takes random $r$, and encrypts it with Alices public RSA key $(n,e)$, sends $r^e$ to Alice. Alice decrypts $r$ and sends it back to Bob, becomes ...
0
votes
2answers
114 views

RSA generation of private key using public key

In RSA private key generation e*d ≡ 1 mod φ e is public, also n is public. How to prove mathematically, generation of ...
0
votes
1answer
123 views

Proof that $gcd(e, \lambda(N)) = 1 \hspace{1mm} \Longleftrightarrow \hspace{1mm} gcd(e, \varphi(N)) = 1$

What is the proof for the fact that $gcd(e, \lambda(N)) = 1 \hspace{1mm} \Longleftrightarrow \hspace{1mm} gcd(e, \varphi(N)) = 1$ Where: $N = P * Q$ where $P$ and $Q$ are both primes. $\varphi(N)$ ...
0
votes
1answer
175 views

RSA: how does it work and how is it more secure than symmetric systems

Before starting the question, I know that RSA is naturally a key exchange cryptosystem rather than an antilogarithm fully implemented for encrypting and decrypting data since the length of the secret ...
0
votes
2answers
335 views

How does RSA padding work exactly?

I've read everywhere online and people say plain text RSA is very unsafe. To make it safe you pad it but no examples are shown anywhere on how to do it. It's explained that random data is added to the ...
0
votes
2answers
131 views

RSA signing security

I'm curious about the security of RSA signing with the same public private key pair when the same message is sent multiple times. It's my understanding that once you generate the hash of the message ...
0
votes
1answer
107 views

What are the potential (major) flaws in this security scheme?

It’s been a few years since I read anything involving crypto. I’ve come across this scheme and I wonder how secure it is: Alice generates an RSA keypair (we assume Alice is using proper random ...
0
votes
1answer
135 views

RSA: Fermat-Euler Theorem - coprimality of message and modulus [duplicate]

I understand the implication of the Fermat-Euler theorem and how it applies to RSA and the detailed explanation by user Ninefingers at What is the relation between RSA & Fermat's little ...
0
votes
1answer
132 views

In RSA, why does Alice's $N$ need to be relatively prime to Bob's $N$?

I was asked this by my professor and I didn't understand the reasoning behind it. If Alice has a the key pair $(p_a, n_a)$ and Bob has the key pair $(p_b, n_b)$, why do $n_a$ and $n_b$ have to be ...
0
votes
1answer
179 views

Is there any probabilistic version of RSA?

I have now studying the RSA, but I think that is it possible to have some probabilistic version like a random bit string "r" XORed with the key? Is there any probabilistic version of RSA? Thak you ...
0
votes
1answer
772 views

Is it possible to find plaintext from ciphertext if (n) and (a) are known for RSA?

I have a couple of questions pertaining to a RSA problem. I need to decipher some ciphertext and find out what the original plaintext was. Modulus: $n = 2537$ and exponent: $a = 11$ Encrypting ...
0
votes
1answer
363 views

RSA Proof - Is Z(n) closed under multiplication

In RSA proof it can be proved that $\mathbb{Z}^*_n$ is closed under multiplication. Can it be also proved that $\mathbb{Z}_n$ is closed under multiplication? If yes, then how?
0
votes
1answer
167 views

Is it possible to decrypt an RSA ciphertext with only $N$ and $e$?

Is it possible to perform RSA decryption if one only knows $N$ and $e$? Failing that, what is the maximum key length where brute-force is still practically feasible?
0
votes
1answer
133 views

What is the difference between exhaustive search and factorization in relationship to determining a key?

It seems to me an exhaustive search would simply try to use all the possible bit combinations of a key, while factorization is some mathematical formula for determining the key? When discussing the ...
0
votes
1answer
459 views

Key space: Dense and sparse

I'm taking a cryptography class and I come across these terms dense and sparse key space allt he time. What do they mean? As far as I can I understand, dense key space means that there are more ...
0
votes
1answer
94 views

How to choose the appropriate public (i, m) and private (j, m) keys?

I studied some encryption and decryption and I have found some very interesting problem to solve on the internet. I hope I am writing to right site - there are so many in StackExchange otherwise I ...
0
votes
1answer
381 views

Solving congruences using PARI

I'm having trouble finding info in the docs about how to solve a system of congruences. The closest I can find is 'matsolvemod' in here: http://pari.math.u-bordeaux.fr/dochtml/html.stable/Vectors,...
0
votes
1answer
17 views

How to show that any 2-round key-exchange protocol satisfying a given definition can be converted into a public-key encryption scheme?

How to show that any 2-round key-exchange protocol satisfying a given definition can be converted into a public-key encryption scheme that is CPA-secure? The given definition is as followed: ...
0
votes
1answer
37 views

Do RSA keys contain a checksum mechanism? [duplicate]

I'm new to cryptography, and I was making an experiment a few minutes ago, but I want to have some deeper knowledge about RSA public and private keys. I have a set of keys One begins with ...
0
votes
1answer
65 views

Questions about length key of RSA 2048 bit

I use putty gen to generate RSA key, I choose length of key is 2048 bit, it generate public key: ...
0
votes
1answer
25 views

X509 Cert exploit CA check

Assumptions Let's theoretically assume that a browser skips the check that a certificate it receives belongs to the stated CA (that's an exercise). How could I exploit this in order to impersonate ...
0
votes
1answer
19 views

Digital signature with collision

Let's assume a digital signature scheme such that there's a probability of 0.2 for two random messages to have the same signature. How can I exploit this sheme? I'm having difficulties in finding an ...
0
votes
1answer
55 views

Why is it better to have the private key as the multiplicative inverse mod phi(n) in RSA?

I'm studying the RSA algorithm and the theory says to select $d$ to be the multiplicative inverse of. $$ e \mod \phi(n) $$ If we take this approach I know that it is important that $e$ and $\phi(...
0
votes
3answers
85 views

What is proper size of window Using RSA Window method?

I want to Use Window method for RSA modular Exponentiation. because of SCA. But I don`t know what is proper window size.
0
votes
1answer
47 views

How do you work out the private key in a RSA cryptosystem knowing a certain public key?

The public key: n = 85 and e = 19 I know that n is the product of two prime numbers, now is it right of me to figure them out by process of elimination which I got p or q equals 17 and 5. Or is ...
0
votes
1answer
75 views

How to decrypt an RSA ciphertext given an oracle providing the lower 8 bits of decryptions?

I have access to an oracle that can encrypt and partially decrypt a number with RSA-1024 algorithm. For encryption: \begin{equation} C = M^e\bmod n \end{equation} But for decryption, result will ...
0
votes
1answer
22 views

CCA on PKCS#5 using error feedback

My question is about attacking PKCS#5 with CCA using the error feedback. What we learnt in class about PKCS#5: CBC requires padding to whole block boundary PKCS#5: standard padding If ...
0
votes
1answer
84 views

Storing RSA private key

Currently I'm developing an application where users generate their own pair RSA keys in order to achieve a secure communication with my server. Also clients are able to communicate directly, sending ...
0
votes
1answer
191 views

Cube-Root attack - RSA with low exponent

I have this RSA public key ...
0
votes
1answer
101 views

How to decrypt RSA if ciphertext is less than the modulus and e=3?

I'm given a public key. Using openssl rsa ..... I got the public key has the exponent as 3. When I calculated the size of the ciphertext, it is 8 bits smaller than the 2048-bit modulus. How can I ...
0
votes
1answer
92 views

Doubts about Authenticated Data Structures logic

I am studying the theory of authenticated data structure, like Merkle Tree and I have a doubt: why use them? I explain better: why to be sure, for example, that a cloud provider didn't modify my files ...
0
votes
2answers
157 views

Random Coin Flip

Quoting an old question: Consider the following protocol for two parties A and B to flip a fair coin (more complicated versions of this might be used for Internet gambling): A trusted ...
0
votes
1answer
100 views

Comparing messages given only the ciphertext

Under RSA protocol I was wondering how a message sent could be verified under the following scenario Alice has a private (encryption key) and public key (decryption key) If Bob sends Alice cipher-...
0
votes
3answers
164 views

Factorizing N to derive D [duplicate]

So I have the value of N. I have to use this value of N to find the value of D. N = 265291078722948385089717069136983657793 Now I read about RSA algos and found out that ...