Generalizing the BipBip Algorithm and Evaluating its Components for use in Varying Applications
Advisor(s)
Dr. Firas Hassan
Confirmation
1
Document Type
Poster
Location
ONU McIntosh Center; McIntosh Activities Room
Start Date
21-4-2023 12:00 PM
End Date
21-4-2023 12:50 PM
Abstract
With Cryptographic Capability Computing (C 3 ) quickly becoming a topic of interest and research for leading industry competitors, it is critical that each component used to enable such a system be maximally understood and optimized for different applications. BipBip is a proposed tweakable block cipher with dimensions that ideally cater to the address encryption required for C 3 . Despite its obvious utility, there are components that are unclear, specifications that seem arbitrary, and lacking implementational details that could be helpful. This paper aims to expand upon the principles covered previously, devise general steps to create similar tweakable block ciphers, and to propose a more generalized approach to the encryption of pointers in the C 3 model. To accomplish this, modifications to the implementation will be made and tested on FPGA devices to determine differences in size, speed, and security. The modifications will include changes to the linear functions, substitution boxes, number of rounds, and formulation of the round functions.
While there are restrictions to what changes can be made without severely handicapping the security, the number of approaches is far more broad than indicated in the original specifications in the BipBip paper. As an example, specific values do not need to be used for the permutation layers. Additionally, there is no specific linear layer approach (e.g. binary circulant matrix) that needs to be used, and the substitution box implementation has many constructions that can fit within a given set of constraints. From these factors, it is evident that BipBip is a good starting point, but it has room for improvement and further research.
Recommended Citation
McKanna, Eric, "Generalizing the BipBip Algorithm and Evaluating its Components for use in Varying Applications" (2023). ONU Student Research Colloquium. 42.
https://digitalcommons.onu.edu/student_research_colloquium/2023/posters/42
Open Access
Available to all.
Generalizing the BipBip Algorithm and Evaluating its Components for use in Varying Applications
ONU McIntosh Center; McIntosh Activities Room
With Cryptographic Capability Computing (C 3 ) quickly becoming a topic of interest and research for leading industry competitors, it is critical that each component used to enable such a system be maximally understood and optimized for different applications. BipBip is a proposed tweakable block cipher with dimensions that ideally cater to the address encryption required for C 3 . Despite its obvious utility, there are components that are unclear, specifications that seem arbitrary, and lacking implementational details that could be helpful. This paper aims to expand upon the principles covered previously, devise general steps to create similar tweakable block ciphers, and to propose a more generalized approach to the encryption of pointers in the C 3 model. To accomplish this, modifications to the implementation will be made and tested on FPGA devices to determine differences in size, speed, and security. The modifications will include changes to the linear functions, substitution boxes, number of rounds, and formulation of the round functions.
While there are restrictions to what changes can be made without severely handicapping the security, the number of approaches is far more broad than indicated in the original specifications in the BipBip paper. As an example, specific values do not need to be used for the permutation layers. Additionally, there is no specific linear layer approach (e.g. binary circulant matrix) that needs to be used, and the substitution box implementation has many constructions that can fit within a given set of constraints. From these factors, it is evident that BipBip is a good starting point, but it has room for improvement and further research.