Self-adaptive large integer modular multiplication operation method and device based on homomorphic encryption
The invention discloses a self-adaptive large integer modular multiplication operation method and device based on homomorphic encryption, and belongs to the field of lattice passwords. The method comprises the following steps: pre-calculating according to modulus and bit width parameters to obtain a...
Gespeichert in:
| Hauptverfasser: | , , , , , , |
|---|---|
| Format: | Patent |
| Sprache: | chi ; eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | SHAO XINYU FU YUXIANG LI WEI LI LI SONG WENQING WANG XINYU HE SHUZHUAN |
| description | The invention discloses a self-adaptive large integer modular multiplication operation method and device based on homomorphic encryption, and belongs to the field of lattice passwords. The method comprises the following steps: pre-calculating according to modulus and bit width parameters to obtain a cycle indication number; obtaining a decomposition substrate by using the modulus, and decomposing the multiplicand according to the decomposition substrate; substitution reduction is carried out according to the cycle indication number and the bit width parameter, and reduction is carried out by replacing the square term of the substrate with the difference between the square of the decomposition substrate and the modulus in a congruence environment; and then shifting reduction is carried out on the obtained result, and the result is compared with a modulus to obtain a final modular multiplication result. According to the method, the problems that large integer modular multiplication needs a relatively high bit w |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN115374458A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN115374458A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN115374458A3</originalsourceid><addsrcrecordid>eNqNiz0KwkAUhNNYiHqH5wFShCRoK0GxstE-PHcnyYP9Y7MJeHsjegCZYoZvZtaZu8N0OWsOSWaQ4diDxCX0iGS9nhZCdjJJghHFSbwjHxC_ySINXhM7TRqzKNCTR2haqsHbRTEMoghOxVf4PLbZqmMzYvfzTba_nB_NNUfwLcbACg6pbW5FUZeHqqqPp_KfzRsyFEOC</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Self-adaptive large integer modular multiplication operation method and device based on homomorphic encryption</title><source>esp@cenet</source><creator>SHAO XINYU ; FU YUXIANG ; LI WEI ; LI LI ; SONG WENQING ; WANG XINYU ; HE SHUZHUAN</creator><creatorcontrib>SHAO XINYU ; FU YUXIANG ; LI WEI ; LI LI ; SONG WENQING ; WANG XINYU ; HE SHUZHUAN</creatorcontrib><description>The invention discloses a self-adaptive large integer modular multiplication operation method and device based on homomorphic encryption, and belongs to the field of lattice passwords. The method comprises the following steps: pre-calculating according to modulus and bit width parameters to obtain a cycle indication number; obtaining a decomposition substrate by using the modulus, and decomposing the multiplicand according to the decomposition substrate; substitution reduction is carried out according to the cycle indication number and the bit width parameter, and reduction is carried out by replacing the square term of the substrate with the difference between the square of the decomposition substrate and the modulus in a congruence environment; and then shifting reduction is carried out on the obtained result, and the result is compared with a modulus to obtain a final modular multiplication result. According to the method, the problems that large integer modular multiplication needs a relatively high bit w</description><language>chi ; eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2022</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20221122&DB=EPODOC&CC=CN&NR=115374458A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,777,882,25545,76296</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20221122&DB=EPODOC&CC=CN&NR=115374458A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>SHAO XINYU</creatorcontrib><creatorcontrib>FU YUXIANG</creatorcontrib><creatorcontrib>LI WEI</creatorcontrib><creatorcontrib>LI LI</creatorcontrib><creatorcontrib>SONG WENQING</creatorcontrib><creatorcontrib>WANG XINYU</creatorcontrib><creatorcontrib>HE SHUZHUAN</creatorcontrib><title>Self-adaptive large integer modular multiplication operation method and device based on homomorphic encryption</title><description>The invention discloses a self-adaptive large integer modular multiplication operation method and device based on homomorphic encryption, and belongs to the field of lattice passwords. The method comprises the following steps: pre-calculating according to modulus and bit width parameters to obtain a cycle indication number; obtaining a decomposition substrate by using the modulus, and decomposing the multiplicand according to the decomposition substrate; substitution reduction is carried out according to the cycle indication number and the bit width parameter, and reduction is carried out by replacing the square term of the substrate with the difference between the square of the decomposition substrate and the modulus in a congruence environment; and then shifting reduction is carried out on the obtained result, and the result is compared with a modulus to obtain a final modular multiplication result. According to the method, the problems that large integer modular multiplication needs a relatively high bit w</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2022</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNqNiz0KwkAUhNNYiHqH5wFShCRoK0GxstE-PHcnyYP9Y7MJeHsjegCZYoZvZtaZu8N0OWsOSWaQ4diDxCX0iGS9nhZCdjJJghHFSbwjHxC_ySINXhM7TRqzKNCTR2haqsHbRTEMoghOxVf4PLbZqmMzYvfzTba_nB_NNUfwLcbACg6pbW5FUZeHqqqPp_KfzRsyFEOC</recordid><startdate>20221122</startdate><enddate>20221122</enddate><creator>SHAO XINYU</creator><creator>FU YUXIANG</creator><creator>LI WEI</creator><creator>LI LI</creator><creator>SONG WENQING</creator><creator>WANG XINYU</creator><creator>HE SHUZHUAN</creator><scope>EVB</scope></search><sort><creationdate>20221122</creationdate><title>Self-adaptive large integer modular multiplication operation method and device based on homomorphic encryption</title><author>SHAO XINYU ; FU YUXIANG ; LI WEI ; LI LI ; SONG WENQING ; WANG XINYU ; HE SHUZHUAN</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN115374458A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2022</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>SHAO XINYU</creatorcontrib><creatorcontrib>FU YUXIANG</creatorcontrib><creatorcontrib>LI WEI</creatorcontrib><creatorcontrib>LI LI</creatorcontrib><creatorcontrib>SONG WENQING</creatorcontrib><creatorcontrib>WANG XINYU</creatorcontrib><creatorcontrib>HE SHUZHUAN</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>SHAO XINYU</au><au>FU YUXIANG</au><au>LI WEI</au><au>LI LI</au><au>SONG WENQING</au><au>WANG XINYU</au><au>HE SHUZHUAN</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Self-adaptive large integer modular multiplication operation method and device based on homomorphic encryption</title><date>2022-11-22</date><risdate>2022</risdate><abstract>The invention discloses a self-adaptive large integer modular multiplication operation method and device based on homomorphic encryption, and belongs to the field of lattice passwords. The method comprises the following steps: pre-calculating according to modulus and bit width parameters to obtain a cycle indication number; obtaining a decomposition substrate by using the modulus, and decomposing the multiplicand according to the decomposition substrate; substitution reduction is carried out according to the cycle indication number and the bit width parameter, and reduction is carried out by replacing the square term of the substrate with the difference between the square of the decomposition substrate and the modulus in a congruence environment; and then shifting reduction is carried out on the obtained result, and the result is compared with a modulus to obtain a final modular multiplication result. According to the method, the problems that large integer modular multiplication needs a relatively high bit w</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | chi ; eng |
| recordid | cdi_epo_espacenet_CN115374458A |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING ELECTRIC DIGITAL DATA PROCESSING PHYSICS |
| title | Self-adaptive large integer modular multiplication operation method and device based on homomorphic encryption |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T00%3A53%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=SHAO%20XINYU&rft.date=2022-11-22&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN115374458A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |