Publication:

Low-Complexity and High-Throughput Number Theoretic Transform Architecture for Polynomial Multiplication in Homomorphic Encryption

 
cris.virtual.department#PLACEHOLDER_PARENT_METADATA_VALUE#
cris.virtual.department#PLACEHOLDER_PARENT_METADATA_VALUE#
cris.virtual.orcid0000-0001-9922-5688
cris.virtual.orcid0000-0002-8435-9242
cris.virtualsource.departmentc0aec09a-eb8c-4b7d-98b0-e9d9448ebcad
cris.virtualsource.department9e4df1e2-526b-48e4-bcc8-9e88e0519995
cris.virtualsource.orcidc0aec09a-eb8c-4b7d-98b0-e9d9448ebcad
cris.virtualsource.orcid9e4df1e2-526b-48e4-bcc8-9e88e0519995
dc.contributor.authorSutisna, Nana
dc.contributor.authorBrillianshah, Elkhan J.
dc.contributor.authorSyafalni, Infall
dc.contributor.authorHasanuddin, M. Ogin
dc.contributor.authorAdiono, Trio
dc.contributor.authorJuhana, Tutun
dc.contributor.imecauthorSyafalnin, Infall
dc.date.accessioned2024-09-21T17:57:28Z
dc.date.available2024-09-21T17:57:28Z
dc.date.issued2024
dc.description.wosFundingTextThis work is supported by the BCA Innovation Award organized by LPIK ITB under grant number LPIK.PN-8-02-2023 and by the publication aid from the School of Electrical Engineering and Informatics, Bandung Institute of Technology.
dc.identifier.doi10.1109/ISCAS58744.2024.10557845
dc.identifier.eisbn979-8-3503-3099-1
dc.identifier.isbn979-8-3503-3100-4
dc.identifier.issn0271-4302
dc.identifier.urihttps://imec-publications.be/handle/20.500.12860/44555
dc.publisherIEEE
dc.source.conferenceIEEE International Symposium on Circuits and Systems (ISCAS)
dc.source.conferencedate2024-05-19
dc.source.conferencelocationSingapore
dc.source.numberofpages5
dc.title

Low-Complexity and High-Throughput Number Theoretic Transform Architecture for Polynomial Multiplication in Homomorphic Encryption

dc.typeProceedings paper
dspace.entity.typePublication
Files
Publication available in collections: