Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 360 papers for “Slide attack”

Slide attack and its applications

Uslu, Erkan · OpenMETU (Middle East Technical University) · 2019

Block ciphers, widely used in cryptography, have been designed to encrypt large amount of data such as public sector services, banking services, Healthcare contributions. With the increment of technological developments, they have also been started to be used for small data in industrial products such as Internet of Things, smart cards, car keys etc. These types of cryptosystems are called as lightweight cryptosystems. Similar to other cryptographic algorithms, the ones used in lightweight systems need to be tested towards cryptanalytic techniques. The most common techniques are differential and linear cryptanalysis. However, they become less efficient when the number of rounds in algorithms is increased. At this point, a new method called slide attack which is independent of the number of rounds is developed. This thesis focuses on the fundamentals of the slide attack and especially how it works on block ciphers. Additionally, some applications that will be beneficial to understand slide attack is given. Moreover, we give a practical attack to a variant of PRESENT lightweight block cipher.

Cited by 0Open access

Quantum slide attack on 1K-AES structure

Zheng Shen, Feng Zhang, Yongzhuang Wei et al. · Zhongguo kexue. Wulixue Lixue Tianwenxue · 2025

<p indent="0mm">With the continuous development of quantum technology, the quantum security of symmetric ciphers has attracted widespread attention. This study focuses on the security of 1K-AES, employing both quantum and classical slide attacks to analyze its security. On the one hand, for the 1K-AES with MixColumns in the last round, using the CNS algorithm achieves a success rate of 74%, an improvement from 63%, under a query complexity of <inline-formula id="INLINEA8"><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" mathsize="8.0pt"><mml:mrow><mml:mi mathsize="8.0pt" mathvariant="script">O</mml:mi></mml:mrow></mml:math></inline-formula>(2<sup>2<italic>n</italic>/5</sup>) and classical memory complexity of <inline-formula id="INLINEA9"><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" mathsize="8.0pt"><mml:mrow><mml:mi mathsize="8.0pt" mathvariant="script">O</mml:mi></mml:mrow></mml:math></inline-formula>(2<sup><italic>n</italic>/5</sup>) without the need for quantum random access memory, where <italic>n</italic> denotes the block size. When using a quantum random access memory, the universal quantum claw-finding algorithm improves the success rate to 100% with a query complexity of <inline-formula id="INLINEA10"><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" mathsize="8.0pt"><mml:mrow><mml:mi mathsize="8.0pt" mathvariant="script">O</mml:mi></mml:mrow></mml:math></inline-formula>(2<sup><italic>n</italic>/3</sup>) and quantum random memory complexity of <inline-formula id="INLINEA11"><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" mathsize="8.0pt"><mml:mrow><mml:mi mathsize="8.0pt" mathvariant="script">O</mml:mi></mml:mrow></mml:math></inline-formula>(2<sup><italic>n</italic>/3</sup>). Additionally, under the chosen plaintext attack, the success rate of the classical slide attack is also increased to 100%. On the other hand, for the 1K-AES with no MixColumns in the last round, the universal quantum claw-finding algorithm is used to perform a quantum slide attack, with both time and memory complexity of <inline-formula id="INLINEA12"><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" mathsize="8.0pt"><mml:mrow><mml:mi mathsize="8.0pt" mathvariant="script">O</mml:mi></mml:mrow></mml:math></inline-formula>(2<sup><italic>n</italic>/3</sup>). Compared with the classical slide attack, this method achieves sub-exponential acceleration; compared with Grover’s search, the query complexity reduces from <inline-formula id="INLINEA13"><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" mathsize="8.0pt"><mml:mrow><mml:mi mathsize="8.0pt" mathvariant="script">O</mml:mi></mml:mrow></mml:math></inline-formula>(2<sup><italic>n</italic>/2</sup>) to <inline-formula id="INLINEA14"><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" mathsize="8.0pt"><mml:mrow><mml:mi mathsize="8.0pt" mathvariant="script">O</mml:mi></mml:mrow></mml:math></inline-formula>(2<sup><italic>n</italic>/3</sup>).

Cited by 0Open access

Similarity Property and Slide Attack of Block Cipher FESH

Yafei Zheng, Wenling Wu · IET Information Security · 2023

