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

1
vote
1answer
157 views

Preimage resistance hash in digital signature

I'm studying about preimage resistance property of the hash functions. In particularly I'm reading as the missing of this property can be fatal in digital signatures that use RSA. Further details: ...
1
vote
1answer
122 views

What kind of cryptography should i use?

I have a trusted third part A that issues an access token (xml file) to an untrusted client C that uses this token to log into an untrusted server S and access to the authorized files. I want only ...
1
vote
1answer
352 views

When making public key fingerprints - is a sha1 hash still a good idea?

I'm thinking about trying to save some space (and readability) when referencing 2k and 4k public keys (millions of them) by storing the fingerprint in some places instead of the full public key. ...
1
vote
1answer
601 views

Weakness in using only one RSA key pair for two-way communication?

In Alice/Bob/Cindy terms (EDIT: and with a little more detail): Alice and Bob have each securely obtained one key of an RSA keypair from a trusted third party. Alice has one key ($e$ and $n$), Bob ...
1
vote
0answers
47 views

Implementation of garbled circuits using RSA

I was just reading these notes on garbled (Yao) circuits and I just stuck trying to figure out how an implementation of Table 1 would work using RSA encryption. In RSA the public key is (n,e). So for ...
1
vote
0answers
44 views

exchanging private key between service and iPhone app - digital signing

I need to do digital signing of my request data which will be sent to the server. My server sends distinct private keys to her clients after authentication and expects all responses to be digitally ...
1
vote
0answers
83 views

Is it possible (how difficult) to find MORE than one valid RSA signature?

Is it possible (how difficult) to find more than one valid RSA signatures for a given message m (after padded) and a public key ...
1
vote
2answers
65 views

RSA-KEM construction

"Create a random key for CCPA2 scheme, encrypt m, send it along with a PK encryption of the symmetric key. " Say in the process, the KDF is HMAC, then: get a random key (128-bit) C1 = encrypt ...
1
vote
2answers
127 views

Public key Issue - same key pair as existing one? [duplicate]

My question is a bit naive, but what if someone generates the same RSA key pair as someone else? This person would have the same private key and so would be able to decrypt messages not intended to ...
1
vote
0answers
59 views

Coppersmith method for factorisation

Is anyone familiar with the Coppersmith method? Does anyone know how is the $3\times3$ basis matrix obtained in this case?
1
vote
0answers
40 views

Minimum length of PKI key for signature [duplicate]

I am looking for data which shows how time it would take to brute force (or crack by any other method) different sizes of RSA/DSA keys used for a digital signature. I am looking to use as small a ...
1
vote
0answers
124 views

Commutative Encryption with RSA scheme?

I wanted to know how I could manage to do what I'm going to tell you next, with the RSA encryption/decryption scheme. So Alice and Bob each have a public key $(n, e)$ and a private key $(p, q, d)$; ...
1
vote
0answers
49 views

RSA Key Blinding

I was looking the answer to the following question (Timing attack on modular exponentiation), discussing the Private Key Blinding as a countermeasure for timing attacks. Therefore I'm asking if ...
1
vote
0answers
94 views

Shor's Algorithm values

I'm working with Shor's algorithm and I have a question regarding the following step $$a^r -1 = (a^{r/2}+1)(a^{r/2}-1)=0 \pmod n$$ Now what is going to be the result if ${r/2}$ was -1? this will ...
1
vote
0answers
45 views

Smart card Strong authentication / Verification ( fingerprints)

I'm trying to make a strong authentication software and embedded software in a java card. I have found many papers and publications about the subject… too much information to process and I'm working ...
1
vote
1answer
106 views

Sequence of Encrypting RSA like Chaum Blinding scheme

I'd be a noob in cryptography but reading up a little on RSA, I do get some understanding and I want to specifically resolve this issue. UPDATED Lets say we have the following values in place: ...
1
vote
0answers
117 views

Defending hybrid encryption schemes against padding oracle attacks

