137
Views
14
CrossRef citations to date
0
Altmetric
Original Articles

Compact SD: a new encoding algorithm and its application in multiplication

&
Pages 554-569 | Received 09 Jan 2015, Accepted 13 Oct 2015, Published online: 01 Feb 2016

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (1)

Moushumi Barman & Hridoy Jyoti Mahanta. (2019) A randomised scheme for secured modular exponentiation against power analysis attacks. Cyber-Physical Systems 5:4, pages 209-230.
Read now

Articles from other publishers (13)

Hazem M. Bahig & Khaled A. Fathy. (2023) Sequential and parallel sliding window algorithms for multiplying large integers. Journal of King Saud University - Computer and Information Sciences 35:3, pages 131-140.
Crossref
Doru Florin Chiper, Arcadie Cracan & Vasilica-Daniela Andries. (2022) An Overview of Systolic Arrays for Forward and Inverse Discrete Sine Transforms and Their Exploitation in View of an Improved Approach. Electronics 11:15, pages 2416.
Crossref
Bikash Debnath, Jadav Chandra Das & Debashis De. (2021) Cryptographic models of nanocommunicaton network using quantum dot cellular automata: A survey. IET Quantum Communication 2:3, pages 98-121.
Crossref
Sakshi Devi, Rita Mahajan & Deepak Bagai. (2021) A low complexity bit parallel polynomial basis systolic multiplier for general irreducible polynomials and trinomials. Microelectronics Journal 115, pages 105163.
Crossref
Asma Chaouch, Laurent-Stéphane Didier, Fangan Yssouf Dosso, Nadia El Mrabet, Belgacem Bouallegue & Bouraoui Ouni. (2021) Two hardware implementations for modular multiplication in the AMNS: Sequential and semi-parallel. Journal of Information Security and Applications 58, pages 102770.
Crossref
Jing Tian, Jun Lin & Zhongfeng Wang. (2021) Fast Modular Multipliers for Supersingular Isogeny-Based Post-Quantum Cryptography. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 29:2, pages 359-371.
Crossref
H. M. Bahig, A. Alghadhban, M. A. Mahdi, K. A. Alutaibi & H. M. Bahig. (2020) Speeding up the Multiplication Algorithm for Large Integers. Engineering, Technology & Applied Science Research 10:6, pages 6533-6541.
Crossref
Che-Wei Tung & Shih-Hsu Huang. (2020) A High-Performance Multiply-Accumulate Unit by Integrating Additions and Accumulations Into Partial Product Reduction Process. IEEE Access 8, pages 87367-87377.
Crossref
Jinnan Ding & Shuguo Li. (2019) A low-latency and low-cost Montgomery modular multiplier based on NLP multiplication. IEEE Transactions on Circuits and Systems II: Express Briefs, pages 1-1.
Crossref
Morteza Nazeri, Abdalhossein Rezai & Huzain Azis. (2018) An Efficient Architecture for Golay Code Encoder. An Efficient Architecture for Golay Code Encoder.
Wangchen DAI, Donald Donglong CHEN, Ray Cheung & Cetin Kaya Koc. (2018) FFT-based McLaughlin's Montgomery Exponentiation without Conditional Selections. IEEE Transactions on Computers, pages 1-1.
Crossref
Manizhe Abbasi, Abdalhossein Rezai & Asghar Karimi. (2017) A novel approach for improving the modular exponentiation performance. A novel approach for improving the modular exponentiation performance.
K. K. Viswanathan, Z. A. Aziz, Saira Javed, Shaharuddin Salleh, Siti Aisyah Binti Tumiran & Bellie Sivakumar. (2016) Free Vibration of Cross-Ply Laminated Plates with Variable Thickness Based on Shear Deformation Theory. International Journal of Computational Methods 13:03, pages 1650016.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.