This paper focuses on similarity properties and extension of the classical slide property of block ciphers. Taking FESH, an award‐winning block cipher of the National Cryptographic Algorithm Design Competition 2019, as an example, similarity properties of the encryption and key transformation are found, owing to the similar structures that the encryption and key transformation adopted, and the constants generation. Based on the similarity properties, extended slide properties can be constructed for FESH. Slide attacks of FESH are then proposed. The similarity properties and extended slide property are immune to the increasing of iterated rounds, i.e., it cannot be avoided by increasing the round number of FESH. Furthermore, extended slide property helps relaxing the strict requirements of the subkeys in slide attacks. Taking Feistel and SPN structures as examples, frameworks of slide attacks based on the extended slide properties are presented. Slide attack of FESH is exactly a concrete example of SPN structure.

Cited by 1Open access

Slide Property of RAKAPOSHI and Its Application to Key Recovery Attack

Takanori Isobe, Toshihiro Ohigashi, Masakatu Morii · Journal of Information Processing · 2013

This paper gives a first security evaluation of a lightweight stream cipher RAKAPOSHI. In particular, we analyze a slide property of RAKAPOSHI such that two different Key-IV pairs generate the same keystream but n-bit shifted. To begin with, we demonstrate that any Key-IV pair has a corresponding slide Key-IV pair that generates an n-bit shifted keystream with a probability of 2-2n. In order to experimentally support our results, some examples of such pairs are given. Then, we show that this property is able to be converted into key recovery attacks on RAKAPOSHI. In the related-key setting, our attack based on the slide property can recover a 128-bit key with a time complexity of 241 and 238 chosen IVs. Moreover, by using a variant of slide property called partial slide pair, this attack is further improved, and then a 128-bit key can be recovered with a time complexity of 233 and 230 chosen IVs. Finally, we present a method for speeding up the brute force attack by a factor of 2 in the single key setting.

Cited by 0Open access

An Improved Algorithm of Key Stream Extraction with Slide Attack Resistant

DING Jie,SHI Hui,GONG Jing,DENG Yuanqing · SHILAP Revista de lepidopterología · 2018

In order to enhance the ability of the stream cipher algorithm for Leak Extraction(LEX) in resisting slide attack,16 bytes from the intermediate variable are extracted at each key expansion of Advanced Encryption Standard(AES),and they are used as the secret key K in the next AES.The key system of LEX is improved.On this basis,the safety and operating speed of the improved LEX algorithm is analyzed.The simulation based on C++ is also conducted to test the key stream randomness of the improved LEX algorithm.The results show that the improved algorithm can resist slide attack with the same computing speed and key stream randomness in the LEX algorithm.

Cited by 0Open access

TMD-Tradeoff and Slide Attack Analysis on the Novel ZUC-PRN Model

Jayati Dutta, Priyanka Peri, Rohith Malkuchi · 2024

The rapid evolution of wireless communication technologies is epitomized by the advent of 5G-Advanced and the forthcoming 6G era. While 5G-Advanced enhances existing capabilities, 6G aims to seamlessly integrate AI-driven intelligence and sophisticated cryptographic techniques, significantly bolstering security. This paper explores the ZUC-PRN model [1], a neural network-based cipher inspired by the ZUC algorithm, proposed for enhancing wireless security in 5G and 6G networks. While ZUC-PRN shows potential for replacing traditional FSM-based ciphers, its resilience against various attacks remains unverified. We analyze its vulnerabilities to Slide and Time-Memory-Data Tradeoff (TMDT) attacks and assess its computational complexity, comparing it with the standard ZUC stream cipher. This study provides critical insights into the security and efficiency of the ZUC-PRN model, contributing to the development of more robust encryption methods for next-generation communication systems.

Cited by 1

Slide Attack on Full-Round ULC Lightweight Block Cipher Designed for IoT

Kai Zhang, Xuejia Lai, Lei Wang et al. · Security and Communication Networks · 2022

To meet the security demand for IoT devices, many new lightweight block ciphers are proposed. ULC is a lightweight block cipher designed for the IoT. It has many advantages in terms of memory use, efficiency, and security. In this paper, a slide attack on full-round ULC is proposed in a related key setting. First, two properties on ULC are discovered. The first property is presented to illustrate the property of a slid pair for ULC. The second property is introduced to construct a link between some round key bits and some master key bits. Based on these properties, a key recovery attack on ULC is proposed. In this attack, with the condition of one related key, all the 80 master key bits can be recovered with the data complexity of O(232), the memory complexity of O(232), and the time complexity of O(263). The result of this paper indicates that ULC can’t resist slide attack in related key settings.

Cited by 2Open access

Slide Attacks

Karolína Zenknerová · Digital Repository (National Repository of Grey Literature) · 2022

