Reputation
Top tag
Next privilege 250 Rep.
View close votes
Badges
5
Newest
 Editor
Impact
~209 people reached

  • 0 posts edited
  • 0 helpful flags
  • 2 votes cast
Apr
21
comment Standards/RFCs for non-Diffie-Hellman perfect forward secrecy?
@mikeazo nope, it's not invertible. The one I've got in mind was for example QD-McEliece with fujisaki-okamoto padding.
Apr
14
awarded  Editor
Apr
14
revised Standards/RFCs for non-Diffie-Hellman perfect forward secrecy?
deleted 3 characters in body
Apr
14
revised Standards/RFCs for non-Diffie-Hellman perfect forward secrecy?
a little more straightforward explanation
Apr
14
comment Standards/RFCs for non-Diffie-Hellman perfect forward secrecy?
Not a duplicate -- I'm asking for any standard or standard-looking paper or implementation guideline for PFS that wouldn't use DH/eDH, and would (preferably) only use asymmetric encryption. The thing about that ECC-RSA or postquantum algorithms would "fit" there is merely a cool consequence. It would be also nice to know that there's none so it would be reasonable to open a discussion about creating it.
Apr
12
comment Standards/RFCs for non-Diffie-Hellman perfect forward secrecy?
This whole question is "triggered" by post-quantum fears, so I want to remove anything shor-algorithm-related from PFS, including ecc-DH and ecc-RSA. About the "ECC RSA thing", if you mean the key generation in milliseconds -- I might have overstated it a bit, but it's definately very fast.
Apr
12
asked Standards/RFCs for non-Diffie-Hellman perfect forward secrecy?
Oct
9
awarded  Teacher
Oct
9
answered Is it feasible to build a stream cipher from a cryptographic hash function?
May
3
awarded  Supporter
Mar
31
awarded  Scholar
Mar
31
comment Using encryption schemes for identification
And comments: FMTSeq and similar hashes have support for unlimited signature numbers, but that either brings key schedule problems or makes the signatures terribly big (2^256-ops secure FMTSeq has 10KiB for one signature, for around 1M signature limit...)
Mar
31
comment Using encryption schemes for identification
Thanks, these two ideas seem to capture where I needed to get pushed :) Thanks for CCA1 mention, I already have CCA2-resistant scheme (Fujisaki-Okamoto padded McEliece) so I guess that would work.
Mar
31
accepted Using encryption schemes for identification
Mar
30
awarded  Student
Mar
30
asked Using encryption schemes for identification