<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-20T17:21:23Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/42280" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/42280</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_8888</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_8887</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Blahut, Richard E.</dc:contributor>
          <dc:creator>Sisneros, Severiano</dc:creator>
          <dc:date>2013-02-03T19:30:10Z</dc:date>
          <dc:date>2013-02-03T19:30:10Z</dc:date>
          <dc:date>2012-12</dc:date>
          <dc:date>2013-02-03T19:30:10Z</dc:date>
          <dc:date>2012-12</dc:date>
          <dc:description>In this thesis we present the latest developments in composite-order pairing based
cryptography. We first develop the necessary mathematical background. We describe
elliptic curves over finite fields, as well as rational functions and divisors on such curves.
Bilinear pairings on elliptic curves are explained. We then introduce bilinear groups of
composite order and how they are used to create pairing-based cryptosystems. We present
two cryptosystems using composite-order groups. We conclude with a discussion of current
research.</dc:description>
          <dc:description>Item withdrawn by Mark Zulauf (zulauf@illinois.edu) on 2012-09-06T20:05:17Z
Item was in collections:
University of Illinois Theses &amp; Dissertations (ID: 1)
No. of bitstreams: 1
sisneros_severiano.pdf: 847055 bytes, checksum: dd480283918f2888e71407b7f27e840f (MD5)</dc:description>
          <dc:description>Made available in DSpace on 2013-02-03T19:30:10Z (GMT). No. of bitstreams: 2
Severiano_Sisneros.pdf: 847055 bytes, checksum: dd480283918f2888e71407b7f27e840f (MD5)
license.txt: 4068 bytes, checksum: 217088c4b3b1af87ce336c6b0548e35b (MD5)</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/42280</dc:identifier>
          <dc:language>en</dc:language>
          <dc:rights>Copyright 2012 Severiano Sisneros</dc:rights>
          <dc:subject>Cryptography</dc:subject>
          <dc:subject>Bilinear Pairings</dc:subject>
          <dc:subject>Composite Order Groups</dc:subject>
          <dc:title>On the implementation of composite-order bilinear groups in cryptographic protocols</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Electrical &amp; Computer Eng</department>
            <departmentCode>1933</departmentCode>
            <discipline>Electrical &amp; Computer Engr</discipline>
            <disciplineCode>1200</disciplineCode>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Thesis</level>
            <name>M.S.</name>
            <program>MS:Electr &amp; Computer Eng-UIUC</program>
            <programCode>10KS1200MS</programCode>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
