Home > Search Results: keywords:"McElieceův kryptosystém"
Search:
 
Search Tips :: Simple Search
Search collections:
Sort by: Display results: Output format:
National Repository of Grey Literature 1 records found  Search took 0.01 seconds. 
Quasi-monoidic codes
 Snítilá, Jitka ; Žemlička, Jan (advisor) ; Šťovíček, Jan (referee)
This thesis focuses on the problem of the key size in McEliece cryptosystem and its solution using quasi- monoidic codes, especially quasi-monoidic Goppa codes. Required theory of quasi-monoidic Cauchy matrices and Goppa codes is introduced along with algebraic structures necessary for quasi-monoidic codes description. Suitable Abelian groups for this class of codes are specified. This thesis also presents efficient algorithms for constructing quasi-monoidic Cauchy matrices and quasi-monoidic Goppa codes. Reduction of the key size using this class of algebraic codes is presented as well. Powered by TCPDF (www.tcpdf.org)
Detailed record

Interested in being notified about new results for this query?
Subscribe to the RSS feed.
Digital Repository :: Search :: Submit :: Personalize :: Help
Powered by Invenio v1.1.2
Maintained by admin.invenio@techlib.cz
This site is also available in the following languages:
Česky  English