lists.openwall.net | 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 linux-cve-announce PHC | |
Open Source and information security mailing list archives
| ||
|
Message-ID: <419F2E25.1030302@psilanthropy.org> From: hades at psilanthropy.org (Anders Langworthy) Subject: Time Expiry Alogorithm?? Andrew Farmer wrote: > <nitpick> > > Factoring primes is a solved problem. You probably mean "factoring the > product of two large primes". > > </nitpick> Oops. Andrew is absolutely correct. I apologize if anybody was confused about the distinction. I should have proofread. //Anders