E-viri
Recenzirano
-
Kundi, Dur-e-Shahwar; Zhang, Yuqing; Wang, Chenghua; Khalid, Ayesha; ONeill, Maire; Liu, Weiqiang
IEEE transactions on emerging topics in computing, 10/2022, Letnik: 10, Številka: 4Journal Article
Lattice-based cryptography (LBC) has emerged as the most viable substitutes to the classical cryptographic schemes as 5 out of 7 finalist schemes in the 3rd round of the NIST post-quantum cryptography (PQC) standardization process are lattice based in construction. This work explores novel architectural optimizations in the FPGA-based hardware implementation of polynomial multiplication, which is a bottleneck in every LBC construction. To target ultra-high throughput, both schoolbook polynomial multiplication (SPM) and number theoretic transform (NTT) are explored: a completely parallel architecture of an SPM is undertaken while for NTT, radix-2 and radix-<inline-formula><tex-math notation="LaTeX">2^2</tex-math> <mml:math><mml:msup><mml:mn>2</mml:mn><mml:mn>2</mml:mn></mml:msup></mml:math><inline-graphic xlink:href="liu-ieq1-3144101.gif"/> </inline-formula> multi-path delay commutator (MDC) based pipelined architectures are adopted. Our proposed high-speed SPM (HSPM) structure on latest Xilinx UltraScale+ FPGA is 5× faster than the state-of-the-art LBC designs. Whereas, the proposed high-speed NTT (HNTT) structure (i.e., R<inline-formula><tex-math notation="LaTeX">2^2</tex-math> <mml:math><mml:msup><mml:mn>2</mml:mn><mml:mn>2</mml:mn></mml:msup></mml:math><inline-graphic xlink:href="liu-ieq2-3144101.gif"/> </inline-formula>MDC) takes only 0.63<inline-formula><tex-math notation="LaTeX">\mu</tex-math> <mml:math><mml:mi>μ</mml:mi></mml:math><inline-graphic xlink:href="liu-ieq3-3144101.gif"/> </inline-formula>s for the encryption, hence achieving the highest throughput of 408 Mbps. Moreover, all of the proposed designs achieve highest design efficiencies (i.e., throughput per slice (TPS)) in comparison to available LBC designs.
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Vnos na polico
Trajna povezava
- URL:
Faktor vpliva
Dostop do baze podatkov JCR je dovoljen samo uporabnikom iz Slovenije. Vaš trenutni IP-naslov ni na seznamu dovoljenih za dostop, zato je potrebna avtentikacija z ustreznim računom AAI.
Leto | Faktor vpliva | Izdaja | Kategorija | Razvrstitev | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Baze podatkov, v katerih je revija indeksirana
Ime baze podatkov | Področje | Leto |
---|
Povezave do osebnih bibliografij avtorjev | Povezave do podatkov o raziskovalcih v sistemu SICRIS |
---|
Vir: Osebne bibliografije
in: SICRIS
To gradivo vam je dostopno v celotnem besedilu. Če kljub temu želite naročiti gradivo, kliknite gumb Nadaljuj.