On 1/6/07, Allen <[EMAIL PROTECTED]> wrote:
One of the questions that I have been raising is trust and how to
ensure that that it is not misplaced or eroded over time. Which
leads me to my question for the list: I can see easily how to do
split key for 2 out of x for key recovery, but I can't see
I think you are looking for the m of n solution, or commonly known as
shared secret which can be implemented using shamir's or blakley's
scheme.
you can find a open source implementation of shamir's scheme @
http://point-at-infinity.org//
or more info check out the wikipedia entry:
http://en
Allen wrote:
> One of the questions that I have been raising is trust and how to ensure
> that that it is not misplaced or eroded over time. Which leads me to my
> question for the list: I can see easily how to do split key for 2 out of
> x for key recovery, but I can't seem to find a reference to
On Sat, 06 Jan 2007 13:13:32 -0800
Allen <[EMAIL PROTECTED]> wrote:
> Hi everyone,
>
> I'm Allen Schaaf and I'm primarily an information security analyst -
> I try to look at things like a total stranger and ask all the dumb
> questions hoping to stumble on one or two that hadn't been asked
> bef
Hi everyone,
I'm Allen Schaaf and I'm primarily an information security
analyst - I try to look at things like a total stranger and ask
all the dumb questions hoping to stumble on one or two that
hadn't been asked before that will reveal a potential risk.
I'm currently consulting at a very l