Ludovic Perret

A caribbean directory-based encryption during the american war of independence

By Gaspard Damoiseau-Malraux, Olivier Chaline, Paul Mekhail, Ludovic Perret, Cecile Pierrot

2025-06-01

In 8th international conference on historical cryptology, HistoCrypt 2025, poznań, poland, june 16-18, 2025

Abstract

The corpus of letters we are studying is located at the Archives Nationales d’Outre-Mer in Aix-en-Provence, France. These late 18th-century letters come from Saint Domingue (now Haiti), a French colony in the Caribbean Sea of which Bellecombe, the author, was governor. They were written in the context of the American War of Independence, in which France took part on the side of the Americans. We have reconstructed Bellecombe’s correspondence with the Secretary of State for the Navy, in Versailles: the archives contain hundreds of letters in clear and three encrypted letters, including some clear/cipher pages that were our lever for reconstructing part of the key, and 96% of the encrypted letter that was opaque at first. From a cryptanalytical point of view, Bellecombe used a directory-based encryption. The common use of this type of cipher in the 17th and 18th-century European countries raises the question of the method to be used (then as now!) to decode such messages.

Continue reading

Investigation of metabelian platform groups for protocols based on (simultaneous) conjugacy search problem

Abstract

here are many group-based cryptosystems in which the security is related to the conjugacy search problem or the simultaneous conjugacy search problem in their underlying platform groups. In this article, we show that some metabelian groups do not provide strong security for these cryptosystems and so they cannot be chosen as platform groups..

Continue reading

Security analysis of ZKPoK based on MQ problem in the multi-instance setting

By Delaram Kahrobaei, Ludovic Perret, Martina Vigorito

2025-04-15

In Journal of Mathematical Cryptology

Abstract

Bidoux and Gaborit introduced a new general technique to improve zero-knowledge (ZK) proof-of-knowledge (PoK) schemes for a large set of well-known post-quantum hard computational problems such as the syndrome decoding, the permuted kernel, the rank syndrome decoding, and the multivariate quadratic (MQ) problems. In particular, the authors’ idea in the study of Bidoux and Gaborit was to use the structure of these problems in the multi-instance setting to minimize the communication complexity of the resulting ZK PoK schemes. The security of the new schemes is then related to new hard problems. In this article, we focus on the new multivariate-based ZKPoK and the corresponding new underlying problem: the so-called DiffMQ.

Continue reading