| مشخصات مقاله | |
| انتشار | مقاله سال 2018 |
| تعداد صفحات مقاله انگلیسی | 3 صفحه |
| هزینه | دانلود مقاله انگلیسی رایگان میباشد. |
| منتشر شده در | نشریه اسپرینگر |
| نوع مقاله | ISI |
| عنوان انگلیسی مقاله | Editorial: Special issue on recent trends in cryptography |
| ترجمه عنوان مقاله | موضوع ویژه در مورد روند اخیر در رمزنگاری |
| فرمت مقاله انگلیسی | |
| رشته های مرتبط | مهندسی کامپیوتر |
| گرایش های مرتبط | امنیت اطلاعات |
| مجله | رمزنگاری و ارتباطات – Cryptography and Communications |
| دانشگاه | Department of Informatics – University of Bergen – Norway |
| شناسه دیجیتال – doi |
https://doi.org/10.1007/s12095-017-0269-y |
| کد محصول | E8886 |
| وضعیت ترجمه مقاله | ترجمه آماده این مقاله موجود نمیباشد. میتوانید از طریق دکمه پایین سفارش دهید. |
| دانلود رایگان مقاله | دانلود رایگان مقاله انگلیسی |
| سفارش ترجمه این مقاله | سفارش ترجمه این مقاله |
| بخشی از متن مقاله: |
| As our society becomes ever more dependent on digital technologies, cryptography becomes increasingly important to secure data while it is being stored, transferred and processed. In the field of cryptography there is a strong crossfertilization between new applications and innovative research results. The 13 contributions in this special issue of ”Recent Trends on Cryptography” encompass a wide range of recent research; we believe that this collection offers an interesting snapshot of research that is appealing to experts in the field but also to a broader audience. Collectively these papers illustrate the diverse range of issues that are presently being investigated in the field of cryptography.
The paper by Michael Scott “Missing a trick: Karatsuba variations” takes the reader for a tour through different versions of Karatsuba multiplication. This is of considerable interest for efficient implementations of public-key cryptography and in particular for Elliptic Curve Cryptography. The author discusses an interesting variant called “arbitrary-degree” Karatsuba (ADK). In the paper “Backtracking-assisted multiplication”, Houda Ferradi, Remi G ´ eraud, Diana ´ Maimut, David Naccache and Hang Zhou describe a new multiplication algorithm, particularly suited to lightweight microprocessors. This leads to improvements when one of the operands is known in advance. |