Results 91 to 100 of about 6,661,504 (214)
Superposition Attacks on Pseudorandom Schemes Based on Two or Less Permutations
IET Information Security, Volume 2024, Issue 1, 2024.We study quantum superposition attacks against permutation‐based pseudorandom cryptographic schemes. We first extend Kuwakado and Morii’s attack against the Even–Mansour cipher and exhibit key recovery attacks against a large class of pseudorandom schemes based on a single call to an n‐bit permutation, with polynomial O(n) (or O(n2), if the concrete ...
Shaoxuan Zhang +3 more
wiley +1 more source
Generalized birthday attacks on unbalanced Feistel networks [PDF]
, 1998 Unbalanced Feistel networks F k which are used to construct invertible pseudo-random permutations from kn bits to kn bits using d pseudo-random functions from n bits to (k − l)n bits, k ≥ 2 are studied. We show a new generalized birthday attack on F k , with d ≤ 3k − 3.
openaire +1 more source
, 2011 This work presents a contribution to secure the routing protocol GPSR (Greedy Perimeter Stateless Routing) for vehicular ad hoc networks, we examine the possible attacks against GPSR and security solutions proposed by different research teams working on ...
Erritali, Mohammed +2 more
core +1 more source
Enhancing Image Cryptography Performance with Block Left Rotation Operations
Applied Computational Intelligence and Soft Computing, Volume 2024, Issue 1, 2024.In today’s interconnected world, the transmission of both lengthy and concise text messages is ubiquitous across diverse communication platforms. With the proliferation of sensitive and specialized information being exchanged, safeguarding these messages from potential threats such as intruders, abusers, and data hackers becomes imperative.
Mohammad Subhi Al-Batah +4 more
wiley +1 more source
Dynamic MDS Matrices for Substantial Cryptographic Strength [PDF]
, 2011 Ciphers get their strength from the mathematical functions of confusion and diffusion, also known as substitution and permutation. These were the basics of classical cryptography and they are still the basic part of modern ciphers.
Malik, Muhammad Yasir, No, Jong-Seon
core +2 more sources
An Efficient Ontology‐Based Semantic Interoperability Using MSGO‐RNN in Cloud Computing
Journal of Optimization, Volume 2024, Issue 1, 2024.Semantic interoperability (SI) is defined as the capability of interpreting the nature of the information exchanged inside cloud computing (CC). For SI, ontology is selected as a solution. A hierarchical structure is offered by an ontology that comprises semantic relations between the application and the cloud server (CS). Even though different methods
Chithambaramani R. +4 more
wiley +1 more source
Towards Analyzable Design Paradigms for Chaos-Based Cryptographic Primitives
Journal of Cybersecurity and PrivacyAlthough many chaos-based cryptosystems have been proposed over the past decade, they have yet to gain traction in real-world applications. A key reason for this is that most designs rely on security through obscurity, with unnecessarily complex ...
Abubakar Abba +3 more
doaj +1 more source
Energy Efficient Encryption Algorithm for Low Resources Devices
ARCHive-SR, 2019 Saving energy is one of the most challenging aspects in the wireless network devices. Such devices are connected together to perform a certain task. A well-known example of these structures is the Wireless Sensor Network (WSN).
Bassam W. Aboshosha +2 more
doaj +1 more source
Feistel network-based prefix-preserving network trace anonymization [PDF]
, 2022 A Thesis Submitted to the Faculty of Graduate Studies and Research in Partial Fulfillment for the Requirements for the Degree of Master of Science in Computer Science, University of Regina. xv, 105 p. Network traces represent a critical piece of data for the network security analysts to ensure the security of the data and detecting/correcting network ...
openaire
Computer-Aided Proof for Extended Generalized Feistel Networks
IACR Transactions on Symmetric Cryptology(Multi-branch) Generalized Feistel Network (GFN) enables the construction of block ciphers from non-linear components with small domains, and has been adopted in various block ciphers. Berger et al. (SAC 2013) introduced the Extended Generalized Feistel
Yuchao Chen +6 more
doaj +1 more source