{'fraction_non_alphanumeric': 0.016184971098265895, 'fraction_numerical': 0.0, 'mean_word_length': 5.4148148148148145, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Quantum-classical Hybrid Architecture for Security Algorithms Acceleration

Since the discovery of Shor's algorithm, the anxiety about quantum computation has increased. A large amount of research has been conducted to discover new algorithms and to build a quantum computer. But it seems that a general purpose quantum computer is far from being achieved. Meanwhile, cryptographers around the world started to look for security algorithms that resist to quantum attacks, but these still need improvement to achieve practical execution time. This work proposes a quantum-classical hybrid architecture, focusing on photonic quantum computers. A small quantum coprocessor implementing the Grover search algorithm is used to perform the search for roots of polynomials in Fpq. This coprocessor is used to accelerate the decoding process of the McEliece cryptosystem.