{"published":"2007-03-03 22:41:17","title":" \u683c\u5b50\u306e\u8a71","blog_url":"https://186.hatenablog.com/","provider_url":"https://hatena.blog","width":"100%","blog_title":"186 @ hatenablog","author_name":"smoking186","image_url":null,"version":"1.0","description":"1\u6642\u959350\u5206\u307b\u3069\u683c\u5b50\u3068\u30cf\u30c3\u30b7\u30e5\u95a2\u6570 (\u6b63\u78ba\u306b\u306f\u4e2d\u3067\u4f7f\u308f\u308c\u308b\u5727\u7e2e\u95a2\u6570) \u306e\u8a71\u3092\u3057\u3066\u304d\u305f. \u88dc\u8db3 NIST 2nd Hash Function Workshop\u306b\u51fa\u3066\u308b\u306e\u306f, K. Bentahar, D. Page, M-J. O. Saarinen, J. H. Silverman, N. Smart. \"LASH.\" V. Lyubashevsky, D. Micciancio, C. Peikert, A. Rosen. \"Provably Secure FFT Hashing.\" \u306e\u4e8c\u3064. LASH\u306f\u3042\u3093\u307e\u308a\u5fdc\u63f4\u3057\u3066\u3044\u306a\u3044. \u3068\u3053\u308d\u3069\u3053\u308d\u5618\u304c\u66f8\u3044\u3066\u3042\u308b\u70b9\u3068\u683c\u5b50\u30d9\u30fc\u30b9\u306e\u30cf\u30c3\u30b7\u30e5\u95a2\u6570\u306e\u6700\u65b0\u306e\u2026","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2F186.hatenablog.com%2Fentry%2F20070303%2F1173015677\" title=\" \u683c\u5b50\u306e\u8a71 - 186 @ hatenablog\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_name":"Hatena Blog","categories":["crypt"],"author_url":"https://blog.hatena.ne.jp/smoking186/","type":"rich","height":"190","url":"https://186.hatenablog.com/entry/20070303/1173015677"}