The first ideas related to quantum cryptography were

[sujonkumar6300]

Developed in the 1970s, with the most notable being the algorithms of Shor and Grover. However, it was not until the 1980s that the first publications of new protocols were published that based their security on the principles of quantum mechanics —such as uncertainty or superposition— using lasers to emit information in a photon.

When public-key cryptography algorithms begin to be compromised by quantum computing, post-quantum cryptography emerges, which refers to algorithms designed to resist attacks by quantum computers. There are several branches of cryptography that differ in the way they operate, such as: grid-based algorithms, multivariable equation-based algorithms, supersingular south korea email list isogeneic elliptic curve-based algorithms, hash-based algorithms, and code-based algorithms.

From the point of view of the use and performance of this type of algorithms, their execution has been explored in specific-purpose systems in controlled environments, such as: FPGAs, AVRs and ASICs, to name a few, leaving pending an analysis of the behavior and performance in low- and mid-range, limited-resource systems, such as: Raspberry Pi, Beaglebone or Banana Pro with ARM architecture. Hence, the background related to this work exhibits work with post-quantum algorithms that could be divided into: executions on FPGAs devices, in specific-use devices and work on post-quantum algorithms in the ARM architecture, which are based on encryption, digital signatures and key agreements, leaving open the possibility of exploring the hash primitive, focused on the integrity service, as well as its behavior in systems with limited resources.