Results 21 to 30 of about 1,611 (184)
Possibility of decryption speed-up by parallel processing in CCA secure hashed ElGamal.
PLoS 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
Accuracy and applicability of periodontitis risk assessment tools: A critical appraisal
Periodontology 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
Searching for an Efficient System of Equations Defining the AES Sbox for the QUBO Problem
Journal 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
Polynomial equation in algebraic attack on NTRU-HPS and NTRU-HRSS [PDF]
ITM Web of ConferencesNTRU is a lattice-based public-key cryptosystem designed by Jeffrey Hoffstein, Jill Pipher, and Joseph H. Silverman in 1996. NTRU published on Algorithmic Number Theory Symposium (ANTS) in 1998.
Paradise Fadila, Sugeng Kiki Ariyanti
doaj +1 more source
Efficient Image Encryption Based on New Substitution Box Using DNA Coding and Bent Function
IEEE 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
Advanced Algebraic Attack on Trivium [PDF]
, 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 +1 more source
Algebraic attacks using SAT-solvers
Groups – Complexity – Cryptology, 2010 An algebraic attack on a cryptosystem consists of transforming the problem into the solution of a system of polynomial equations, usually over a finite field. The paper ``Algebraic attacks using SAT-solvers'' discusses different ways to efficiently transform the polynomial system into a logical clause.
Jovanovic, Philipp, Kreuzer, Martin
openaire +1 more source
Practical Algebraic Attack on DAGS [PDF]
, 2019 16 pages, accepted for publication in the 7th Code-Based Cryptography Workshop ...
Bardet, Magali +3 more
openaire +3 more sources
Algebraic Attacks on RFID Protocols [PDF]
, 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 ...
van Deursen, Ton, Radomirović, Saša
openaire +2 more sources
Chosen-IV Algebraic Attack on Randomized Ciphers FASTA and HERA
IACR Transactions on Symmetric CryptologyFully 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