1,223 reputation
716
bio website
location
age
visits member for 2 years, 11 months
seen 16 hours ago

Dec
11
awarded  Notable Question
Dec
7
comment How do I calculate the private key in RSA?
These are standard techniques you can find in all books.We say the same thing.In order to compute the inverse you can use the extended euclidean algorithm
Dec
6
revised How do I calculate the private key in RSA?
added 1 characters in body
Dec
6
answered How do I calculate the private key in RSA?
Dec
6
comment Why the following attack in common modulus RSA works?
You said that even if we do not know $\lambda(N)$ we can learn $k \lambda(N)$ which is true. But then how you apply the $mod(\lambda(N))$ operation?
Dec
5
reviewed Approve suggested edit on Is an elliptic curve over $\mathbb{F}_p$ order preserving for the points $(x,y) \in \mathbb{Z}_p$?
Dec
5
revised Is an elliptic curve over $\mathbb{F}_p$ order preserving for the points $(x,y) \in \mathbb{Z}_p$?
added 17 characters in body
Dec
5
comment Is an elliptic curve over $\mathbb{F}_p$ order preserving for the points $(x,y) \in \mathbb{Z}_p$?
sorry i assume there are always positive.
Dec
5
comment Is an elliptic curve over $\mathbb{F}_p$ order preserving for the points $(x,y) \in \mathbb{Z}_p$?
I assume that x,y are always smaller than the modulo
Dec
5
comment Modulus for elliptic curve point multiplication
@CodesInChaos I thought we always think for polynomial interpretations in finite fields (?)
Dec
5
asked Is an elliptic curve over $\mathbb{F}_p$ order preserving for the points $(x,y) \in \mathbb{Z}_p$?
Dec
3
comment Graphically representing points on Elliptic Curve over finite field
What does this mean?
Dec
3
comment Graphically representing points on Elliptic Curve over finite field
side question: How can you find a base point of a curve?Or because the underlying field is of prime order so all the points of the curve they do form a basis?
Nov
29
comment Mapping between subgroups and the integers
Can you elaborate more on the security reasons that we do not use all elements in $\mathbb{Z}_p^*$ but only a subset of them?
Nov
28
comment Homomorphic Encryption and Semantic Security using Lattices?
@DrLecter " If you look at the definition of the homomorphic addition (multiplication) you see that they use ciphertexts with respect to independently chosen $a$ and $a′$ for encryption of message $m$ and $m′$ ": different a->different keys
Nov
28
comment Homomorphic Encryption and Semantic Security using Lattices?
I cannot understand the purpose of the noise $e$ since it can be recovered applying $\mod{2}$ to the ciphertext by everyone
Nov
28
comment Homomorphic Encryption and Semantic Security using Lattices?
@DrLecter you mean that their breakthrough is that even you encrypt with different keys $k_1$ $k_2$ two plaintexts $p_1$, $p_2$ you can evaluate homomorphically an operation in their ciphertext space? But with which key you can decrypt it?
Nov
24
awarded  Yearling
Nov
23
comment ElGamal: Multiplicative cyclic group and key generation
You mean that $q$ should be a safe prime of the form $q=2k+1$ where $k$ is also a prime? Because in your writing you substitute $k$ with $p$ where $p$ is the prime of the initial group.Which is like a 'loop'.
Nov
21
comment Hashing/encrypting an integer to produce an unique integer in the same range
Why?if there is a fast hash algorithm, that you can truncate its output?IT's like shooting the fly with a bazooka