NSTL国家科技图书文献中心

1. Improved Key Recovery Attacks of Ascon NSTL国家科技图书文献中心

Shuo Peng | Kai Hu ... - 《Topics in Cryptology – CT-RSA 2025》 - Cryptographers Track at the RSA Conference - 2025, - 123～146 - 共24页

摘要： recommendation of AEAD), the key* recovery attack can only be* | misused setting), improve the key* recovery attack on* | recovery attack, based on the full key space, greatly | techniques to extend state recovery to key recovery | state recovery in the encryption phase to key recovery

关键词： Ascon-128 | Cube attack | Superpoly recovery | Key recovery

2. Generic Differential Key Recovery Attacks and Beyond NSTL国家科技图书文献中心

Ling Song | Huimin Liu ... - 《Advances in Cryptology - ASIACRYPT 2024,Part VII》 - International Conference on the Theory and Application of Cryptology and Information Security - 2025, - 361～391 - 共31页

摘要： generic key* recovery attacks in this paper. First, we* | At Asiacrypt 2022, a holistic key* guessing* | strategy was proposed to yield the most efficient key | recovery for the rectangle attack. Recently, at Crypto | extend the holistic key* guessing strategy from the*

关键词： Differential cryptanalysis | Rectangle attack | Meet-in-the-middle | Key recovery | AES | KATAN | SKINNYe

3. Improved key recovery attacks on reduced-round Salsa20 NSTL国家科技图书文献中心

Sabyasachi Dey | Gregor Leander ... - 《Designs,codes and crytography》 - 2025,93(1) - 243～262 - 共20页

摘要： influence of these key* bits on the computation, in the* | -bit key* version of Salsa20. Also, we provide* | key version of Salsa20 and the 7-round of the 128 | -bit key* version of Salsa20.* | In this paper, we present an improved attack

关键词： Salsa20 | Differential-linear cryptanalysis | Probabilistic neutral bits | Key recovery

4. Efficient Reconstruction in Key Recovery Attack on the QC-MDPC McEliece Cryptosystems NSTL国家科技图书文献中心

Motonari OHTSUKA | Takahiro ISHIMARU ... - 《IEICE Transactions on fundamentals of electronics, communications & computer sciences》 - 2025,E108/A(3) - 414～422 - 共9页

摘要： post-quantum cryptosystems. The McEliece public-key | the secret key. This attack is twofold: (1 | ) obtaining the distance spectrum of the secret key* from* | ) reconstructing the secret key* from the distance spectrum. The* | propose another method to reconstruct the secret key

关键词： QC-MDPC | decoding error rate | distance spectrum | key recovery attack | clique problem

5. Quantum Key Recovery Attacks on 4-Round Iterated Even-Mansour with Two Keys NSTL国家科技图书文献中心

Ravi Anand | Shibam Ghosh ... - 《Information Security,Part I》 - International Conference on Information Security - 2025, - 87～103 - 共17页

摘要：In this paper, we propose quantum key recovery | key schedule that applies two keys alternately. We | Simon's algorithm to this function, we construct a key | recovery attack with a complexity of O(√N log N) for N | = 2~n, where n is the block size and one secret key

关键词： Cryptanalysis | Quantum attack | Multibridge attack | Iterated even-Mansour

6. Quantum key recovery under plaintext-checking attacks on post-quantum cryptosystems NSTL国家科技图书文献中心

Yaru,Wang | Haodong,Jiang ... - 《Quantum information processing》 - 2025,24(1) - 共5页

摘要： a classical key* recovery under plaintext-checking* | attacks (KR-PCA) and a quantum key* recovery under chosen* | -generation public-key* cryptosystems. In particular, many* | security of meta-cryptosystem under key* reuse by mounting* | quantum KR-PCA for meta-cryptosystem under key* reuse*

关键词： Quantum plaintext checking attack | Noise learning problem | Ordered search problem | Post-quantum cryptography | Quantum algorithm

7. OccPoIs: Points of Interest Based on Neural Network's Key Recovery in Side-Channel Analysis Through Occlusion NSTL国家科技图书文献中心

Trevor Yap | Stjepan Picek ... - 《Progress in Cryptology - INDOCRYPT 2024,Part II》 - International Conference on Cryptology in India - 2025, - 3～28 - 共26页

摘要： Key Guessing Occlusion (KGO) that acquires a minimal | set of sample points required by the DNN for key | recovery, which we call OccPoIs. These OccPoIs provide | DNN for retrieving the key, enabling evaluators to | OccPoIs with TA can recover the key* for all the*

关键词： Side-channel analysis | Neural network | Deep learning | Profiling attack | Explainability | Feature importance | Feature selection

8. Affine Equivalence-Based Key-Recovery Attacks on White-Box Implementations of the SM4 Block Cipher NSTL国家科技图书文献中心

Zexuan Chen | Jiqiang Lu - 《Topics in Cryptology – CT-RSA 2025》 - Cryptographers Track at the RSA Conference - 2025, - 401～425 - 共25页

摘要： regarded as (practically) secure against key-recovery | structure with four 32-bit branches and a 128-bit user key | recovered a masked key* with such constants, while by* | the original user key* of these white-box SM4* | the SM4 key* expansion formula to filter out a few*

