top of page

Créer des instants

Vers la découverte

2_edited.png
2_edited.png
tools-car key.png
tools-wireless earpiece.png
tools-wireless mouse.png
Lock blue_edited.png
2_edited.png
2_edited.png
2_edited.png

Travail récent

73.png

"Construire un chiffrement résistant quantique"

- Problème de recherche

85.png
95 (1).png
w1.png
91.png
80.png
95 (2).png
95.png

Calendrier

  • 1930s - Gödel’s Incompleteness Theorem
    Our research problem begins with Gödel’s Incompleteness Theorem that states: “In any reasonable mathematical system there will always be true statements that cannot be proved”
  • mid 1930s - Halting Problem
    The halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running, or continue to run forever. Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist. The halting problem is the first proven example of an undecidable problem.
  • 2020s - Research Progress
    “Building Quantum Resistant Encryption” The above question is the problem statement at the core of our recent research. By researching the progress of the problem, theorems developed earlier and the concept of undecidability we have developed our own patented encryption as a proposed method to solve the problem. Latest News

Valeur technologique

Untitled_Artwork (7).png

- Loi sur la préparation à la cybersécurité de l'informatique quantique 2021-2022

« La cryptographie est essentielle pour . . . fonctionnement de l'économie »

bottom of page