TAILIEUCHUNG - Cryptographic Algorithms on Reconfigurable Hardware- P10

Cryptographic Algorithms on Reconfigurable Hardware- P10: This chapter presents a complete outhne for this Book. It explains the main goals pursued, the strategies chosen to achieve those goals, and a summary of the material to be covered throughout this Book. | The Rijndael Algorithm 249 Fig. . Basic Algorithm Flow transformation followed by a main loop where nine iterations called rounds are executed. Each round transformation is composed of a sequence of four transformations ByteSubstitution BS ShiftRows SR MixColumns MC and AddRoundKey ARK . For each round of the main loop a round key is derived from the original key through a process called Key Scheduling. At the last round MC step is skipped and consequently just three transformations namely BS SR and ARK are executed. AES decryption can be performed by using same algorithm flow. However all four steps in the round transformation are replaced with their own inverses and the round keys for encryptions are used in the reverse order. The Round Transformation The round transformation is a sequence of four transformations BS SR MC and ARK. All four transformations contribute in AES strength by inducing confusion and diffusion which are arguably the two most important properties that a strong symmetric cipher must have. Confusion makes the output dependent on the key. Ideally every key bit influences every output bit. Diffusion makes the output dependent on previous input plain ciphertext . Ideally each output bit is influenced by every previous input bit. Roughly speaking those characteristics correspond to cipher s substitution and permutation. Symmetric ciphers need to be complex so they could not be analyzed easily. Also their transformations need to be simple enough to be implemented efficiently in hardware or software. For AES the general criteria for round transformation was inverse function and simplicity besides the step-specific criteria. ByteSubstitution BS It is a non-linear transformation where each input byte of the State matrix is independently replaced by another byte. BS can be seen as a highly non-linear function. There are a great finite number of possible BS functions however some of them are more appropriate than others. In 60 some .

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.