Re: [Monotone-devel] netsync transport encryption?

[Ulf Ochsenfahrt]

Jeronimo wrote:
> On Wed, Oct 25, 2006 at 06:08:04PM -0300, Jeronimo Pellegrini wrote:
> > That would be O (RSA x users) every time you commit... Is it necessary?
> > (Or DSA, or whatever other asymetric algorithm)
>
> Just so I write it correctly:
>
> The time would be O ( R x U ) per commit, where
>
> R = time of RSA(single key)
> U = number of users
>
> So I'd rather change the key only when necessary.

I agree that it's more sensible to only switch revision keys when a 
change of user trust occurs. Additionally, it might be possible to bring 
the time requirements down to O(R x log(U)) for a key switch, by using a 
binary tree of users.

Is Apso a branch of monotone? Or does it work entirely different? The 
website mentions that you plan to support other systems as well, that's 
why I ask.

Is this already offtopic?

-- Ulf

smime.p7s
Description: S/MIME Cryptographic Signature