TAILIEUCHUNG - A Hardware implementation of Winograd Fourier Transform algorithm for Cryptography

This paper presents a hardware implementation of efficient algorithms that uses the mathematical framework. The framework based on the Winograd’s Fourier Transform Algorithm, obtaining a set of formulations that simplify cyclic convolution (CC) computations and CRT. | A Hardware implementation of Winograd Fourier Transform algorithm for Cryptography and bagan 1 Assistant Professor Department of Electronics and Communication Engineering Sri Venkateswara College of Engineering Sriperumbudur -602108. 2Professor Department of Electronics Madras Institute of Technology Anna University Chrompet Campus Chennai-600044 Tamil Nadu. INDIA sathish@ kbb@ ABSTRACT This paper presents a hardware implementation of efficient algorithms that uses the mathematical framework. The framework based on the Winograd s Fourier Transform Algorithm obtaining a set of formulations that simplify cyclic convolution CC computations and CRT. In particularly this work focuses on the arithmetic complexity of a multiplication and when there is multiplication then the product represents a CC computational operation The proposed algorithms is compared against existing algorithms developed making use of the FFT and it is shown that the proposed algorithms exhibit an advantage in computational efficiency .This design is most useful when dealing with large integers and is required by many modern cryptographic systems. The Winograd Fourier Transform Algorithm WFTA is a technique that combines the Rader s index mapping and Winograd s short convolution modules for prime-factors into a composite-N Fourier Transform structure with fewer multipliers O N . While theoretically interesting WFTA s are very complicated and different for every length. It can be implemented on modern processors with few hardware multipliers and hence is very useful in practice today. Keywords Discrete Fourier Transform Chinese Remainder Theorem. INTRODUCTION Many popular crypto-systems like the RSA encryption scheme 12 the Diffie-Hellman DH key agreement scheme 13 or the Digital Signature Algorithm DSA 14 are based on long integer modular exponentiation A major difference between the RSA scheme and cryptosystems based on the discrete logarithm

TỪ KHÓA LIÊN QUAN
TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.