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 06:31:06 -0700
From: Bill Cox <>
To: "" <>
Subject: Re: Dumb idea of the day: Public key crypto based on random permutations

Minor code fix: use generator g = Finv(1) rather than g = 0.  This way, we
know that all possible values are reachable in the internal "tmp" variable
of the F function, which is F(a) + F(b).  g generates the whole group, and
m*g does not repeat until m == 2^bits.

Again, there's something very off here... something super dumb.  I bet this
is trivially proved insecure.


Content of type "text/html" skipped

Powered by blists - more mailing lists