# Tagged Questions

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.

49 views

### How secure is 'Plain Old RSA' [duplicate]

Let's say I use RSA encryption, it's 2048 bits and I use a simple character padding scheme, every character is turned into a 3 digit number and strung together, then encrypted. Saying that no message ...
188 views

### When/why is RSA (hybrid) encryption used rather than alternatives?

I've read that RSA is not meant for encrypting large plaintext because: (Are these also true for other public-key encryptions like ElGamal?) It is slow. Padding makes the ciphertext blocks much ...
269 views

### Modular exponentiation on calculator for textbook RSA

How do you encrypt $51$ with public key $(n,e) = (91,23)$ I understand that $c = 51^{23} \bmod 91$. How can I calculate the result on a calculator?
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 ...
228 views

246 views

### Help with RSA-2048 crypto ransom virus [closed]

The RSA-2048 Crypto Ransom Virus has devastated me, I tried the backup method, the previous version, the Shadow Explorer, it deleted all my restore points, Its took out 5 HDs and my USB pen that ...
108 views

### How much stronger is RC4 if it is keyed with an RSA private key?

My idea is to generate a RSA 2048 bit key and use RC4 with the private RSA key to encrypt a stream of data. RC4 is weak because RC4 keys are small, 256-bit. But when we use RC4 with private RSA 2048 ...
26 views

### Simple RSA Key Generation example [duplicate]

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? My working ...
88 views

### Attack on textbook RSA with small messages

We learned in class that if Alice wants to send a small message $m$, such that $m < N^{\frac{1}{e}}$, so we can break the system using $e$-th square of $m^e$. But what if Alice knows this flaw and ...
71 views

### MITM Attack on Key Exchange Protocols

I was doing research on this attack and I am wondering, why is Diffie-Hellman always associated with such an attack? ​ Aren't other public key cryptography schemes vulnerable to the same kind of ...
49 views

### How to store keypair generated by RSA in a textfile?

I'm trying to write an encryption decryption program using Openssl-RSA. There are only two operations. User stores the data and retrieves it whenever he needs. To decrypt something, we need the ...
66 views

### Is there a fast implementation of RSA for Microcontrollers?

Zhe Liu, Johann Großschädl, and Ilya Kizhvatov. "Efficient and Side-Channel Resistant RSA Implementation for 8-bit AVR Microcontrollers" describes a fast implementation, but only contains a sketch of ...
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 ...
275 views

### RSA enc/decryption with multiple prime modulus using CRT

Every information I found on internet about RSA-CRT encryption/decryption uses only two primes. I'm interested in my project in doing that using multiple (up to 8) primes. The general idea is to ...
91 views

### RSA message integrity

I wish to send some small data that RSA alone can encrypt, and I send a shared secret along with it. ...
38 views

### Deletion complexity in a RSA accumulator

My question is about the existence of a dynamic RSA accumulator with deletion of an element in O(1) time. Do you know some practical implementation?
23 views

### How to calculate Private Key in RSA using Extended Euclidean Algorithm [duplicate]

I have googled for about 2 hours now and still haven't found an explanation. The wiki article just makes me more confused and so has every other similar question I've found on StackExchange. Here's an ...
167 views

### Modular Arithmetic in RSA

Consider the following the following RSA public key $pk = (N, e) = (1457, 1307)$. (a) Knowing that $187^2 \equiv 1 \pmod {1457}$ find the factorization of $N$. (b) Given the factorization of $N$ ...
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 ...
147 views

### Could Riemann hypothesis solve certainly RSA?

I don't have the background for dealing with Riemann hypothesis but is well known that covers the prime distribution below a specified number. In order to solve the RSA problem you have to factor the ...
82 views

### RSA Optimal Asymmetric Encryption Padding Beginner

I'm new to the OAEP scheme. I learn it from the Wikipedia page. Link The page does not explain a proper setup for of the system. So I'm not sure if the output of the padding scheme which contains ...
60 views

211 views

### RSA: Most significant key bit always 1?

Is it possible to say that the most significant bit of an RSA private exponent is always 1? Wouldn't that weaken the key strength by exactly that one bit? I refer to the paper "Timing Attack: What ...
82 views

### Which hash function is usually used in RSA?

I know there are several available, however I can't seem to find whether there is one standard one or not. I think I understand the process of digital signatures, just wondering which has function is ...
168 views

### Help understanding basic Franklin-Reiter related message attack

I am trying to understand this attack at the most basic level. I set up the following basic scenario: Let the public encryption exponent, e = 3. Let p, be some arbitrary but known (to the ...
88 views

### Deletion in RSA Accumulator

I am studying RSA Dynamic Accumulator and I have a question: why is simpler to calculate the new accumulator value after a deletion if is known the secret ϕ(n)? Is possible to calculate the deletion ...
94 views

### Does the RSA algorithm use repeated squaring?

Simple question: in order to reduce such huge exponents in modular arithmetic, is repeated squaring used in RSA or is there a better way to implement it?