کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4952427 | 1442031 | 2016 | 22 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A provably secure non-iterative hash function resisting birthday attack
ترجمه فارسی عنوان
یک تابع هش تکراری قابل اعتماد غیر تکراری با حمله روز تولد
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
عملکرد هش، الگوریتم فشرده سازی، ساختار غیر تکراری، امنیت قابل اطمینان، حمله تاریخی، حمله متقابل درسطح،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
چکیده انگلیسی
To examine the integrity and authenticity of an IP address efficiently and economically, this paper proposes a new non-iterative hash function called JUNA that is based on a multivariate permutation problem and an anomalous subset product problem to which no subexponential time solutions are found so far. JUNA includes an initialization algorithm and a compression algorithm, and converts a short message of n bits which is regarded as only one block into a digest of m bits, where 80â¤mâ¤232 and 80â¤mâ¤nâ¤4096. The analysis and proof show that the new hash is one-way, weakly collision-free, and strongly collision-free, and its security against existent attacks such as birthday attack and meet-in-the-middle attack is to O(2m). Moreover, a detailed proof that the new hash function is resistant to the birthday attack is given. Compared with the Chaum-Heijst-Pfitzmann hash based on a discrete logarithm problem, the new hash is lightweight, and thus it opens a door to convenience for utilization of lightweight digital signing schemes.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 654, 22 November 2016, Pages 128-142
Journal: Theoretical Computer Science - Volume 654, 22 November 2016, Pages 128-142
نویسندگان
Shenghui Su, Tao Xie, Shuwang Lü,