Slide attack is an attack against block ciphers which have all rounds the same. The success and the complexity of the attack is independent on the number of rounds. The original slide attack was mainly used on a Feistel structure, but very rarely on SPN networks, because in general, SPN networks have the last round diferent. This property does not allow to use normal slide attack. In the paper New slide attacks on almost self-similar ciphers by Orr Dunkelman, Nathan Keller, Noam Lasry, and Adi Shamir are introduced new slide attacks (four of them) which focus on SPN networks and they overcome a problem of the last round. In this thesis we explain main idea of the original slide attack and the main idea of two new slide attacks - a slid sets attack and a slide attack using a hypercube of slid pairs. In both these attacks we create and use special structures of plaintexts and ciphertexts to get more pairs of plaintexts which we call slid pairs. Moreover, we explain some selected parts of two new slide attacks and we compute the complexity. 1

Cited by 0

Durability and fatigue life prediction of cantilever anti-slide piles under combined thrust loading and sulfate attack

Yanping Jia, Qingyang Ren · AIP Advances · 2025

To address the lack of rapid assessment models for evaluating the fatigue life of cantilever anti-slide piles under complex environmental conditions, this study establishes predictive models for reinforcement corrosion initiation time and fatigue life under combined thrust loading and sulfate attack, based on laboratory tests and theoretical analysis. The results show that the neutralization rate of concrete under acid rain immersion and wet-dry cycling is ∼1.60 times that under natural conditions. The predicted reinforcement corrosion initiation time is 26.8 years in Case 1, representing a 5.96% decrease compared to the previous model, and 88.6 years in Case 2, a 61.09% increase. The predicted fatigue life is 3.36 times and 5.48 times higher than the original model, respectively, and the reinforcement corrosion initiation time exhibits an exponential relationship with the residual fatigue life (R2 = 0.957). The fatigue life model established from experimental data shows good agreement with the results, with predictions significantly improved over the original model, meeting general design service life requirements. The proposed models not only provide a quantitative tool for durability assessment of cantilever anti-slide piles under acid rain and sulfate environments but also offer a scientific basis for engineering design and life prediction.

Cited by 0Open access

Supplementary Information - Solar Radiation Modification workshop materials

Purdue University Institute for a Sustainable Future, Australian Commonwealth Scientific and Industrial Research Organisation, Sandia National Laboratories · Zenodo (CERN European Organization for Nuclear Research) · 2025

- Solar Radiation Modification 2030 attack scenario and role definitions - Solar Radiation Modification advance briefing notes - Solar Radiation Modification 2050 attack scenario slide

Cited by 0Open access

Supplementary Information - Solar Radiation Modification workshop materials

Purdue University Institute for a Sustainable Future, Australian Commonwealth Scientific and Industrial Research Organisation, Sandia National Laboratories · Zenodo (CERN European Organization for Nuclear Research) · 2025

- Solar Radiation Modification 2030 attack scenario and role definitions - Solar Radiation Modification advance briefing notes - Solar Radiation Modification 2050 attack scenario slide

Cited by 0Open access

Quantum Attacks on 1K-AES and PRINCE

Bin‐Bin Cai, Yusen Wu, Jing Dong et al. · The Computer Journal · 2021

Abstract By introducing the BHT algorithm into the slide attack on 1K-AES and the related-key attack on PRINCE, we present the corresponding quantum attacks in this paper. In the proposed quantum attacks, we generalize the BHT algorithm to the situation where the number of marked items is unknown ahead of time. Moreover, we give an implementation scheme of classifier oracle based on Quantum Phase Estimation algorithm in presented quantum attacks. The complexity analysis shows that the query complexity, time complexity and memory complexity of the presented quantum attacks are all $\mathcal{O}(2^{n/3})$ when the success probability is about $63\%$, where $n$ is the block size. Compared with the corresponding classical attacks, the proposed quantum attacks can achieve subquadratic speed-up under the same success probability no matter on query complexity, time complexity or memory complexity. Furthermore, the query complexity of the proposed quantum slide attack on 1K-AES is less than Grover search on 1K-AES by a factor of $2^{n/6}.$ When compared with the Grover search on PRINCE, the query complexity of the presented quantum attack on PRINCE is reduced from $\mathcal{O}(2^{n})$ to $\mathcal{O}(2^{n/2}).$ When compared with the combination of Grover and Simon’s algorithms on PRINCE, the query complexity of our quantum attack on PRINCE is reduced from $\mathcal{O}(n\cdot 2^{n/2})$ to $\mathcal{O}(2^{n/2}).$ Besides, the proposed quantum slide attack on 1K-AES indicates that the quantum slide attack could also be applied on Substitution-Permutation Network construction, apart from the iterated Even-Mansour cipher and Feistel constructions.

