<?xml version='1.0' encoding='UTF-8'?>
<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-03-16T09:38:45Z</responseDate>
  <request metadataPrefix="oai_dc" verb="GetRecord" identifier="oai:ipsj.ixsq.nii.ac.jp:00098136">https://ipsj.ixsq.nii.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:ipsj.ixsq.nii.ac.jp:00098136</identifier>
        <datestamp>2025-01-21T12:36:55Z</datestamp>
        <setSpec>1164:2036:7423:7424</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns="http://www.w3.org/2001/XMLSchema" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>CUDAを用いた多倍長循環ベクトル乗算アルゴリズムの並列化実装</dc:title>
          <dc:title>Evaluation of parallelization for multiple-precision Cyclic Vector Multiplication Algorithm using CUDA</dc:title>
          <dc:creator>原村, 知志</dc:creator>
          <dc:creator>籠谷, 裕人</dc:creator>
          <dc:creator>野上, 保之</dc:creator>
          <dc:creator>杉山, 裕二</dc:creator>
          <dc:creator>Satoshi, Haramura</dc:creator>
          <dc:creator>Hiroto, Kagotani</dc:creator>
          <dc:creator>Yasuyuki, Nogami</dc:creator>
          <dc:creator>Yuji, Sugiyama</dc:creator>
          <dc:subject>並列処理</dc:subject>
          <dc:description>近年，GPU を数値演算に用いる GPGPU の環境が整い，GPGPU を用いた暗号実装の研究が盛んに行われている．本稿では，ペアリング暗号のための拡大体上で乗算が効率よく行える循環ベクトル乗算アルゴリズムについて，素体の標数を 256bit として GPU により実装を行った．その中で，乗算剰余算を効率よく行うために，モンゴメリ乗算を適用した．NVIDIA GeForce GTX680 への実装では，CPU （Core i7 3970X） に対して 10 倍以上遅いという結果になった．</dc:description>
          <dc:description>Recently, studies on implementation of cryptographical algorithms on GPUs are widely conducted as GPGPU development environment provides easy access to GPUs for non-graphics programming. In this paper, we implement cyclic vector multiplication algorithm, or an efficient multiplication algorithm on extension fields, that will accelerate pairing cryptography. Since we adopt 256-bit characteristic for the base fields, we also implement Montgomery multiplication for 256-bit operands on GPU. As the result of implementation on NVIDIA GeForce GTX680, it is over 10 times slower than implementation on Core i7 3970X.</dc:description>
          <dc:description>technical report</dc:description>
          <dc:publisher>情報処理学会</dc:publisher>
          <dc:date>2014-01-21</dc:date>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>研究報告システムLSI設計技術（SLDM）</dc:identifier>
          <dc:identifier>19</dc:identifier>
          <dc:identifier>2014-SLDM-164</dc:identifier>
          <dc:identifier>1</dc:identifier>
          <dc:identifier>4</dc:identifier>
          <dc:identifier>AA11451459</dc:identifier>
          <dc:identifier>https://ipsj.ixsq.nii.ac.jp/record/98136/files/IPSJ-SLDM14164019.pdf</dc:identifier>
          <dc:language>jpn</dc:language>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
