[FOM] Provable security and foundations of mathematics

[José Manuel Rodríguez Caballero]

Dear FOM members,
  There are several positions concerning whether the foundations of
mathematics are enough in order to develop a branch of cryptography known
as provable security. One of the most controversial papers in this debate
is the following one:

Koblitz, Neal. The uneasy relationship between mathematics and
cryptography. *Notices of the AMS* 54.8 (2007): 972-979.
https://www.ams.org/notices/200708/tx070800972p.pdf

 Several important cryptographers energetically
criticized Koblitz' position in letters to the editor:

*Notices Amer. Math. Soc.*, *54* (12): 1454–1455, 2007
http://www.ams.org/notices/200711/tx071101454p.pdf
*Notices Amer. Math. Soc.*, *55* (1): 6–7, 2008
http://www.ams.org/notices/200801/tx080100006p.pdf

  It would be interesting to read several opinions from the FOM members
concerning whether or not provable security can be reduced to foundations
of mathematics.

Kind Regards,
Jose M.

--

Jose Manuel Rodriguez Caballero

arvutiteaduse instituut / Institute of Computer Science
Tartu Ülikool / University of Tartu

https://www.pc.ut.ee/en/jose-manuel-rodriguez-caballero
-------------- next part --------------
An HTML attachment was scrubbed...
URL: </pipermail/fom/attachments/20190610/9974284d/attachment.html>