Results 11 to 20 of about 487 (136)

An efficient deep learning model for brain tumour detection with privacy preservation

open access: yesCAAI Transactions on Intelligence Technology, EarlyView., 2023
Abstract Internet of medical things (IoMT) is becoming more prevalent in healthcare applications as a result of current AI advancements, helping to improve our quality of life and ensure a sustainable health system. IoMT systems with cutting‐edge scientific capabilities are capable of detecting, transmitting, learning and reasoning.
Mujeeb Ur Rehman   +8 more
wiley   +1 more source

A Bound of Fast Algebraic Immunity of Constructions With BPR Using a Four-Disjoint-Part Support

open access: yesIEEE Access, 2020
Boolean functions are used for stream cipher ought to be a high fast algebraic immunity (FAI) to effectively against fast algebraic attacks. In the previous research methods, there is no suitable method to gain the FAI of Boolean functions using ...
Kai Xu, Ying Zhang, Jing Wang
doaj   +1 more source

Improved Twofish Algorithm: A Digital Image Enciphering Application

open access: yesIEEE Access, 2021
With the growth of networks, the Internet of Things (IoT) and new cyber attacks pose threats to privacy and security, secure communication is therefore becoming one of the most crucial concerns.
Tanveer ul Haq   +5 more
doaj   +1 more source

Hybrid tabu search algorithm for excellent Boolean function

open access: yesTongxin xuebao, 2022
Boolean function in symmetric cryptographic algorithm must satisfy excellent cryptographic criteria to ensure the security of the algorithm.By combining the advantages of tabu search algorithm and hill climbing algorithm, a new heuristic generation ...
Weiqiong WANG   +3 more
doaj   +2 more sources

A Lower Bound of Fast Algebraic Immunity of a Class of 1-Resilient Boolean Functions

open access: yesIEEE Access, 2019
Boolean functions should possess high fast algebraic immunity when used in stream ciphers in order to stand up to fast algebraic attacks. However, in previous research, the fast algebraic immunity of Boolean functions was usually calculated by the ...
Yindong Chen   +3 more
doaj   +1 more source

Generating highly nonlinear resilient Boolean functions resistance against algebraic and fast algebraic attacks [PDF]

open access: yesSecurity and Communication Networks, 2014
ABSTRACTBoolean functions play an important role in the design of stream ciphers. In this paper, a simulated annealing algorithm is designed to obtain Boolean functions satisfying all the needed criteria: high nonlinearity, 1‐resiliency, optimal algebraic degree, optimal (or suboptimal) algebraic immunity, and good immunity to fast algebraic attacks ...
Jun-Po Yang, Wei-Guo Zhang
openaire   +1 more source

Fast Algebraic Immunity of $2^m+2$ & $2^m+3$ Variables Majority Function

open access: yesIEEE Access, 2019
Boolean functions should possess high fast algebraic immunity (FAI) when it is used in stream ciphers in order to stand up to fast algebraic attacks. However, in previous research, the FAI of Boolean functions was usually calculated by computer.
Yindong Chen   +3 more
doaj   +1 more source

Constructing Two Classes of Boolean Functions With Good Cryptographic Properties

open access: yesIEEE Access, 2019
Wu et al. proposed a generalized Tu-Deng conjecture over $\mathbb {F}_{2^{rm}}\times {\mathbb {F}_{2^{m}}}$ , and constructed Boolean functions with good properties. However the proof of the generalized conjecture is still open.
Yindong Chen   +3 more
doaj   +1 more source

Audio Encryption Scheme Using Self-Adaptive Bit Scrambling and Two Multi Chaotic-Based Dynamic DNA Computations

open access: yesIEEE Access, 2020
In this paper, a novel scheme for secure audio transmission is introduced. The novelty of this scheme is that it combines four different techniques for audio encryption in the same scheme which makes it more secure: self-adaptive scrambling, multi ...
Roayat Ismail Abdelfatah
doaj   +1 more source

Rewriting Variables: The Complexity of Fast Algebraic Attacks on Stream Ciphers [PDF]

open access: yes, 2004
Recently proposed algebraic attacks [2,6] and fast algebraic attacks [1,5] have provided the best analyses against some deployed LFSR-based ciphers. The process complexity is exponential in the degree of the equations. Fast algebraic attacks were introduced [5] as a way of reducing run-time complexity by reducing the degree of the system of equations ...
Philip Hawkes, Gregory G. Rose
openaire   +2 more sources

Home - About - Disclaimer - Privacy