关键词： White-box cryptography | SM4 block cipher | Affine equivalence | Self-equivalence

9. Improving Differential-Neural Cryptanalysis for Large-State SPECK NSTL国家科技图书文献中心

Tianrong Huang | Yingying Li ... - 《Information and Communications Security,Part I》 - International Conference on Information and Communications Security - 2025, - 40～57 - 共18页

摘要：At CRYPTO 2019, Gohr presented a key recovery | learning-assisted multi-stage key* recovery framework in* | 2022, based on which key* recovery attacks on large* | key recovery framework. This framework uses the | maintaining the accuracy of key recovery. We conduct key

关键词： Deep learning | Differential cryptanalysis | Key recovery attack | Large-state block cipher | SPECK

10. Guessing less and better: improved attacks on GIFT-64 NSTL国家科技图书文献中心

Federico Canale | Maria Naya-Plasencia - 《Designs,codes and crytography》 - 2025,93(3) - 787～822 - 共36页

摘要： key recovery, and we realised that this framework | -offs, as a result of the improved key-recovery. We | rounds is a differential related-key* attack on 26* | , combined with an efficient parallel key* guessing of* | interesting subsets of the key* and a consequent list merging*

摘要： recommendation of AEAD), the key* recovery attack can only be* | misused setting), improve the key* recovery attack on* | recovery attack, based on the full key space, greatly | techniques to extend state recovery to key recovery | state recovery in the encryption phase to key recovery

关键词： Ascon-128 | Cube attack | Superpoly recovery | Key recovery

摘要： generic key* recovery attacks in this paper. First, we* | At Asiacrypt 2022, a holistic key* guessing* | strategy was proposed to yield the most efficient key | recovery for the rectangle attack. Recently, at Crypto | extend the holistic key* guessing strategy from the*

关键词： Differential cryptanalysis | Rectangle attack | Meet-in-the-middle | Key recovery | AES | KATAN | SKINNYe

摘要： influence of these key* bits on the computation, in the* | -bit key* version of Salsa20. Also, we provide* | key version of Salsa20 and the 7-round of the 128 | -bit key* version of Salsa20.* | In this paper, we present an improved attack

关键词： Salsa20 | Differential-linear cryptanalysis | Probabilistic neutral bits | Key recovery

摘要： post-quantum cryptosystems. The McEliece public-key | the secret key. This attack is twofold: (1 | ) obtaining the distance spectrum of the secret key* from* | ) reconstructing the secret key* from the distance spectrum. The* | propose another method to reconstruct the secret key

关键词： QC-MDPC | decoding error rate | distance spectrum | key recovery attack | clique problem

摘要：In this paper, we propose quantum key recovery | key schedule that applies two keys alternately. We | Simon's algorithm to this function, we construct a key | recovery attack with a complexity of O(√N log N) for N | = 2~n, where n is the block size and one secret key

关键词： Cryptanalysis | Quantum attack | Multibridge attack | Iterated even-Mansour

关键词： Quantum plaintext checking attack | Noise learning problem | Ordered search problem | Post-quantum cryptography | Quantum algorithm

摘要： Key Guessing Occlusion (KGO) that acquires a minimal | set of sample points required by the DNN for key | recovery, which we call OccPoIs. These OccPoIs provide | DNN for retrieving the key, enabling evaluators to | OccPoIs with TA can recover the key* for all the*

关键词： Side-channel analysis | Neural network | Deep learning | Profiling attack | Explainability | Feature importance | Feature selection

摘要： regarded as (practically) secure against key-recovery | structure with four 32-bit branches and a 128-bit user key | recovered a masked key* with such constants, while by* | the original user key* of these white-box SM4* | the SM4 key* expansion formula to filter out a few*

关键词： White-box cryptography | SM4 block cipher | Affine equivalence | Self-equivalence

摘要：At CRYPTO 2019, Gohr presented a key recovery | learning-assisted multi-stage key* recovery framework in* | 2022, based on which key* recovery attacks on large* | key recovery framework. This framework uses the | maintaining the accuracy of key recovery. We conduct key

关键词： Deep learning | Differential cryptanalysis | Key recovery attack | Large-state block cipher | SPECK

摘要： key recovery, and we realised that this framework | -offs, as a result of the improved key-recovery. We | rounds is a differential related-key* attack on 26* | , combined with an efficient parallel key* guessing of* | interesting subsets of the key* and a consequent list merging*

关键词： Key-recovery | Differential cryptanalysis | Parallel guessing | List merging | Generic framework | GIFT-64

4008-161-200 800-990-8900

国家科技图书文献中心

摘要： recommendation of AEAD), the key recovery attack can only be | misused setting), improve the key recovery attack on | recovery attack, based on the full key space, greatly | techniques to extend state recovery to key recovery | state recovery in the encryption phase to key recovery

关键词： Ascon-128 | Cube attack | Superpoly recovery | Key recovery

