All Topics
All Topics
Technology
Technology
AI
AI
Business
Business
Entertainment
Entertainment
News
News
Programming
Programming
Science
Science
Design
Design
Environment
Environment
Finance
Finance
Crypto
Crypto
Politics
Politics
Sports
Sports
Education
Education
Gaming
Gaming
Art
Art
Music
Music
Health
Health
Security
Security
Books
Books
Food
Food
Travel
Travel
Personal
Personal
Bluesky
Twitter

Undecidable Encryption

By

Marin Ivezic

13d agoen

Source

PostQuantumUndecidable Encryptionpostquantum.com
Snippet from the RSS feed
Hilbert's tenth problem is genuinely undecidable. That fact has been used to sell "unbreakable" ciphers for three decades, and the ciphers keep falling — because undecidability is the wrong kind of hardness for cryptography. The post Undecidable Encryption appeared first on PostQuantum - Quantum Computing, Quantum Security, PQC .

You might also wanna read

Mathematicians Use Gödel's Incompleteness Theorems to Develop New Cryptographic Tool

This article explores the intersection of mathematical unknowability (inspired by Gödel's incompleteness theorems) and modern cryptography.

quantamagazine.org·1mo ago

New Quantum Algorithm Accelerates Timeline for Breaking Current Encryption Standards

Researchers at the Advanced Quantum Technologies Institute have developed a new quantum algorithm called JVG that dramatically accelerates t

briefglance.com·4mo ago

Quantum Computing Research Advances Threaten to Break Current Encryption Standards Sooner Than Expected

This article examines the growing threat that quantum computing poses to Elliptic-Curve Cryptography (ECC), the mathematical foundation secu

akmaier.substack.com·28d ago

Singaporean brothers use unsolvable Diophantine equations to build quantum-resistant encryption

Singaporean brothers Lim Meng Liang and Lim Meng Huai are using unsolvable Diophantine equations to develop next-generation, quantum-resista

straitstimes.com·16d ago

Reverse Mathematics Reveals Why Certain Computational Problems Are Inherently Hard

The article explores how researchers are using 'reverse mathematics' to understand why certain computational problems are inherently difficu

quantamagazine.org·7mo ago

NIST scientist uses Gödel's incompleteness theorems to prove AI systems cannot be made fully secure

A NIST senior scientist, Apostol Vassilev, has published a peer-reviewed paper in IEEE Security and Privacy using Gödel's incompleteness the

nist.gov·25d ago

Comments

Sign in to join the conversation.

No comments yet. Be the first.