Abstract
This paper presents a hardware-oriented complexity analysis of some of the most popular cryptographic algorithms. A sample algorithm has been chosen from each group in which cryptographic algorithms are usually classified: factorization problem, discrete logarithm problem, stream cipher, block cipher and hybrid systems. The analysis yields measures of the types and number of operations necessary to perform each algorithm providing a comparison among the different classes. Such analysis is particularly oriented toward the encryption of large volumes of data such as the ones found in multimedia applications. Moreover, these results suggest how significant increase in performance can be provided by specific hardware implementations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