摘要： generic key recovery attacks in this paper. First, we | At Asiacrypt 2022, a holistic key guessing | strategy was proposed to yield the most efficient key | recovery for the rectangle attack. Recently, at Crypto | extend the holistic key guessing strategy from the

关键词： Differential cryptanalysis | Rectangle attack | Meet-in-the-middle | Key recovery | AES | KATAN | SKINNYe

摘要： influence of these key bits on the computation, in the | -bit key version of Salsa20. Also, we provide | key version of Salsa20 and the 7-round of the 128 | -bit key version of Salsa20. | In this paper, we present an improved attack

关键词： Salsa20 | Differential-linear cryptanalysis | Probabilistic neutral bits | Key recovery

摘要： post-quantum cryptosystems. The McEliece public-key | the secret key. This attack is twofold: (1 | ) obtaining the distance spectrum of the secret key from | ) reconstructing the secret key from the distance spectrum. The | propose another method to reconstruct the secret key

关键词： QC-MDPC | decoding error rate | distance spectrum | key recovery attack | clique problem

摘要：In this paper, we propose quantum key recovery | key schedule that applies two keys alternately. We | Simon's algorithm to this function, we construct a key | recovery attack with a complexity of O(√N log N) for N | = 2~n, where n is the block size and one secret key

关键词： Cryptanalysis | Quantum attack | Multibridge attack | Iterated even-Mansour

摘要： a classical key recovery under plaintext-checking | attacks (KR-PCA) and a quantum key recovery under chosen | -generation public-key cryptosystems. In particular, many | security of meta-cryptosystem under key reuse by mounting | quantum KR-PCA for meta-cryptosystem under key reuse

关键词： Quantum plaintext checking attack | Noise learning problem | Ordered search problem | Post-quantum cryptography | Quantum algorithm

摘要： Key Guessing Occlusion (KGO) that acquires a minimal | set of sample points required by the DNN for key | recovery, which we call OccPoIs. These OccPoIs provide | DNN for retrieving the key, enabling evaluators to | OccPoIs with TA can recover the key for all the

关键词： Side-channel analysis | Neural network | Deep learning | Profiling attack | Explainability | Feature importance | Feature selection

摘要： regarded as (practically) secure against key-recovery | structure with four 32-bit branches and a 128-bit user key | recovered a masked key with such constants, while by | the original user key of these white-box SM4 | the SM4 key expansion formula to filter out a few

关键词： White-box cryptography | SM4 block cipher | Affine equivalence | Self-equivalence

摘要：At CRYPTO 2019, Gohr presented a key recovery | learning-assisted multi-stage key recovery framework in | 2022, based on which key recovery attacks on large | key recovery framework. This framework uses the | maintaining the accuracy of key recovery. We conduct key

关键词： Deep learning | Differential cryptanalysis | Key recovery attack | Large-state block cipher | SPECK

摘要： key recovery, and we realised that this framework | -offs, as a result of the improved key-recovery. We | rounds is a differential related-key attack on 26 | , combined with an efficient parallel key guessing of | interesting subsets of the key and a consequent list merging

关键词： Key-recovery | Differential cryptanalysis | Parallel guessing | List merging | Generic framework | GIFT-64

4008-161-200 800-990-8900

国家科技图书文献中心

摘要： recommendation of AEAD), the key* recovery attack can only be* | misused setting), improve the key* recovery attack on* | recovery attack, based on the full key space, greatly | techniques to extend state recovery to key recovery | state recovery in the encryption phase to key recovery

摘要： generic key* recovery attacks in this paper. First, we* | At Asiacrypt 2022, a holistic key* guessing* | strategy was proposed to yield the most efficient key | recovery for the rectangle attack. Recently, at Crypto | extend the holistic key* guessing strategy from the*

摘要： influence of these key* bits on the computation, in the* | -bit key* version of Salsa20. Also, we provide* | key version of Salsa20 and the 7-round of the 128 | -bit key* version of Salsa20.* | In this paper, we present an improved attack

摘要： post-quantum cryptosystems. The McEliece public-key | the secret key. This attack is twofold: (1 | ) obtaining the distance spectrum of the secret key* from* | ) reconstructing the secret key* from the distance spectrum. The* | propose another method to reconstruct the secret key

摘要： Key Guessing Occlusion (KGO) that acquires a minimal | set of sample points required by the DNN for key | recovery, which we call OccPoIs. These OccPoIs provide | DNN for retrieving the key, enabling evaluators to | OccPoIs with TA can recover the key* for all the*

摘要： regarded as (practically) secure against key-recovery | structure with four 32-bit branches and a 128-bit user key | recovered a masked key* with such constants, while by* | the original user key* of these white-box SM4* | the SM4 key* expansion formula to filter out a few*

摘要：At CRYPTO 2019, Gohr presented a key recovery | learning-assisted multi-stage key* recovery framework in* | 2022, based on which key* recovery attacks on large* | key recovery framework. This framework uses the | maintaining the accuracy of key recovery. We conduct key

摘要： key recovery, and we realised that this framework | -offs, as a result of the improved key-recovery. We | rounds is a differential related-key* attack on 26* | , combined with an efficient parallel key* guessing of* | interesting subsets of the key* and a consequent list merging*