Parallel-CFS (Q3084252)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Parallel-CFS	scientific article

Statements

scholarly article

0 references

Parallel-CFS (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-19574-7_11

0 references

Matthieu Finiasz

0 references

Selected Areas in Cryptography

0 references

publication date

15 March 2011

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

CFS digital signature scheme

0 references

code based cryptography

0 references

syndrome decoding problem

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-19574-7_11

0 references

0 references

List Decoding for Binary Goppa Codes

0 references

McEliece Cryptosystem Implementation: Theory and Practice

0 references

A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511

0 references

0 references

Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme

0 references

Algebraic Cryptanalysis of McEliece Variants with Compact Keys

0 references

Security Bounds for the Design of Code-Based Cryptosystems

0 references

On the complexity of some cryptographic problems based on the general decoding problem

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3084252

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3084252&oldid=35219008"