Results 31 to 40 of about 3,008 (246)

Algebraic Attacks on RFID Protocols [PDF]

open access: yes, 2009
This work aims to identify the algebraic problems which enable many attacks on RFID protocols. Toward this goal, three emerging types of attacks on RFID protocols, concerning authentication, untraceability, and secrecy are discussed. We demonstrate the types of attacks by exhibiting previously unpublished vulnerabilities in several protocols and ...
Ton van Deursen, Sasa Radomirovic
openaire   +4 more sources

Algebraic Attacks Galore! [PDF]

open access: yesGroups – Complexity – Cryptology, 2009
Summary: This is the first in a two-part survey of current techniques in algebraic cryptanalysis. After introducing the basic setup of algebraic attacks and discussing several attack scenarios for symmetric cryptosystems, public key cryptosystems, and stream ciphers, we discuss a number of individual methods. The XL, XSL, and MutantXL attacks are based
openaire   +1 more source

Algebraic Attacks on Combiners with Memory [PDF]

open access: yes, 2003
Recently, algebraic attacks were proposed to attack several cryptosystems, e.g. AES, LILI-128 and Toyocrypt. This paper extends the use of algebraic attacks to combiners with memory. A (k,l)-combiner consists of k parallel linear feedback shift registers (LFSRs), and the nonlinear filtering is done via a finite automaton with k input bits and l memory ...
Armknecht, Frederik, Krause, Matthias
openaire   +1 more source

Practical Cube Attack against Nonce-Misused Ascon

open access: yesIACR Transactions on Symmetric Cryptology, 2022
Ascon is a sponge-based Authenticated Encryption with Associated Data that was selected as both one of the winners of the CAESAR competition and one of the finalists of the NIST lightweight cryptography standardization effort.
Jules Baudrin   +2 more
doaj   +1 more source

Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks [PDF]

open access: yes, 2006
In this paper we propose several efficient algorithms for assessing the resistance of Boolean functions against algebraic and fast algebraic attacks when implemented in LFSR-based stream ciphers. An algorithm is described which permits to compute the algebraic immunity d of a Boolean function with n variables in $\mathcal{O}(D^2)$ operations, for $D ...
Armknecht, Frederik   +5 more
openaire   +3 more sources

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

Efficient Image Encryption Based on New Substitution Box Using DNA Coding and Bent Function

open access: yesIEEE Access, 2022
This study contributes to creating an unbreakable S-Box based on a strong bent function expanded by DNA sequences and investigates and analyzes the strength of the proposed S-Box against major standard criteria and benchmarks, such as interpolation ...
Hend Ali Mohammed Ali Basha   +3 more
doaj   +1 more source

Yoneda Hacking: The Algebra of Attacker Actions

open access: yesACM Transactions on Cyber-Physical Systems, 2022
Our work focuses on modeling the security of systems from their component-level designs. Towards this goal, we develop a categorical formalism to model attacker actions. Equipping the categorical formalism with algebras produces two interesting results for security modeling.
Georgios Bakirtzis   +2 more
openaire   +2 more sources

Algebraic Attacks on Summation Generators [PDF]

open access: yes, 2004
We apply the algebraic attacks on stream ciphers with memories to the summation generator. For a summation generator that uses n LFSRs, an algebraic equation relating the key stream bits and LFSR output bits can be made to be of degree less than or equal to \(^{\lceil\log_2 n \rceil}\) using ⌈log2 n ⌉ + 1 consecutive key stream bits. This is much lower
Dong Hoon Lee 0002   +4 more
openaire   +2 more sources

Accuracy and applicability of periodontitis risk assessment tools: A critical appraisal

open access: yesPeriodontology 2000, EarlyView., 2023
Abstract Currently, periodontal risk assessment finds application at first visit (to identify individuals at high risk of either disease incidence, if still healthy, or disease progression, if already diseased) as well as at patient monitoring after active treatment and enrolment in a supportive periodontal care program.
Roberto Farina   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy