Abstract
Abstract We review and simplify several classical and quantum maps introduced in recent years that have been used in cryptography. For each of these maps, a bitstream is generated and subjected to the NIST test. Leveraging the advantages of FPGA in the loop, these maps are designed in MATLAB Simulink, converted to HDL using HDL Coder, and implemented on FPGA. Vivado software is used for more precise synthesis of the implementation of these maps. The results of a detailed analysis of classical and new quantum maps are compared with each other, as well as with other implementations of chaotic maps in the literature. Implementations related to five classical maps and two quantum maps, with maximum frequencies 125 MHz, and maximum throughputs of 4 Gbps, are confirmed. The suitability of these maps for implementation, leveraging their greater dynamic complexity and larger key space, is evident.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have