A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography (Q5739036): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: McEliece / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-55589-8_15 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2593199740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing Key Length of the McEliece Cryptosystem / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to mask the structure of codes for a cryptographic use / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inherent intractability of certain coding problems (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2965866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact McEliece Keys from Goppa Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3752293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Is code equivalence easy to decide? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the permutation between equivalent linear codes: the support splitting algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of computing the minimum distance of a code / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public Key Cryptography - PKC 2006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved identification schemes based on error-correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new identification scheme based on syndrome decoding / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:35, 13 July 2024

scientific article; zbMATH DE number 6725248
Language Label Description Also known as
English
A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography
scientific article; zbMATH DE number 6725248

    Statements

    A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography (English)
    0 references
    0 references
    0 references
    1 June 2017
    0 references
    code-based cryptography
    0 references
    equivalence subcode
    0 references
    identification scheme
    0 references

    Identifiers