# Cryptanalysis of operad-based cryptography

DevFeed: [Cryptanalysis of operad-based cryptography](<https://devfeed.tech/articles/cryptanalysis-of-operad-based-cryptography-126919.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.10134>)

Author: Ambrogio Maria Bernardelli

Published: 2026-11-10T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>)

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>)

Tags: [attacks](<https://devfeed.tech/tags/attacks.md>), [authentication](<https://devfeed.tech/tags/authentication.md>), [cryptanalysis](<https://devfeed.tech/tags/cryptanalysis.md>), [cryptography](<https://devfeed.tech/tags/cryptography.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [encryption](<https://devfeed.tech/tags/encryption.md>), [masking](<https://devfeed.tech/tags/masking.md>), [protocols](<https://devfeed.tech/tags/protocols.md>), [public-key](<https://devfeed.tech/tags/public-key.md>), [time](<https://devfeed.tech/tags/time.md>)

## AI overview

The paper reports that key agreement, key exchange, and encryption on the proposed commutative-operad platforms reduce to interpolation or division problems over the centralizer of the public operations. The attacks need not recover secrets and are independent of the secret-drawing set; for the listed platforms, the problems are solvable in polynomial time under the paper's specified input models, and masking does not prevent them. Authentication also fails: the original protocol does not bind the prover to a public key, while its expected response can be computed from public data even with key registration. In the masked variant, one observed session enables forgery on the concrete string platforms when a challenge entry is invertible. The authors report implementations verified on random instances and note an auxiliary construction satisfies its algebra axioms only in a degenerate case, though its protocol remains correct.

## Source excerpt

arXiv:2611.10134v1 Announce Type: new Abstract: Commutative operads have been proposed as a platform for public-key cryptography, with protocols for key agreement, key exchange, encryption and authentication, together with a masking technique and families of algebras with secret parameters intended to strengthen them. We show that breaking key agreement, key exchange and encryption reduces to two problems over the centralizer of the public operations: an interpolation problem for key agreement and a division problem for the other two. Neither problem requires recovering a secret, and the set from which secrets are drawn plays no role in these attacks. For the operad platforms in the two original papers (fields, the integers, residue rings, the tropical semiring with finite entries, convexors and the masked tropical algebras), the relevant problems can be solved in polynomial time in the input models specified here, and masking does not affect these attacks. The authentication protocol fails for a more elementary reason: as originally stated it does not bind the prover to any public key, and even with a registered public key the response expected by the verifier can be computed from public data. In the masked variant, verification requires the secret mask; on the concrete string platforms, one observed session with an invertible challenge entry suffices for forgery. We also observe that one of the auxiliary constructions satisfies the algebra axioms only in a degenerate case, although the corresponding protocol remains correct. The attacks are implemented and verified on random instances of representative platforms.