Reputation
Next privilege 125 Rep.
Vote down
Badges
8
Impact
~3k people reached

  • 0 posts edited
  • 0 helpful flags
  • 5 votes cast
Jun
18
awarded  Popular Question
Mar
18
accepted Can the same random number be used in encryption and signing?
Mar
11
comment Can the same random number be used in encryption and signing?
Thanks Bodewes, but why I shouldn't ?
Mar
10
asked Can the same random number be used in encryption and signing?
Mar
10
comment Reusing the random exponent for ElGamal encryption with different plaintexts
@Florian: How ?
Mar
10
comment Reusing the random exponent for ElGamal encryption with different plaintexts
@AMarcedone: So, we need a random r for each message...
Mar
10
revised Reusing the random exponent for ElGamal encryption with different plaintexts
added 13 characters in body
Mar
10
asked Reusing the random exponent for ElGamal encryption with different plaintexts
Sep
23
comment Using modulus in one time pad?
@GuutBoy: Yes, Thanks, but your response is related to key generation, I modified my question, the keys are generated using a PRF ! Now, what is the role of the modulus M ???
Sep
23
awarded  Curious
Sep
22
revised Using modulus in one time pad?
added 89 characters in body
Sep
22
comment Using modulus in one time pad?
So, for generating the keys, I use a PRF such as HMAC, which outputs a key of fixed size .e.g. 160 bits so, if the key generation is secure, what is the need of using a MODULUS ??? Where are you, experts !!
Sep
22
comment Using modulus in one time pad?
so, we have to use a finite group to provide security !? Can you please give me any link...for this !?
Sep
22
comment Using modulus in one time pad?
Yes, but in terms of security, what is the role of M !?
Sep
22
awarded  Commentator
Sep
22
comment Using modulus in one time pad?
So, for security reason, we must use the modulus ???
Sep
22
asked Using modulus in one time pad?
Mar
4
comment IND-CPA Security
the community recommend me that instead of KDF I use a PRF(Pseudo Random Function) such as AES (or any block cipher) replacing KDF(K|n) with AES(K,n) where K is the key to AES and n a non-repeating counter or a non-repeating nonce (both implementations give me an IND-CPA encryption ! ?).
Mar
1
comment IND-CPA Security
I am using a secure KDF to randomize the outputs from one message to another. The derived key Kn=KDF(k|n) is then used in OTP namely C = Kn Xor M .
Feb
28
comment IND-CPA Security
@K.G: Symmetric encryption.