{"id":{"repo_id":"gmu","oai_identifier":"oai:MARS:1920/10080"},"canonical_url":"https://search.dev.ndltd.org/etd/gmu/oai:MARS:1920/10080","repository":{"repo_id":"gmu","name":"George Mason University","base_url":"https://mars.gmu.edu/server/oai/request"},"display":{"title":"Lightweight Authenticated Encryption for FPGAs","abstract":"Traditionally, authenticated encryption was achieved by using two seperate algorithms for encryption and authentication. Recently, modes that combine encryption and authentication together are being proposed. This feature is especially beneficial in case of hardware implementations, as it allows for a substantial decrease in the circuit area and power compared to traditional schemes. In this thesis, we first characterize candidates of the Competition for Authenticated Encryption: Security, Applicability, and Robustness (CAESAR). Then we discuss light-weight candidates from the round 1 submissions namely ACORN, SILC (SImple Lightweight CFB) and Joltik. We first implement the full width designs of these candidates targeting Xilinx Spartan-6 and Artix-7 FPGAs. Later, we optimize these designs for low-area applications. Lastly, we compare the results of the implementations with other published results.","abstract_html":"Traditionally, authenticated encryption was achieved by using two seperate algorithms for encryption and authentication. Recently, modes that combine encryption and authentication together are being proposed. This feature is especially beneficial in case of hardware implementations, as it allows for a substantial decrease in the circuit area and power compared to traditional schemes. In this thesis, we first characterize candidates of the Competition for Authenticated Encryption: Security, Applicability, and Robustness (CAESAR). Then we discuss light-weight candidates from the round 1 submissions namely ACORN, SILC (SImple Lightweight CFB) and Joltik. We first implement the full width designs of these candidates targeting Xilinx Spartan-6 and Artix-7 FPGAs. Later, we optimize these designs for low-area applications. Lastly, we compare the results of the implementations with other published results.","abstract_has_math":false,"creators":["Mamidi, Upendarreddy"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016-03-04","date_published":"2016-03-04","updated_at":"2026-07-27T19:51:50Z","subjects":["Authenticated encryption","CEASAR","Tag","Ciphertex","Authentication"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["hdl:1920/10080"],"render_values":[{"text":"hdl:1920/10080","href":null,"code":true}]}]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null},"metadata_groups":[{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.issued","label":"Date","values":["2016-03-04"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Authenticated encryption","CEASAR","Tag","Ciphertex","Authentication"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["hdl:1920/10080"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.other","label":"Dc Description Other","values":["Traditionally, authenticated encryption was achieved by using two seperate algorithms for encryption and authentication. Recently, modes that combine encryption and authentication together are being proposed. This feature is especially beneficial in case of hardware implementations, as it allows for a substantial decrease in the circuit area and power compared to traditional schemes. In this thesis, we first characterize candidates of the Competition for Authenticated Encryption: Security, Applicability, and Robustness (CAESAR). Then we discuss light-weight candidates from the round 1 submissions namely ACORN, SILC (SImple Lightweight CFB) and Joltik. We first implement the full width designs of these candidates targeting Xilinx Spartan-6 and Artix-7 FPGAs. Later, we optimize these designs for low-area applications. Lastly, we compare the results of the implementations with other published results."]},{"key":"dc:title","label":"Title","values":["Lightweight Authenticated Encryption for FPGAs"]}]}],"canonical_facts":{"dc:date.issued":["2016-03-04"],"dc:description.other":["Traditionally, authenticated encryption was achieved by using two seperate algorithms for encryption and authentication. Recently, modes that combine encryption and authentication together are being proposed. This feature is especially beneficial in case of hardware implementations, as it allows for a substantial decrease in the circuit area and power compared to traditional schemes. In this thesis, we first characterize candidates of the Competition for Authenticated Encryption: Security, Applicability, and Robustness (CAESAR). Then we discuss light-weight candidates from the round 1 submissions namely ACORN, SILC (SImple Lightweight CFB) and Joltik. We first implement the full width designs of these candidates targeting Xilinx Spartan-6 and Artix-7 FPGAs. Later, we optimize these designs for low-area applications. Lastly, we compare the results of the implementations with other published results."],"dc:identifier":["hdl:1920/10080"],"dc:subject":["Authenticated encryption","CEASAR","Tag","Ciphertex","Authentication"],"dc:title":["Lightweight Authenticated Encryption for FPGAs"],"dc:type":["Thesis"]},"updated_at":"2026-07-27T19:51:50Z"}