High-Speed Variable Polynomial Toeplitz Hash Algorithm Based on FPGA
In the Quantum Key Distribution (QKD) network, authentication protocols play a critical role in safeguarding data interactions among users. To keep pace with the rapid advancement of QKD technology, authentication protocols must be capable of processing data at faster speeds. The Secure Hash Algorithm (SHA), which functions as a cryptographic hash function, is a key technology in digital authentication. Irreducible polynomials can serve as characteristic functions of the Linear Feedback Shift Register (LFSR) to rapidly generate pseudo-random sequences, which in turn form the foundation of the hash algorithm. Currently, the most prevalent approach to hardware implementation involves performing block computations and pipeline data processing of the Toeplitz matrix in the Field-Programmable Gate Array (FPGA) to reach a maximum computing rate of 1 Gbps. However, this approach employs a fixed irreducible polynomial as the characteristic polynomial of the LFSR, which results in computational inefficiency as the highest bit of the polynomial restricts the width of parallel processing. Moreover, an attacker could deduce the irreducible polynomials utilized by an algorithm based on the output results, creating a serious concealed security risk. This paper proposes a method to use FPGA to implement variational irreducible polynomials based on a hashing algorithm. Our method achieves an operational rate of 6.8 Gbps by computing equivalent polynomials and updating the Toeplitz matrix with pipeline operations in real-time, which accelerates the authentication protocol while also significantly enhancing its security. Moreover, the optimization of this algorithm can be extended to quantum randomness extraction, leading to a considerable increase in the generation rate of random numbers.
| Medienart: |
E-Artikel |
|---|
| Erscheinungsjahr: |
2023 |
|---|---|
| Erschienen: |
2023 |
| Enthalten in: |
Zur Gesamtaufnahme - volume:25 |
|---|---|
| Enthalten in: |
Entropy (Basel, Switzerland) - 25(2023), 4 vom: 11. Apr. |
| Sprache: |
Englisch |
|---|
| Beteiligte Personen: |
Huang, Si-Cheng [VerfasserIn] |
|---|
| Links: |
|---|
| Themen: |
Fast Modular Composition Algorithm |
|---|
| Anmerkungen: |
Date Revised 17.05.2023 published: Electronic Citation Status PubMed-not-MEDLINE |
|---|
| doi: |
10.3390/e25040642 |
|---|
| funding: |
|
|---|---|
| Förderinstitution / Projekttitel: |
|
| PPN (Katalog-ID): |
NLM356930815 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLM356930815 | ||
| 003 | DE-627 | ||
| 005 | 20231226071513.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 231226s2023 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.3390/e25040642 |2 doi | |
| 028 | 5 | 2 | |a pubmed24n1189.xml |
| 035 | |a (DE-627)NLM356930815 | ||
| 035 | |a (NLM)37190430 | ||
| 035 | |a (PII)642 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Huang, Si-Cheng |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a High-Speed Variable Polynomial Toeplitz Hash Algorithm Based on FPGA |
| 264 | 1 | |c 2023 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ƒaComputermedien |b c |2 rdamedia | ||
| 338 | |a ƒa Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a Date Revised 17.05.2023 | ||
| 500 | |a published: Electronic | ||
| 500 | |a Citation Status PubMed-not-MEDLINE | ||
| 520 | |a In the Quantum Key Distribution (QKD) network, authentication protocols play a critical role in safeguarding data interactions among users. To keep pace with the rapid advancement of QKD technology, authentication protocols must be capable of processing data at faster speeds. The Secure Hash Algorithm (SHA), which functions as a cryptographic hash function, is a key technology in digital authentication. Irreducible polynomials can serve as characteristic functions of the Linear Feedback Shift Register (LFSR) to rapidly generate pseudo-random sequences, which in turn form the foundation of the hash algorithm. Currently, the most prevalent approach to hardware implementation involves performing block computations and pipeline data processing of the Toeplitz matrix in the Field-Programmable Gate Array (FPGA) to reach a maximum computing rate of 1 Gbps. However, this approach employs a fixed irreducible polynomial as the characteristic polynomial of the LFSR, which results in computational inefficiency as the highest bit of the polynomial restricts the width of parallel processing. Moreover, an attacker could deduce the irreducible polynomials utilized by an algorithm based on the output results, creating a serious concealed security risk. This paper proposes a method to use FPGA to implement variational irreducible polynomials based on a hashing algorithm. Our method achieves an operational rate of 6.8 Gbps by computing equivalent polynomials and updating the Toeplitz matrix with pipeline operations in real-time, which accelerates the authentication protocol while also significantly enhancing its security. Moreover, the optimization of this algorithm can be extended to quantum randomness extraction, leading to a considerable increase in the generation rate of random numbers | ||
| 650 | 4 | |a Journal Article | |
| 650 | 4 | |a Fast Modular Composition Algorithm | |
| 650 | 4 | |a Field-Programmable Gate Array | |
| 650 | 4 | |a Secure Hash Algorithm | |
| 650 | 4 | |a quantum digital authentication | |
| 650 | 4 | |a variable irreducible polynomial | |
| 700 | 1 | |a Huang, Shan |e verfasserin |4 aut | |
| 700 | 1 | |a Yin, Hua-Lei |e verfasserin |4 aut | |
| 700 | 1 | |a Ma, Qing-Li |e verfasserin |4 aut | |
| 700 | 1 | |a Yin, Ze-Jie |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Entropy (Basel, Switzerland) |d 2008 |g 25(2023), 4 vom: 11. Apr. |w (DE-627)NLM191572098 |x 1099-4300 |7 nnns |
| 773 | 1 | 8 | |g volume:25 |g year:2023 |g number:4 |g day:11 |g month:04 |
| 856 | 4 | 0 | |u http://dx.doi.org/10.3390/e25040642 |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a GBV_NLM | ||
| 951 | |a AR | ||
| 952 | |d 25 |j 2023 |e 4 |b 11 |c 04 | ||