A New Low-Complexity Cipher Class for Clone-Resistant Identities

A new large cipher class based on new two variable self-inverse-permutation deploying Golden S-Boxes is presented. The mapping has particular properties, in that it is both self-inverse and uses arithmetic over the ring of integers modulo 2
ⁿ
. The key contribution of such cipher structures is in activating the use of passive hard-core multipliers (Math-Blocks) in modern FPGA devices. Such multipliers are often available for free when not utilized in for the system tasks. Standard ciphers do not usually use multiplications due to their high implementation complexity. The proposed cipher class is reactivating such free multipliers to create good quality ciphers at very low cost. The target application of such ciphers is in creating the so-called Secret Unknown Ciphers (SUCs). Such SUCs can serve as highly-resilient clone-resistant digital-identity-modules in future smart self-reconfiguring non-volatile FPGA devices. The security level of the resulting ciphers is relatively high and scalable. The main future application areas of such structures are expected to be for vehicular security applications. A sample implementation prototype demonstrates the complexity of the resulting physical identity and its performance.