Re: Efficient asymmetric encryption (Newbie)
- From: "anern" <anern@xxxxxxxxxxx>
- Date: Sat, 26 Nov 2011 09:57:29 -0000
Sorry if this seems obvious but to clarify,
If k1..kn are symetric keys, when the machine is compromised, all the
recorded whilst the current key was in use will be compromised. And if
can be discovered (from the program code) maybe k(i-1),k(i-2),...,k(i-n)
also be disovered ?
No, if it's a oneway hash you shouldn't be able to compute k(i-1) from
k(i). That's the point. As he said though all future keys would be
Thanks again everyone, for pointing me in the right direction, this sounds
like the way to go but I need to do some reading. A google of "cryptography
key evolution" yielded
http://www.cs.bu.edu/~itkis/pap/forward-secure-survey.pdf so I'm going to
get a little brain fry in today.
- Prev by Date: Re: Efficient asymmetric encryption (Newbie)
- Next by Date: Re: Fame and Glory at an Exorbitant Price.
- Previous by thread: Re: Efficient asymmetric encryption (Newbie)
- Next by thread: Re: Efficient asymmetric encryption (Newbie)