THE INTERNET IS THINKING

Earlier sources: Cryptography

This security thread follows cryptography through original research, public projects, and source reports. Read the evidence below to see which developments are represented in SYMTRI’s archive.

SYMTRI organizes observations from public sources into a living map. Connections reflect shared subject matter; they do not establish causation or endorse a source.

Open in the map ↗
Share this page ↗

44 classified signals in the fourteen-day window. These counts include signals awaiting readable evidence.

Earlier sources

Up to ten sources with readable evidence, ordered by their feed timestamp. These archive sources can be older than the live fourteen-day window. This list is a sample, not a measure of total activity. Dates distinguish paper publication, repository creation, model/dataset activity, Hacker News posts, and KEV catalog additions. “First archived” records when SYMTRI first stored the signal.

  1. GitHub · Repository created · First archived

    alhanshim/SocketChat ↗

    SocketChat is a tool that allows you to chat with other devices on your LAN. Furthermore, it is supported with an auto-discovery system that discovers other devices running SocketChat in your LAN.

  2. GitHub · Repository created · First archived

    spicy-lemonade/salt ↗

    Salt encrypts your agent's files and database memories before they leave your machine.

  3. arXiv · Published · First archived

    Exponential lower bounds for low-degree strategies in position-based quantum cryptography ↗

    Non-local quantum computation (NLQC) consists on the implementation of a bipartite unitary $U_{AB}$ by two cooperating distant players by means of a two-round protocol with a single intermediate round of simultaneous communication. It is a major open question to know whether there exists a unitary $U_{AB}$ whose implementation in NLQC requires extra quantum systems with dimensions ${\rm exp}(n^{Ω(1)})$, where $n$ is the dimension of systems $A$ and $B$. This type of exponential lower bound is essential for security of position-based quantum cryptography, since the capabilities of the adversari…

  4. Hacker News · Posted on Hacker News · First archived

    Defeating Satellite Spoofing with Galileo's Encryption ↗

    Hacker News discussion.

  5. GitHub · Repository created · First archived

    Alpha-Park/genpark-kzg-polynomial-commitment-trusted-setup-skill ↗

    Kate-Zaverucha-Goldberg (KZG) polynomial commitment evaluator with evaluation proofs

  6. arXiv · Published · First archived

    Zero Knowledge Proofs in Quantum Networks ↗

    Zero-knowledge proofs (ZKPs) enable the verification of a statement without revealing any information beyond its validity and constitute a fundamental primitive in cryptography and information theory. However, existing constructions rely on computational assumptions and are predominantly confined to bipartite settings, leaving their information-theoretic realization in bipartite or network scenarios largely unexplored. Here we develop a framework for zero-knowledge verification based on the indistinguishability of quantum states under operational constraints. Exploiting the fundamental limitat…

  7. GitHub · Repository created · First archived

    alphaparkinc/genpark-kzg-polynomial-commitment-trusted-setup-skill ↗

    Kate-Zaverucha-Goldberg (KZG) polynomial commitment evaluator with evaluation proofs

  8. GitHub · Repository created · First archived

    Alpha-Park/genpark-plonk-permutation-argument-grand-product-skill ↗

    Plonk grand product copy-constraint permutation argument tracking wire routing equality

  9. GitHub · Repository created · First archived

    alphaparkinc/genpark-plonk-permutation-argument-grand-product-skill ↗

    Plonk grand product copy-constraint permutation argument tracking wire routing equality

  10. GitHub · Repository created · First archived

    Alpha-Park/genpark-qap-quadratic-arithmetic-program-groth16-skill ↗

    Quadratic Arithmetic Program (QAP) reduction transforming R1CS constraints into polynomial divisibility statements

Live window recorded . This is the ingestion observation time, not the publication or discovery date of each source.

How to assess evidence about Cryptography

Check each original source for its methods, release status, limitations, and supporting data. A repository announcement, a preprint, and a published study provide different kinds of evidence. SYMTRI’s subject classification helps discovery; it does not independently validate the source’s claims.

See the collection and counting methodology ↗ · Read the weekly synthesis ↗

Related threads

Explore related regions

These navigation suggestions are part of the map’s editorial structure, rather than measured evidence of a connection.