搜索结果: 1-15 共查到“bound”相关记录334条 . 查询时间(0.93 秒)
Exploring the effects of bound rubber phase on the physical properties of nano-silica composites with a vitrimer-like bond exchangeable matrix
DYNAMIC COVALENT CHEMISTRY CROSS-LINK DENSITY MECHANICAL-PROPERTIES POLYMER NANOCOMPOSITES
2023/11/30
We demonstrate the preparation and unique properties of composite vitrimer-like materials containing silica nanoparticles (SNPs). The matrix is composed of polyacrylate-based polymers crosslinked via ...
【分析化学学术报告】Mass Spectrometric detection of membrane-bound proteins and their noncovalent interaction partners(图)
membrane-bound proteins noncovalent
2023/6/20
【分析化学学术报告】Mass Spectrometric detection of membrane-bound proteins and their noncovalent interaction partners
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:Energy stability and error analysis of a maximum bound principle preserving scheme for the dynamical Ginzburg-Landau equations of Superconductivity
超导动力学 金茨堡-朗道方程 最大界界原理 能量稳定性 误差分析
2023/4/25
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:Arbitrarily high-order cut-off methods to preserve maximum bound principle for Allen-Cahn equations
Allen-Cahn equations 最大界限原理 任意高阶 截止方法
2023/4/14
Phenolic profiles and antioxidant activities of free, esterified and bound phenolic compounds in walnut kernel
antioxidant activities Phenolic profiles bound phenolic compounds walnut kernel
2023/6/5
Timed-Release Encryption With Master Time Bound Key (Full Version)
timed-release encryption Weil pairing bilinear Diffie-Hellman problem
2019/8/8
Timed-release encryption allows senders to send a message to a receiver which cannot decrypt until a server releases a time bound key at the release time. The release time usually supposed to be known...
We show that Legendre PRF, recently suggested as an MPC-friendly primitive in a prime field ZpZp, admits key recovery attacks of complexity O(p√)O(p) rather than previously assumed O(p)O(p). We also d...
Can we Beat the Square Root Bound for ECDLP over Fp2 via Representations?
ECDLP Square Root Bound
2019/7/15
We give a 4-list algorithm for solving the Elliptic Curve Discrete Logarithm (ECDLP) over some quadratic field Fp2Fp2. Using the representation technique, we reduce ECDLP to a multivariate polynomial ...
A Candidate Access Structure for Super-polynomial Lower Bound on Information Ratio
secret sharing general access structures information ratio
2019/6/3
The contribution vector (convec) of a secret sharing scheme is the vector of all share sizes divided by the secret size. A measure on the convec (e.g., its maximum or average) is considered as a crite...
Parallelizable MACs Based on the Sum of PRPs with Security Beyond the Birthday Bound
authentication provable security permutation
2019/4/28
The combination of universal hashing and encryption is a fundamental paradigm for the construction of symmetric-key MACs, dating back to the seminal works by Wegman and Carter, Shoup, and Bernstein. W...
华南理工大学数据结构与算法课件Chapter15 Branch and Bound Method
华南理工大学 数据结构 算法 课件 Chapter15 Branch Bound Method
2019/4/11
华南理工大学数据结构与算法课件Chapter15 Branch and Bound Method。
Beyond Birthday Bound Secure MAC in Faulty Nonce Model
Graceful Security Faulty Nonce Mirror Theory
2019/2/27
Encrypt-then-MAC (EtM) is a popular mode for authenticated encryption (AE). Unfortunately, almost all designs following the EtM paradigm, including the AE suites for TLS, are vulnerable against nonce ...
Upper Bound on $\lambda_1(\Lambda^{\bot}(\mathbf A))$
security of lattice-based cryptography shortest vector problem worst-cast/average-case reduction
2019/1/16
Although the exhaustive search algorithm is rather inefficient for typical setting of parameters, our result indicates that lattice-based cryptography is not secure, at least in an asymptotical sense....
Improved upper bound on root number of linearized polynomials and its application to nonlinearity estimation of Boolean functions
Boolean Functions Nonlinearity Linearized Polynomial Root Number
2018/12/3
To determine the dimension of null space of any given linearized polynomial is one of vital problems in finite field theory, with concern to design of modern symmetric cryptosystems. But, the known ge...
Valiant's Universal Circuits Revisited: an Overall Improvement and a Lower Bound
Universal Circuits Private Function Evaluation Multiparty Computation
2018/11/7
A universal circuit (UC) is a general-purpose circuit that can simulate arbitrary circuits (up to a certain size nn). At STOC 1976 Valiant presented a graph theoretic approach to the construction of U...