Results 31 to 40 of about 1,782,571 (254)
Investigating the cohomological dimensions of Mg [PDF]
, 2016 We discuss the problem of determining the de Rham, Dolbeault and algebraic cohomological dimension of the moduli space Mg of Riemann surfaces of genus g, focusing on possible strategies of attack and then concentrating on exhaustion functions.
MONDELLO, GABRIELE
core +1 more source
Explicit MDS Codes with Complementary Duals [PDF]
, 2017 In 1964, Massey introduced a class of codes with complementary duals which are called Linear Complimentary Dual (LCD for short) codes. He showed that LCD codes have applications in communication system, side-channel attack (SCA) and so on. LCD codes have
Beelen, Peter, Jin, Lingfei
core +2 more sources
A Method of Ultra-Large-Scale Matrix Inversion Using Block Recursion
Information, 2020 Ultra-large-scale matrix inversion has been applied as the fundamental operation of numerous domains, owing to the growth of big data and matrix applications.
HouZhen Wang, Yan Guo, HuanGuo Zhang
doaj +1 more source
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
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
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
Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions
, 2009 Algebraic and fast algebraic attacks are power tools to analyze stream ciphers. A class of symmetric Boolean functions with maximum algebraic immunity were found vulnerable to fast algebraic attacks at EUROCRYPT'06. Recently, the notion of AAR (algebraic
Lin Dongdai, Liu Meicheng, Pei Dingyi
core +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