China
Africa
Explore chapters and articles related to this topic
Security Challenges and Solutions in IoT Networks for the Smart Cities
Published in Mohammad Ayoub Khan, Internet of Things, 2022
Password Attacks: This set of attacks targets to achieve unauthorized access and possibly impersonation through maliciously bypassing password authentication mechanisms [48]. Examples of such attacks include brute force attacks and dictionary attacks. Brute force attacks attempt to try all the possible combinations of passwords one by one taking a trial and error approach. Dictionary attacks, on the other hand, adopt a smarter approach as they use a large dictionary of meaningful words and popular or previously used passwords. IoT devices have been subject to such attacks as the Mirai incident has clearly demonstrated [69].
Layers of Security for Active RFID Tags
Published in Syed Ahson, Mohammad Ilyas, RFID Handbook, 2017
Shenchih Tung, Swapna Dontharaju, Leonid Mats, Peter J. Hawrylak, James T. Cain, Marlin H. Mickle, Alex K. Jones
A brute force attack is an approach to guess a secret key of an encryption algorithm or to gain an access of a computer resource by exhaustively trying all possible keys. For example, to search the 56-bit secret key of a DES encryption system, a hacker needs to try 256 possible keys, meaning 255 trials (36 × 1015 trials), to find the match. To exhaustively compute this is easily accomplished within ~7 days as illustrated by the study of Kumar et al. [5].
A novel Sine–Tangent–Sine chaotic map and dynamic S-box-based video encryption scheme
Published in The Imaging Science Journal, 2023
A robust cryptosystem should have a large key space to prevent brute-force attacks [56]. In a brute force attack, an attacker tries all the possible combinations of the secret key to access the secret information. The key stream for the proposed scheme contains a 96-bit secret key,96-bit initial parameter and S-box of length 256. Therefore, the attacker has to try combinations to access a video frame. If the video contains n video frames, then to access the complete video, then the attacker has to try combinations. Moreover, in the dynamic diffusion step, the chaotic map that has been used is also not fixed and is selected randomly using Equation 14. Therefore, to know the chaotic map that has been used for n frames the attacker has to try possible combinations. Hence total of possible combinations. Owing to large keyspace and unpredictable steps involved in the encryption scheme, brute force attack is not possible.
Designing of an optical vortices phase mask and used in the frequency domain of linear canonical transform for double image encryption
Published in The Imaging Science Journal, 2020
H. Singh, V. Tirth, R. K. Singh, A. Algahtani, S. Islam
A brute force attack (also known as brute force cracking) is the cyber-attack equivalent of trying every key on your key ring, and eventually finding the right one. Brute force attacks are the common of available attacks. It involves approximating the keys of a cryptosystem by random guesses and then using it to decipher the cipher text. The process is repeated until the attacker finds the correct key. For example there are two RPMs have a size × pixels, if each pixel can take on possible phase values then to retrieve both the keys, it requires a maximum of attempts. For any application values of and , this number is very large and increases, in the proposed scheme size of images as well as the size of keys are 256 × 256. Let = 64 phase levels and pixels. Then the number of keys would be ∼ . Optical vortex used in frequency plane and have focal length, wavelength, topological charge and pixel spacing and able to resist the brute-force attack.