Implementation Efficiency and Alternations, on CAESAR Finalists: AEGIS Approach
Maria Katsaiti, Nicolas Sklavos · 2018
Cryptography and security are of vital significance, as digital life increasingly aligns with modern human routine. It is without doubt that cryptographic algorithms need to be accompanied by synchronous, real - time response systems; plus, they often demand augmented computational power. CAESAR, the latest cryptographic competition, aims to the appearance of innovative ciphers, reaching another milestone in the history of cryptography. On March 5, 2018, seven candidates were announced for the final round, and compete for their selection in the final portfolio. Often, when designers compose a block cipher, sacrifices are made in terms of speed or area usage, to achieve the principal goal. Although, researchers suggest ways to optimize performance of a cipher, using certain proven techniques, even when these sacrifices occur. The target of this work is divided into two main sections; the first one is a comparative analysis among all ciphers of CAESAR final round, in aspects of their performance. The second section, concerns ways of improving this performance through two examined approaches. All mentioned methodologies will be revised and analyzed, along with a detailed comparison of the CAESAR selected cipher, AEGIS. AEGIS cipher is introduced, in order to considerate these results, by serving the role of a detailed analysis and study; the improvement noted for the first architecture is in terms of covered area, whereas for the second approach AEGIS achieves an incredibly improved throughput.