lists  /  announce  owl-users  owl-dev  john-users  john-dev  passwdqc-users  yescrypt  popa3d-users  /  oss-security  kernel-hardening  musl  sabotage  tlsify  passwords  /  crypt-dev  xvendor  /  Bugtraq  Full-Disclosure  linux-kernel  linux-netdev  linux-ext4  linux-hardening  PHC 
Open Source and information security mailing list archives
Hash Suite for Android: free password hash cracker in your pocket
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date: Sat, 15 Aug 2015 10:09:00 -0700
From: Bill Cox <>
To: "" <>
Subject: Re: [PHC] Dumb idea of the day: Public key crypto based on random permutations

On Sat, Aug 15, 2015 at 10:06 AM, Daniel Franke <>

> Adding an efficiently-invertible group automorphism doesn't make the
> system any more secure than the system based on the underlying group
> operation. Here that group operation is modular addition, for which
> the discrete log problem is easy. If I have your public key X =
> Finv(F(x)*F(g)) where x is your private key, then I compute F(X) =
> F(Finv(F(x)*F(g))) = F(x)*F(g), use Euclid's algorithm to solve for
> F(x), then recover your private key by computing Finv(F(x)) = x.

You are 100% right.  Making the automorphism impractical or impossible to
compute seems to be the key.


Content of type "text/html" skipped

Powered by blists - more mailing lists