Computational Cryptography from Pseudoentanglement
Researchers show efficient pseudoentanglement implies EFI pairs, tying it to minimal quantum-crypto assumptions.
2 stories, newest first · one card per story
Researchers show efficient pseudoentanglement implies EFI pairs, tying it to minimal quantum-crypto assumptions.
Theorists build a classical oracle where one-way puzzles fail yet EFI pairs survive, separating two candidate minimal assumptions of quantum cryptography.
Today 1.6K readers · 2.5K views · 778 reads · all time 189K views