Progress in Cryptology - INDOCRYPT 2004

DOI10.1007/b104579zbMath1113.94313OpenAlexW2475752160WikidataQ27991510 ScholiaQ27991510MaRDI QIDQ5712194

Ludovic Perret, Françoise Levy-dit-Vehel

Publication date: 22 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b104579

zbMATH Keywords

Word ProblemThue SystemsFinitely Presented GroupsFree Partially Commutative MonoidsHomomorphic MappingsPublic Key Cryptanalysis

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Pitfalls in public key cryptosystems based on free partially commutative monoids and groups ⋮ Involutive method for computing Gröbner bases over \(\mathbb F_2\)

This page was built for publication: Progress in Cryptology - INDOCRYPT 2004