تقرير
A New Lever Function with Adequate Indeterminacy
العنوان: | A New Lever Function with Adequate Indeterminacy |
---|---|
المؤلفون: | Su, Shenghui, Luo, Ping, Lv, Shuwang, Xu, Maozhi |
سنة النشر: | 2021 |
المجموعة: | Computer Science |
مصطلحات موضوعية: | Computer Science - Cryptography and Security, Computer Science - Computational Complexity |
الوصف: | The key transform of the REESSE1+ asymmetrical cryptosystem is Ci = (Ai * W ^ l(i)) ^ d (% M) with l(i) in Omega = {5, 7, ..., 2n + 3} for i = 1, ..., n, where l(i) is called a lever function. In this paper, the authors give a simplified key transform Ci = Ai * W ^ l(i) (% M) with a new lever function l(i) from {1, ..., n} to Omega = {+/-5, +/-6, ..., +/-(n + 4)}, where "+/-" means the selection of the "+" or "-" sign. Discuss the necessity of the new l(i), namely that a simplified private key is insecure if the new l(i) is a constant but not one-to-one function. Further, expound the sufficiency of the new l(i) from four aspects: (1) indeterminacy of the new l(i), (2) insufficient conditions for neutralizing the powers of W and W ^-1 even if Omega = {5, 6, ..., n + 4}, (3) verification by examples, and (4) running times of continued fraction attack and W-parameter intersection attack which are the two most efficient algorithms of the probabilistic polytime attacks so far. Last, the authors detail the relation between a lever function and a random oracle. Comment: 13 pages |
نوع الوثيقة: | Working Paper |
URL الوصول: | http://arxiv.org/abs/2108.13086 |
رقم الأكسشن: | edsarx.2108.13086 |
قاعدة البيانات: | arXiv |
الوصف غير متاح. |