On the security of the Courtois-Finiasz-Sendrier signature (open access)

On the security of the Courtois-Finiasz-Sendrier signature

This article proves that a variant of the Courtois-Finiasz-Sendrier signature is strongly existentially unforgeable under chosen message attack in the random oracle model, assuming hardness of the Permuted Goppa Syndrome Decoding Problem (also known as the Niederreiter problem).
Date: March 20, 2018
Creator: Morozov, Kirill; Roy, Partha Sarathi; Steinwandt, Rainer & Xu, Rui
System: The UNT Digital Library