Development of Algorithms for Accelerated Computation of Elements of Recurrent Sequences for Cryptographic Purposes
It has been presented algorithms for fast computation of elements of recurrent Vk sequences for positive and negative values of the n index of this sequence. For each of these values, it was considered two possible algorithm variants — based both on the binary method, and on the method of decomposin...
Saved in:
| Date: | 2013 |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | Ukrainian |
| Published: |
Інститут проблем реєстрації інформації НАН України
2013
|
| Subjects: | |
| Online Access: | http://drsp.ipri.kiev.ua/article/view/103361 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Data Recording, Storage & Processing |
Institution
Data Recording, Storage & Processing| Summary: | It has been presented algorithms for fast computation of elements of recurrent Vk sequences for positive and negative values of the n index of this sequence. For each of these values, it was considered two possible algorithm variants — based both on the binary method, and on the method of decomposing the sequence element index. It has been obtained some complexity evaluations of the presented algorithms showing that the complexity of the Vk sequence computing under the module is approximately at the same level as the corresponding exponentiation, which enables efficient use of recurrent Vk and Uk sequences for various cryptographic purposes. Refs: 8 titles. |
|---|