Пропуск в контексте
High-Speed Parity Number Detection Algorithm in RNS Based on Akushsky Core Function

High-Speed Parity Number Detection Algorithm in RNS Based on Akushsky Core Function

The Residue Number System is widely used in cryptography, digital signal processing, image processing systems and other areas where high-performance computation is required. One of the computationally expensive operations in the Residue Number System is the parity detection of a number. This paper p...

תיאור מלא

שמור ב:
מידע ביבליוגרפי
Главные авторы: Lutsenko, V. V., Луценко, В. В., Geryugova, A. E., Герюгова, А. Э., Babenko, M. G., Бабенко, М. Г., Lapina, M. A., Лапина, М. А.
פורמט: Статья
שפה:English
יצא לאור: Springer Science and Business Media Deutschland GmbH 2025
נושאים:
Akushsky core function
Residue number system (RNS)
High performance computing
Non-modular operations
Parity detection
גישה מקוונת:https://dspace.ncfu.ru/handle/123456789/29591
תגים: הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
תיאור
סיכום:The Residue Number System is widely used in cryptography, digital signal processing, image processing systems and other areas where high-performance computation is required. One of the computationally expensive operations in the Residue Number System is the parity detection of a number. This paper presents a high-speed algorithm for parity detection of numbers in Residue Number System based on Akushsky core function. The proposed approach for parity detection reduces the average time by 20.39% compared to the algorithm based on the Chinese Remainder Theorem.

פריטים דומים