1 Ocak 2020 Dergi makalesi Açık Erişim

Mert, Ahmet Can; Ozturk, Erdinc; Savas, Erkay

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<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:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Mert, Ahmet Can</dc:creator>
  <dc:creator>Ozturk, Erdinc</dc:creator>
  <dc:creator>Savas, Erkay</dc:creator>
  <dc:date>2020-01-01</dc:date>
  <dc:description>Multiplication of polynomials of large degrees is the predominant operation in lattice-based cryptosystems in terms of execution time. This motivates the study of its fast and efficient implementations in hardware. Also, applications such as those using homomorphic encryption need to operate with polynomials of different parameter sets. This calls for design of configurable hardware architectures that can support multiplication of polynomials of various degrees and coefficient sizes.</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/9707</dc:identifier>
  <dc:identifier>oai:zenodo.org:9707</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:source>MICROPROCESSORS AND MICROSYSTEMS 78</dc:source>
  <dc:title>FPGA implementation of a run-time configurable NTT-based polynomial multiplication hardware</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>