On the security of the Courtois-Finiasz-Sendrier signature

PDF Version Also Available for Download.

Description

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).

Physical Description

7 p.

Creation Information

Morozov, Kirill; Roy, Partha Sarathi; Steinwandt, Rainer & Xu, Rui March 20, 2018.

Context

This article is part of the collection entitled: UNT Scholarly Works and was provided by UNT College of Engineering to Digital Library, a digital repository hosted by the UNT Libraries. More information about this article can be viewed below.

Who

People and organizations associated with either the creation of this article or its content.

Authors

Publisher

Provided By

UNT College of Engineering

The UNT College of Engineering strives to educate and train engineers and technologists who have the vision to recognize and solve the problems of society. The college comprises six degree-granting departments of instruction and research.

Contact Us

What

Descriptive information to help identify this article. Follow the links below to find similar items on the Digital Library.

Degree Information

Description

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).

Physical Description

7 p.

Notes

Abstract: We prove 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). In addition, we explicitly show that
security against key substitution attacks can be arranged by a standard technique of Menezes and Smart,
hashing the public key.

Source

  • Open Math, 2018. Berlin, Germany: Walter de Gruyter

Language

Item Type

Identifier

Unique identifying numbers for this article in the Digital Library or other systems.

Publication Information

  • Publication Title: Open Math
  • Volume: 16
  • Issue: 1
  • Pages: 161-167
  • Peer Reviewed: Yes

Collections

This article is part of the following collection of related materials.

UNT Scholarly Works

Materials from the UNT community's research, creative, and scholarly activities and UNT's Open Access Repository. Access to some items in this collection may be restricted.

What responsibilities do I have when using this article?

When

Dates and time periods associated with this article.

Creation Date

  • March 20, 2018

Submitted Date

  • April 13, 2017

Accepted Date

  • December 19, 2017

Added to The UNT Digital Library

  • May 16, 2018, 2:54 p.m.

Usage Statistics

When was this article last used?

Yesterday: 0
Past 30 days: 3
Total Uses: 9

Interact With This Article

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

International Image Interoperability Framework

IIF Logo

We support the IIIF Presentation API

Morozov, Kirill; Roy, Partha Sarathi; Steinwandt, Rainer & Xu, Rui. On the security of the Courtois-Finiasz-Sendrier signature, article, March 20, 2018; Berlin, Germany. (digital.library.unt.edu/ark:/67531/metadc1152246/: accessed October 15, 2018), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT College of Engineering.