I intend to use a generic integrated/hybrid encryption scheme for transmitting information between a client and a server. Key encapsulation: a 128-bit symmetric key is generated and asymmetrically ...
1
vote
0answers
73 views

RSA timing attack

Given an RSA implementation that uses Montgomery multiplications and CIOS exp algo, but NOT CRT. Given a decryption1 oracle that takes chosen cipher text and responds the plain text and the time it ...
1
vote
0answers
128 views

Is this a secure (and correct) sign-then-encrypt technique for transferring messages?

After reading some information on the way iMessage works I have been working on writing some code to try my hand at securely transferring messages in a similar manner and I wanted to confirm that the ...
1
vote
0answers
82 views

Is MITM possible after key exchange phase done successfully in RSA?

Is MITM attack theoretically possible after public/private key pair exchange is done successfully. Say Alice and Bob have genuine public keys of each other. Is MITM possible further during ...
1
vote
0answers
104 views

Distributed integer factorization?

I'm looking around for publicly published work on factorization of large numbers using distributed systems of any kind. So far I've come across the PDF "Mapreduce for integer factorization" by Javier ...
1
vote
0answers
101 views

Can you show how that RSA does/doesn't provide anonymity?

Considering a CPA-secure version of RSA where the ciphertext is just a rundom element from $Z^*_N$. Does that meet the anonymity requirement in which an cpa adversary cannot distinguish between a ...
1
vote
0answers
87 views

Is it possible to modify SSL handshakes to enable PFS while still using RSA during the handshake?

I know we could possibly be using DH key exchange, that would enable PFS. However, what if we make modifications on our SSL 3.0 handshake such that the only cipher we use is RSA for the achieving PFS? ...
1
vote
0answers
95 views

Unblind a RSA blinded signature

I have blinded $m = 16$ with $r= 13$, $e = 7$ and $n = 209$. This resulted in $m' = 464$, which led to a $s' = 8$. Now, I want to unblind this $s'$ by using $s = s' \times r^{-1}$ but im stuck at ...
1
vote
0answers
182 views

Factoring large numbers

I am trying to factor few integers that are each between 115 and 135 digits long. I have just, little over a month ago, began my study of Cryptography. I was wondering if anyone knew of any efficient ...
1
vote
0answers
162 views

Diffie-Hellman exchange

So for a Diffie-Hellman problem, I am given the prime $p$ for the Diffie-Hellman exchange. I am also given $g$, secret number for machine as $A$, secret number for station as $B$, a Diffie-Hellman ...
1
vote
0answers
471 views

Decrypting a message without the private key using CRT

I am given 5 different encryption modulus, $N$, each ranging from 78 to 88 numbers long. Then for the encryption exponent, each has the same which is 5. Then I am given 5 different encrypted messages, ...
1
vote
0answers
111 views

Career advice for our readers [closed]

I am a first year math PhD student with work experience and an MS in math. Do you have any advice regarding internships involved with cryptography and other mathematics other than the NSA? Thanks.
1
vote
0answers
274 views

RSA Attack with some known values

There is an RSA implementation which I need to attack to get the encrypted messages. Some of the values are known. Plain text value for input. So if I enter a message, say it "A", the plain text is ...
1
vote
0answers
119 views

Can anyone explain most popular RSA attacks like I'm 5?

Suppose I implement RSA myself in C and I use just the formulas from number theory. What attacks would my implementation be vulnerable to? Can anyone explain this to me like I'm 5?
1
vote
0answers
136 views

Best Asymmetric Encryption Standard for Communications? [closed]

I'm new to the standards of encryption. I understand the math behind RSA really well. I'm wanting to design an application for private peer to peer communications using RSA and wanted to know what ...
1
vote
0answers
69 views

Why is it impractical to generate a semiprime dictionary? [duplicate]

