Efficient Big Integer Multiplication and Squaring Algorithms for Cryptographic Applications
Public-key cryptosystems are broadly employed to provide security for digital information. Improving the efficiency of public-key cryptosystem through speeding up calculation and using fewer resources are among the main goals of cryptography research. In this paper, we introduce new symbols extracte...
Saved in:
| Main Authors: | Shahram Jahani, Azman Samsudin, Kumbakonam Govindarajan Subramanian |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2014/107109 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Factorization of big integer and the security of RSA
by: Yan-bing REN
Published: (2017-05-01) -
Analyzing cryptographic algorithm efficiency with in graph-based encryption models
by: Yashmin Banu, et al.
Published: (2025-07-01) -
DNA-Inspired Lightweight Cryptographic Algorithm for Secure and Efficient Image Encryption
by: Mahmoud A. Abdelaal, et al.
Published: (2025-04-01) -
Embedding of national cryptographic algorithm in Hyperledger Fabric
by: Qi CAO, et al.
Published: (2021-02-01) -
Blind mask template attacks on masked cryptographic algorithm
by: Yi WANG, et al.
Published: (2019-01-01)