Cited by 14

Slide atak ve uygulamaları.

Uslu, Erkan · OpenMETU (Middle East Technical University) · 2017

Block ciphers, widely used in cryptography, have been designed to encrypt large amount of data such as public sector services, banking services, Healthcare contributions. With the increment of technological developments, they have also been started to be used for small data in industrial products such as Internet of Things, smart cards, car keys etc. These types of cryptosystems are called as lightweight cryptosystems. Similar to other cryptographic algorithms, the ones used in lightweight systems need to be tested towards cryptanalytic techniques. The most common techniques are differential and linear cryptanalysis. However, they become less efficient when the number of rounds in algorithms is increased. At this point, a new method called slide attack which is independent of the number of rounds is developed. This thesis focuses on the fundamentals of the slide attack and especially how it works on block ciphers. Additionally, some applications that will be beneficial to understand slide attack is given. Moreover, we give a practical attack to a variant of PRESENT lightweight block cipher.

Cited by 0

A Sophisticated Slide Mode Controller of Microgrid System Load Frequency Control Under False Data Injection Attack and Actuator Time Delay

Mohamad Issa Ibraheem, Mehdi Edrisi, Hassan Haes Alhelou et al. · IEEE Transactions on Industry Applications · 2023

Load frequency control (LFC) is a crucial application in modern power systems as it ensures the system frequency remains within an acceptable range through demand control and active power generation. However, as information and communication technology (ICT) becomes more prevalent in power system, there are both opportunities for improved reliability and efficiency as well as potential security threats. This article proposes an LFC approach that takes into account the simultaneous occurrence of false data injection (FDI) attacks on the sensor-controller side, disturbances in the states of the system and time delays in the controller-actuator side. To tackle these challenges, a slide mode observer is utilized to estimate system states and detect cyber-attack signals as an extra virtual state. Subsequently, a cyber-attack-resilient predictor slide mode controller is designed to establish a robust control law capable of overcoming system challenges, when all system states are not within reach. Therefore, the robust control law is designed based on the estimated states, cyber signal and measured system output. By integrating these techniques, the proposed methodology offers a promising solution to enhance the resilience and performance of power system faced with cybersecurity threats. It improves the response speed of the system and minimizes the maximum overshoot compared to some published resilience control laws, thereby ensuring secure and reliable load frequency control. Additionally, reducing the number of sensors in the system helps to reduce overall costs. Finally, the performance of the controller is also verified in real-time using the OPAL-RT simulator testbed.

Cited by 41

Preparing to Attack

Journal of Bioresource Management · 1918

A glass plate stereoview slide with handwritten label Éparges, 1918, préparatifs d'attaque (Éparges, 1918, Preparing to attack). A soldier with back turned to camera standing in a trench preparing to attack the enemy. The photograph was taken in France during World War I.

Cited by 0

Reflections on Slide with a Twist Attacks.

Itai Dinur, Orr Dunkelman, Nathan Keller et al. · 2014

Abstract. Slide attacks use pairs of encryption operations which are slid against each other. Slide with a twist attacks are more sophisticated variants of slide attacks which slide an encryption operation against a decryption operation, and were used in 2000 to attack several cryp-tosystems, including DESX, the Even-Mansour construction, and Feistel structures with four-round self-similarity. They were further extended in 2012 to the mirror slidex framework, which was used to attack 20-round GOST and several additional variants of the Even-Mansour construction. In this paper, we revisit all the previously published applications of these techniques and show that in almost all cases, the same or better results can be achieved by a simpler attack which is based on the seemingly unrelated idea of exploiting their internal fixed points. The observation that such fixed points can be useful in cryptanalysis had already been pointed out in 2007 by Kara, but all the examples he gave for his re-flection attack were based on particular constructions such as Feistel structures or GOST key schedules in which it was easy to explicitly list and count their fixed points. In this paper, we generalize Kara’s reflec-tion attack by using the combinatorial result that random involutions on 2n values are expected to have a surprisingly large number of O(2n/2) fixed points (whereas random permutations are expected to have only O(1) fixed points). This makes it possible to reduce the complexity of the best known attack on additional cryptographic schemes in which it is difficult to explicitly characterize and count their internal fixed points.

Cited by 0