Results 31 to 40 of about 1,704 (217)

Possibility of decryption speed-up by parallel processing in CCA secure hashed ElGamal.

open access: yesPLoS ONE, 2023
In order to prove the ElGamal CCA(Chosen Ciphertext Attack) security in the random oracle model, it is necessary to use the group where ICDH(Interactive Computational Diffie Hellman) assumption holds. Until now, only bilinear group with complex algebraic
Gyu Chol Kim   +4 more
doaj   +1 more source

Advanced Algebraic Attack on Trivium [PDF]

open access: yes, 2016
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

Searching for an Efficient System of Equations Defining the AES Sbox for the QUBO Problem

open access: yesJournal of Telecommunications and Information Technology, 2023
The time complexity of solving the QUBO problem depends mainly on the number of logical variables in the problem. This paper focuses mainly on finding a system of equations that uniquely defines the Sbox of the AES cipher and simultaneously allows us to
Elżbieta Burek   +2 more
doaj   +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

Protecting Obfuscation against Algebraic Attacks [PDF]

open access: yes, 2014
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

Chosen-IV Algebraic Attack on Randomized Ciphers FASTA and HERA

open access: yesIACR Transactions on Symmetric Cryptology
Fully homomorphic encryption (FHE) enables computation on encrypted data without decryption, providing strong guarantees for privacy-preserving applications.
Fukang Liu   +6 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

Adaptive Observer for Coupled Wave PDE and Infinite ODE With Sampled Data and Unknown Input: Application to Brain Hemodynamics Estimation

open access: yesInternational Journal of Adaptive Control and Signal Processing, EarlyView.
This article proposes a convergent adaptive observer for a damped wave PDE and an infinite‐dimensional ODE coupled in cascade using sampled‐in‐space ODE state measurements. The proposed observer estimates the distributed states of the PDE and ODE along with unknown PDE parameters and spatial input.
Zehor Belkhatir   +2 more
wiley   +1 more source

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

Algebraic Attacks and Decomposition of Boolean Functions [PDF]

open access: yes, 2004
Algebraic attacks on LFSR-based stream ciphers recover the secret key by solving an overdefined system of multivariate algebraic equations. They exploit multivariate relations involving key bits and output bits and become very efficient if such relations of low degrees may be found.
Willi Meier, Enes Pasalic, Claude Carlet
openaire   +1 more source

Home - About - Disclaimer - Privacy