This might be a very simple question. However, I am just learning the concept, so just excuse me. I am wondering why there is not any attempt to generate all semiprime numbers? (as an dict. attack to ...
1
vote
0answers
170 views

Method and explanation for calculating difference in speed between DES and RSA

Our assignment asks us to convert an RSA speed in bytes per second to a DES speed in bytes per second. Our professor's treatment of this ("RSA is 100 times slower than DES") seems insufficient. Could ...
1
vote
0answers
81 views

Strong RSA problem in $\mathbb Z^*_{n^2}$

Comparing to this question, assume $C, M \in \mathbb Z^*_{n^2}$, $e \ge 3$, is it hard to compute $M$ that satisfies $C=M^e \mod n^2$ when $C$ and $(n, e)$ are given?
1
vote
0answers
283 views

RSA and One Time Password (OTP) service

What is the expert cryptographic opinion on the following? Assume that there is a web server and a client on web page. User on the Client calls an OTP web service on the server which: creates a RSA ...
1
vote
0answers
409 views

How compared encryption algorithm in terms of efficiency

I want to compare two cryptographic algorithms. The first algorithm is RSA, and second algorithm is ElGamal elliptic curve cryptography. Now, I’m looking for a way to compare the speed of the two ...
1
vote
0answers
48 views

Generating Polynomials for the MPQS

I'm going to try and eventually factor RSA-100, but my current QS needs a lot of improvement, so I'm going to try and switch over to the MPQS. I'm a bit confused as to how the MPQS works, which is ...
1
vote
0answers
111 views

Factorize RSA knowing several N and E

I did a CRT challenge yesterday and there`s one problem I was unable to solve, probably due to my lack of understanding advanced crypto math. It`s about RSA. There are ten given pairs of N and E ...
1
vote
0answers
78 views

Two untrusted party want to exchange data: how to ensure each one gets the data it needs? [duplicate]

Possible Duplicate: Two untrusted party want to exchange data: how to insure each one gets the data it needs? I am trying to come up with what could maybe be a novel algorithm for an ...
0
votes
2answers
219 views

Why are these techniques not feasible to crack RSA?

For $d = e^{-1} \mod \phi(n)$ $$d\cdot e \operatorname{mod} \phi(n)=1$$ $$d = (e^{-1} \operatorname{mod} \phi(n))$$ With having $e$ and $n$, we can calculate the value of $d$ , the private key for ...
0
votes
2answers
642 views

RSA PCKS1 v2.1 RSAES-OAEP algorithm

Using RSA public key (n,e) the encryption of a message is c= (m^e) mod n and the corresponding message is decrypted as ...
0
votes
2answers
120 views

Is RSA encryption the same as signature generation?

Is performing RSA encryption with the private key identical to performing RSA signature generation (signing)?
0
votes
2answers
151 views

Encryption of a number with RSA bigger than $n$

I'm having trouble understanding why encrypting a number $m$, which is larger than $n=p\cdot q$. I've looked into the following threads: Why RSA can't handle numbers above 76? Why does plain RSA ...
0
votes
3answers
157 views

Question on RSA trapdoor permutation

You plan to use a public-key cryptosystem based on the RSA trapdoor permutation in three different real-life applications, in which the attacker has, respectively, only one of the following resources: ...
0
votes
1answer
918 views

Does ssl_rsa_with_rc4_128_md5 have known weaknesses?

My bank's website uses HTTPS with the cipher suite ssl_rsa_with_rc4_128_md5. What are the known weaknesses of this suite? Do they have a practical impact for ...
0
votes
2answers
145 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
123 views

Certificate == signed public key

For primes p and q used to create a keypair, I understand that the following operation is used to create a signature: $M^d (\bmod\ N)$ where d and N have their usual meanings and M is the message. ...
0
votes
1answer
85 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
140 views

Why would an RSA library tell me that the public key must be at least 512 bits in size?

I'm trying to interoperate with a web service by reverse-engineering it. Currently, when sending a POST request, it encrypts the form data one-by-one with a 'RSA' function. But it's rather weird as ...
0
votes
1answer
84 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?