Results 41 to 50 of about 1,200 (188)
This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Yiming Ren, Guo‐Wei Wei
wiley +1 more source
New bound of algebraic immunity of a class of Boolean function
Algebraic immunity quantified the resistance of a Boolean function to the algebraic attack.Recently,Mesnager,et al showed that there were direct linked between the annihilators used in algebraic attacks and the coding theory.They showed that the lower ...
Ye TIAN +3 more
doaj +2 more sources
ABSTRACT Building on a quartz crystal microbalance with dissipation monitoring (QCM‐D), fouling in emulsion polymerization was compared between acrylate dispersions stabilized with a mobile, anionic surfactant and dispersions of poly(vinyl acetate‐co‐vinyl neodecanoate), PVAc, stabilized with polyvinyl alcohol, PVOH.
K. M. Hoffmann +5 more
wiley +1 more source
Algebraic Attacks on Summation Generators [PDF]
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 +4 more
openaire +1 more source
Universal Entanglement and an Information‐Complete Quantum Theory
This Perspective summarize an informationcomplete quantum theory which describes a fully quantum world without any classical systems and concepts. Here spacetime/gravity, having to be a physical quantum system, universally entangles matter (matter fermions and their gauge fields) as an indivisible trinity, and encodes information‐complete physical ...
Zeng‐Bing Chen
wiley +1 more source
On the security of multi-prime RSA
Multi-prime RSA is a variant of RSA in which the modulus is the product of more than two distinct primes. In this work we collect the strongest known algebraic attacks on multi-prime RSA, including factoring, small private exponent, small CRT exponent ...
Hinek M. Jason
doaj +1 more source
Certificateless cryptography resolves the certificate management problem of public-key cryptography and the key-escrow problem of identity-based cryptography.
Kyung-Ah Shim
doaj +1 more source
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 +1 more source
Abstract ChatGPT and related technologies have revived an old issue in information science (IS) concerning information retrieval (IR) versus document retrieval. Since 1950, the term IR has primarily been used as a misnomer for document retrieval. This problematic terminology reflects a desire to go beyond documents and provide, in response to user ...
Birger Hjørland
wiley +1 more source
Improvement and evaluation for algebraic fault attacks on PRESENT
An enhanced algebraic fault analysis on PRESENT was proposed.Algebraic cryptanalysis was introduced to build the algebraic equations for both the target cipher and faults.The equation set of PRESENT was built reversely in order to accelerate the solving ...
Jing HUANG +6 more
doaj +2 more sources

