<?xml version="1.0" encoding="utf-8"?>
<!-- generator="FeedCreator 1.7.2-ppt DokuWiki" -->
<?xml-stylesheet href="http://www.davidovic.cz/wiki/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="http://www.davidovic.cz/wiki/feed.php">
        <title>Tomas Davidovic's Homepage school:davidovic_mt2008</title>
        <description></description>
        <link>http://www.davidovic.cz/wiki/</link>
        <image rdf:resource="http://www.davidovic.cz/wiki/lib/tpl/arctic/images/favicon.ico" />
       <dc:date>2026-04-29T22:21:23+02:00</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="http://www.davidovic.cz/wiki/doku.php/school/davidovic_mt2008/davidovic_mt2008?rev=1313110294&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="http://www.davidovic.cz/wiki/lib/tpl/arctic/images/favicon.ico">
        <title>Tomas Davidovic's Homepage</title>
        <link>http://www.davidovic.cz/wiki/</link>
        <url>http://www.davidovic.cz/wiki/lib/tpl/arctic/images/favicon.ico</url>
    </image>
    <item rdf:about="http://www.davidovic.cz/wiki/doku.php/school/davidovic_mt2008/davidovic_mt2008?rev=1313110294&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2011-08-12T02:51:34+02:00</dc:date>
        <title>Cryptographic Coprocessor</title>
        <link>http://www.davidovic.cz/wiki/doku.php/school/davidovic_mt2008/davidovic_mt2008?rev=1313110294&amp;do=diff</link>
        <description>T. Davidovic

Master thesis at Czech Technical University in Prague



[[bib]]
[[thesis]]
[[presentation]]

Abstract: This thesis deals with a design of a versatile cryptographic coprocessor for Elliptic Curve
Cryptography dedicated for cryptographic operations over binary ﬁnite ﬁeld, GF(2m). The
processor can work with (almost) any binary ﬁnite ﬁeld of order (cardinality, number of
elements) between 22 and 21000, can operate over either aﬃne or projective coordinates
and can use either polynomi…</description>
    </item>
</rdf:RDF>
