{"id":{"repo_id":"radboud","oai_identifier":"oai:repository.ubn.ru.nl:2066/325156"},"canonical_url":"https://search.dev.ndltd.org/etd/radboud/oai:repository.ubn.ru.nl:2066/325156","repository":{"repo_id":"radboud","name":"Radboud University Nijmegen","base_url":"https://repository.ubn.ru.nl/oai/request"},"display":{"title":"A Race Against Time: How to design and analyze low-latency symmetric cryptographic algorithms","abstract":"Contains fulltext : 325156.pdf (Publisher’s version ) (Open Access)","abstract_html":"Contains fulltext : 325156.pdf (Publisher’s version ) (Open Access)","abstract_has_math":false,"creators":["Belkheyar, Y.K."],"institution":"S.l. : s.n.","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Daemen, J.J.C.","Rasoolzadeh, S."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2025,"date_issued":"2025","date_published":"2025","updated_at":"2026-07-24T04:00:43Z","subjects":["Digital Security"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/2066/325156","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Daemen, J.J.C.","Rasoolzadeh, S."]},{"key":"dc:creator","label":"Author","values":["Belkheyar, Y.K."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2025"]},{"key":"dc:publisher","label":"Institution","values":["S.l. : s.n."]},{"key":"dc:type","label":"Dc Type","values":["Doctoral thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Digital Security"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://repository.ubn.ru.nl//bitstream/handle/2066/325156/325156.pdf","https://hdl.handle.net/2066/325156"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Contains fulltext : 325156.pdf (Publisher’s version ) (Open Access)","In computer science, one important subject is the security of the data we exchange and store. Preserving the confidentiality and authenticity of private information is key to the liberty of speech, democracy, and protecting economic interests. Between attackers and designers, it is a continuous game of breaking and fixing. In some cases, the application requires specific performance to be usable in modern devices. If those performances can not be met by existing security mechanisms, it is often chosen not to put any or to put a weaker version of an existing solution, rather than to slow down the device. One such class of application are low-latency ones. Those cases involve securing communication with a processor or within high-speed memory, such as RAM, where the time available to operate on data is very small. In this thesis, we present several cryptographic algorithms designed for low-latency and explain the challenges faced when designing such algorithms.","Radboud University, 11 november 2025","Promotor : Daemen, J.J.C. Co-promotor : Rasoolzadeh, S.","xii, 244 p."]},{"key":"dc:title","label":"Title","values":["A Race Against Time: How to design and analyze low-latency symmetric cryptographic algorithms"]}]}],"canonical_facts":{"dc:contributor":["Daemen, J.J.C.","Rasoolzadeh, S."],"dc:creator":["Belkheyar, Y.K."],"dc:date":["2025"],"dc:description":["Contains fulltext : 325156.pdf (Publisher’s version ) (Open Access)","In computer science, one important subject is the security of the data we exchange and store. Preserving the confidentiality and authenticity of private information is key to the liberty of speech, democracy, and protecting economic interests. Between attackers and designers, it is a continuous game of breaking and fixing. In some cases, the application requires specific performance to be usable in modern devices. If those performances can not be met by existing security mechanisms, it is often chosen not to put any or to put a weaker version of an existing solution, rather than to slow down the device. One such class of application are low-latency ones. Those cases involve securing communication with a processor or within high-speed memory, such as RAM, where the time available to operate on data is very small. In this thesis, we present several cryptographic algorithms designed for low-latency and explain the challenges faced when designing such algorithms.","Radboud University, 11 november 2025","Promotor : Daemen, J.J.C. Co-promotor : Rasoolzadeh, S.","xii, 244 p."],"dc:identifier":["https://repository.ubn.ru.nl//bitstream/handle/2066/325156/325156.pdf","https://hdl.handle.net/2066/325156"],"dc:publisher":["S.l. : s.n."],"dc:subject":["Digital Security"],"dc:title":["A Race Against Time: How to design and analyze low-latency symmetric cryptographic algorithms"],"dc:type":["Doctoral thesis"]},"updated_at":"2026-07-24T04:00:43Z"}