加速全同态加密的高基数模集残二转换

Truong Phu Truan Ho, Chip-Hong Chang
{"title":"加速全同态加密的高基数模集残二转换","authors":"Truong Phu Truan Ho, Chip-Hong Chang","doi":"10.1109/APCCAS.2016.7803882","DOIUrl":null,"url":null,"abstract":"Recent hardware implementations of fully homomorphic encryption (FHE) exploit very high cardinality arbitrary moduli sets to parallelize large integer arithmetic. However, the benefit they gained are heavily offset by the slow residue-to-binary conversion due to the large modulo operations and limited number theoretic properties of arbitrary moduli. This paper presents a fast residue-to-binary (R2B) conversion method by transforming a large number of residues of arbitrary moduli into only three residues before the conversion. It exploits the smaller and parallel operations of base extension for the mapping to {2n−1, 2n, 2n +1} and the highly efficient adder-based R2B converter of the latter to achieve 2.25 ∼ 6.8 times speedup over recent R2B converters, which translates to approximately 10.2% to 32.08% of overall speed improvement for their FHE implementations.","PeriodicalId":6495,"journal":{"name":"2016 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS)","volume":"33 1","pages":"9-12"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Accelerating residue-to-binary conversion of very high cardinality moduli set for fully homomorphic encryption\",\"authors\":\"Truong Phu Truan Ho, Chip-Hong Chang\",\"doi\":\"10.1109/APCCAS.2016.7803882\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recent hardware implementations of fully homomorphic encryption (FHE) exploit very high cardinality arbitrary moduli sets to parallelize large integer arithmetic. However, the benefit they gained are heavily offset by the slow residue-to-binary conversion due to the large modulo operations and limited number theoretic properties of arbitrary moduli. This paper presents a fast residue-to-binary (R2B) conversion method by transforming a large number of residues of arbitrary moduli into only three residues before the conversion. It exploits the smaller and parallel operations of base extension for the mapping to {2n−1, 2n, 2n +1} and the highly efficient adder-based R2B converter of the latter to achieve 2.25 ∼ 6.8 times speedup over recent R2B converters, which translates to approximately 10.2% to 32.08% of overall speed improvement for their FHE implementations.\",\"PeriodicalId\":6495,\"journal\":{\"name\":\"2016 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS)\",\"volume\":\"33 1\",\"pages\":\"9-12\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCCAS.2016.7803882\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCCAS.2016.7803882","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

最近的完全同态加密(FHE)的硬件实现利用非常高的基数任意模集来并行化大整数运算。然而,由于大的模运算和任意模有限的数论性质,他们所获得的好处被缓慢的残数到二进制转换严重抵消。本文提出了一种快速残数到二值(R2B)转换方法,该方法在转换前将任意模的大量残数转换为仅三个残数。它利用了映射到{2n−1,2n, 2n +1}的更小和并行的基扩展操作,以及后者的高效基于加法器的R2B转换器,比最近的R2B转换器实现了2.25 ~ 6.8倍的速度提升,这意味着其FHE实现的总体速度提高了约10.2%至32.08%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Accelerating residue-to-binary conversion of very high cardinality moduli set for fully homomorphic encryption
Recent hardware implementations of fully homomorphic encryption (FHE) exploit very high cardinality arbitrary moduli sets to parallelize large integer arithmetic. However, the benefit they gained are heavily offset by the slow residue-to-binary conversion due to the large modulo operations and limited number theoretic properties of arbitrary moduli. This paper presents a fast residue-to-binary (R2B) conversion method by transforming a large number of residues of arbitrary moduli into only three residues before the conversion. It exploits the smaller and parallel operations of base extension for the mapping to {2n−1, 2n, 2n +1} and the highly efficient adder-based R2B converter of the latter to achieve 2.25 ∼ 6.8 times speedup over recent R2B converters, which translates to approximately 10.2% to 32.08% of overall speed improvement for their FHE implementations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信