I just got a notice that the P1363.1 "Hard problems over lattices" ballot group has been disbanded. Is P1363.1 no more? I know that last year there was break found in the nTRU encryption algorithm (based on a hard problem over a lattice), but it was still functional enough to be faster than elliptic curve. Have things degraded in the last year to where lattice-based cryptography is no longer viable? I hadn't seen any traffic about this on the reflector, so I was just a little curious...
--
Thanks!
Matt Ball, IEEE P1619.x SISWG Chair
M.V. Ball Technical Consulting, Inc.
Phone: 303-469-2469, Cell: 303-717-2717
http://www.mvballtech.comhttp://www.linkedin.com/in/matthewvball
______________________________________________________________________
To unsubscribe, mail LISTSERV@xxxxxxxxxxxxxxxxx with
the body of the message containing: SIGNOFF STDS-P1363-DISCUSS
Send any concerns to STDS-P1363-DISCUSS-request@xxxxxxxxxxxxxxxxx,
or manage subscriptions at http://listserv.ieee.org/cgi-bin/wa
Visit IEEE P1363 on the web at: http://grouper.ieee.org/groups/1363
______________________________________________________________________