BANK • PEŁNY PODGLĄD

technologia: Post-quantum cryptography

Fakty • wikipedia-seeded

← Bank
candidateneeds-reviewC 90%
Fakt używany przez pipeline
The rumoured existence of widespread harvest now, decrypt later programs has also been seen as a motivation for the early introduction of post-quantum algorithms, as data recorded now may still remain sensitive many years into the future.
Pełniejszy materiał źródłowy / excerpt
Post-quantum cryptography (PQC), sometimes referred to as quantum-proof, quantum-safe, or quantum-resistant, is the development of cryptographic algorithms (usually public-key algorithms) that are currently thought, but not proven, to be secure against a cryptanalytic attack by a quantum computer. Most widely used public-key algorithms rely on the difficulty of one of three mathematical problems: the integer factorization problem, the discrete logarithm problem, or the elliptic-curve discrete logarithm problem. All of these problems could be easily solved on a sufficiently powerful quantum computer running Shor's algorithm or possibly alternatives. As of 2026, quantum computers lack the processing power to break widely used cryptographic algorithms; however, because of the length of time required for migration to quantum-safe cryptography, cryptographers are already designing new algorithms to prepare for Y2Q or "Q-Day", the day when current algorithms will be vulnerable to quantum computing attacks. Mosca's theorem provides the risk analysis framework that helps organizations identify how quickly they need to start migrating. Their work has gained attention from academics and industry through the PQCrypto conference series hosted since 2006, several workshops on Quantum Safe Cryptography hosted by the European Telecommunications Standards Institute (ETSI), and the Institute f…
Kategoria: technologia
Rodzina: kosmos
Jakość źródła: 65/100
Próby weryfikacji: 3
Notatka fact-checku: Fact-check 3.0-content-aware: no sufficient claim-bound corroboration after 3 healthy attempts. Scope=verify the factual claim. Required independent sources=2; stored evidence groups=0. Provider/API errors did not consume attempts. | Fact-check 4.3.2: research wznowiony bez zdejmowania HOLD. Poprzednia metoda: factcheck-300-content-aware. | Fact-check 4.3.2: research wznowiony bez zdejmowania HOLD. Poprzednia metoda: factcheck-weekly-research-432.

ŹRÓDŁA I DOWODY

10 zapisanych źródeł
Wikipedia ENpomocnicze

Evidence: 81 • authority: 72

Post-quantum cryptography (PQC), sometimes referred to as quantum-proof, quantum-safe, or quantum-resistant, is the development of cryptographic algorithms (usually public-key algorithms) that are currently thought, but not proven, to be secure against a cryptanalytic attack by a quantum computer. Most widely used public-key algorithms rely on the difficulty of one of three mathematical problems: the integer factorization problem, the discrete logarithm problem, or the elliptic-curve discrete logarithm problem. All of these problems could be easily solved on a sufficiently powerful quantum computer running Shor's algorithm or possibly alternatives. As of 2026, quantum computers lack the pro…

Otwórz źródło ↗
Europe PMC / Frontiers in health servicespomocniczeniezależne

Evidence: 58 • authority: 92

Post-quantum cryptography for healthcare: securing medical data, connected devices, and digital health infrastructure.. Healthcare systems increasingly depend on interoperable electronic health records, picture archiving and communication systems, cloud analytics, remote monitoring, and connected medical devices. These workflows create a long-lived confidentiality problem: clinical, genomic, pediatric, psychiatric, and family-linked data may remain sensitive for decades, whereas the public-key algorithms that protect current transport and identity systems are vulnerable to future cryptographically relevant quantum computers. Shor's algorithm threatens RSA, finite-field Diffie-Hellman, ellip…

Otwórz źródło ↗
Board of Governors of the Federal Reserve Systempomocniczeniezależne

Evidence: 53 • authority: 88

Otwórz źródło ↗
Elsevier BVpomocniczeniezależne

Evidence: 53 • authority: 88

Otwórz źródło ↗
Elsevier BVpomocniczeniezależne

Evidence: 53 • authority: 88

Otwórz źródło ↗
Wikipedia ENpomocnicze

Evidence: 48 • authority: 72

The Data Encryption Standard (DES ) is a symmetric-key algorithm for the encryption of digital data. Although its short key length of 56 bits makes it too insecure for modern applications, it has been highly influential in the advancement of cryptography. Developed in the early 1970s at IBM and based on an earlier design by Horst Feistel, the algorithm was submitted to the National Bureau of Standards (NBS) following the agency's invitation to propose a candidate for the protection of sensitive, unclassified electronic government and commercial data. In 1976, after consultation with the National Security Agency (NSA), the NBS selected a slightly modified version (strengthened against differ…

Otwórz źródło ↗
Association of Technology and Sciencepomocniczeniezależne

Evidence: 43 • authority: 80

Otwórz źródło ↗
Elsevier BVpomocniczeniezależne

Evidence: 43 • authority: 88

Otwórz źródło ↗
Wikipedia ENpomocnicze

Evidence: 38 • authority: 72

In cryptography, SHA-1 (Secure Hash Algorithm 1) is a hash function which takes an input and produces a 160-bit (20-byte) hash value known as a message digest – typically rendered as 40 hexadecimal digits. It was designed by the United States National Security Agency, and is a U.S. Federal Information Processing Standard. The algorithm has been cryptographically broken but is still widely used. Since 2005, SHA-1 has not been considered secure against well-funded opponents; as of 2010 many organizations have recommended its replacement. NIST formally deprecated use of SHA-1 in 2011 and disallowed its use for digital signatures in 2013, and declared that it should be phased out by 2030. As of…

Otwórz źródło ↗
Europe PMC / Sensors (Basel, Switzerland)pomocniczeniezależne

Evidence: 33 • authority: 92

Machine Learning Enhanced Quantum-Safe Encryption: A Novel Optimisation Framework.. The standardisation of post-quantum cryptography (PQC) by NIST marks a critical transition away from classical public-key schemes towards quantum-resistant successors. As machine learning (ML) applications proliferate, the demand for efficient cryptographic primitives intensifies, requiring implementations that are simultaneously quantum-safe and resource-aware. Recent surveys have investigated the interplay between ML and PQC, with particular focus on ML-assisted parameter optimisation, privacy-preserving ML leveraging lattice-based cryptography, and neural-network implementations of quantum-resistant algor…

Otwórz źródło ↗