Results 31 to 40 of about 2,850 (241)
Practical Algebraic Attack on DAGS [PDF]
DAGS scheme is a key encapsulation mechanism (KEM) based on quasi-dyadic alternant codes that was submitted to NIST standardization process for a quantum resistant public key algorithm. Recently an algebraic attack was devised by Barelli and Couvreur (Asiacrypt 2018) that efficiently recovers the private key.
Bardet, Magali +3 more
openaire +3 more sources
Analysis of the algebraic side channel attack [PDF]
At CHES 2009, Renauld, Standaert and Veyrat-Charvillon introduced a new kind of attack called Algebraic Side-Channel Attacks (ASCA). They showed that side-channel information leads to effective algebraic attacks. These results are mostly experiments strongly based on a the use of a SAT-solver.
Carlet, Claude +3 more
openaire +3 more sources
An efficient deep learning model for brain tumour detection with privacy preservation
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
Detecting Man-in-the-Middle Attacks by Precise Timing [PDF]
Man-in-the-middle attacks are one of the most popular and fundamental attacks on distributed systems that have evolved with advances in distributed computing technologies and have assumed several shapes ranging from simple IP spoofing to complicated ...
Hamilton, Geoff W. +6 more
core +1 more source
New Low-Memory Algebraic Attacks on LowMC in the Picnic Setting
The security of the post-quantum signature scheme Picnic is highly related to the difficulty of recovering the secret key of LowMC from a single plaintext-ciphertext pair.
Fukang Liu +3 more
doaj +3 more sources
Algebraic and quantum attacks on two digital signature schemes
In this article, we analyze two digital signature schemes, proposed in Moldovyan et al., that use finite noncommutative associative algebras as underlying platforms.
Roman’kov Vitaly +2 more
doaj +1 more source
Advanced Algebraic Attack on Trivium [PDF]
This paper presents an algebraic attack against Trivium that breaks 625 rounds using only 4096 bits of output in an overall time complexity of $$2^{42.2}$$ Trivium computations. While other attacks can do better in terms of rounds 799, this is a practical attack with a very low data usage down from $$2^{40}$$ output bits and low computation time down ...
Frank-M. Quedenfeld, Christopher Wolf
openaire +2 more sources
In this paper, we propose and evaluate a method for generating key-dependent feedback configurations (KDFC) for $\sigma $ -LFSRs. $\sigma $ -LFSRs with such configurations can be applied to any stream cipher that uses a word-based LFSR.
Subrata Nandi +3 more
doaj +1 more source
Review of algebraic attacks on stream ciphers
The basic theory and realizing methods of algebraic attacks on stream ciphers are presented.Then the algebraic attacks on stream ciphers with linear feedback shift register and the efficient techniques to decrease the degree of the nonlinear equations ...
ZHANG Long1, WU Wen-ling2, WEN Qiao-yan1
doaj +2 more sources
Protecting Obfuscation against Algebraic Attacks [PDF]
Recently, Garg, Gentry, Halevi, Raykova, Sahai, and Waters (FOCS 2013) constructed a general-purpose obfuscating compiler for NC1 circuits. We describe a simplified variant of this compiler, and prove that it is a virtual black box obfuscator in a generic multilinear map model.
Boaz Barak +4 more
openaire +2 more sources

