You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
We intend to propose in the next weeks/months a draft of Quantum Security operations that could possibily become the NeoQS (mentioned in white paper).
NeoQS envisioned a cryptographic system based on Lattice problems. In particular, in the White Paper, a mechanism based on Shortest Vector Problem (SVP) and Closest Vector Problem (CVP) were considered.
State-of-the-art studies and reports points out that this family of problems can really generate Hard problems in worst case situation, even for average instances. On the other hand, slightly different mechanisms are being proposed, such as Learning with Errors (LWE) and its variant of Ring Learning with Errors (R-LWE).
These problems depend on the assumption of these NP-Hard problems keep hard, which is highly believed on the assumption that P != NP. Anyway, new cryptographic schemes may always be considered with care, as they can include other issues, so we will continue following the analysis of recent NIST reports, and propose a solution that could use hybrid cryptography (ECDSA + Quantum), which is safer for a transition involving classic and quantum computers.
Transaction price can be an issue, since signatures tend to be much bigger, but this is an issue that we can discuss in more details with the community for the future.
The text was updated successfully, but these errors were encountered:
We intend to propose in the next weeks/months a draft of Quantum Security operations that could possibily become the NeoQS (mentioned in white paper).
NeoQS envisioned a cryptographic system based on Lattice problems. In particular, in the White Paper, a mechanism based on Shortest Vector Problem (SVP) and Closest Vector Problem (CVP) were considered.
State-of-the-art studies and reports points out that this family of problems can really generate Hard problems in worst case situation, even for average instances. On the other hand, slightly different mechanisms are being proposed, such as Learning with Errors (LWE) and its variant of Ring Learning with Errors (R-LWE).
These problems depend on the assumption of these NP-Hard problems keep hard, which is highly believed on the assumption that P != NP. Anyway, new cryptographic schemes may always be considered with care, as they can include other issues, so we will continue following the analysis of recent NIST reports, and propose a solution that could use hybrid cryptography (ECDSA + Quantum), which is safer for a transition involving classic and quantum computers.
Transaction price can be an issue, since signatures tend to be much bigger, but this is an issue that we can discuss in more details with the community for the future.
The text was updated successfully, but these errors were encountered: