搜索结果: 1-15 共查到“Modulus”相关记录69条 . 查询时间(0.092 秒)
Assessment of Different Measurement Methods/Techniques in Predicting Modulus of Elasticity of Plantation Eucalyptus nitens Timber for Structural Purposes
Eucalyptus nitens structural applications hardwood plantation structural grading modulus of elasticity
2023/12/6
The mechanical properties of plantation Eucalyptus Nitens timber are currently assessed by applying visual stress grading (VSG) designed for the sawn timber from the mature plantation and do not repre...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Solitons and Breathers in the modulus KdV equations
模量 KdV方程 孤子 呼吸器
2023/5/12
Compared to the soliton solutions, the breathers, which are constructed in the mKdV or Gardner equation via integrability methods, are less studied. In our numerical study, we show the interactions be...
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：A New Framework for SIMD Bootstrapping in Polynomial Modulus
多项式 模数 SIMD自举 新框架
2023/4/28
In this series of work, we aim at improving the bootstrapping paradigm for fully homomorphic encryption (FHE). Our main goal is to show that the amortized cost of bootstrapping within a polynomial mod...
中国地质大学科学技术发展院刘丰铭，等，数理学院. PHYSICAL REVIEW LETTERS（2020），Metafluids beyond the Bulk Modulus（图）
流体；声学；特性；质量密度；体模量
2021/10/15
2020年10月，中国地质大学数理学院刘丰铭教授及其合作者在物理学期刊《PHYSICAL REVIEW LETTERS》（PRL）上发表了题为“Metafluids beyond the Bulk Modulus”的研究论文，第一作者为刘丰铭教授。
LAC: Practical Ring-LWE Based Public-Key Encryption with Byte-Level Modulus
lattice based cryptography learning with errors error correction
2018/11/2
Lattice based cryptography is one of the leading candidates of the post quantum cryptography. A major obstacle of deployment, though, is that its payload is relatively larger than the classical soluti...
Hide The Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT
Verifiable and secure delegation modular exponentiations cloud security
2018/7/9
Security protocols using public-key cryptography often requires large number of costly modular exponentiations (MEs). With the proliferation of resource-constrained (mobile) devices and advancements i...
Efficient Bit-Decomposition and Modulus-Conversion Protocols with an Honest Majority
secret sharing bit-decomposition modulus conversion
2018/5/2
Secure computation enables parties with inputs to compute a function on the inputs while keeping
them secret. There are security notions that secure computation should satisfy, e.g., privacy, meaning...
A Nonstandard Variant of Learning with Rounding with Polynomial Modulus and Unbounded Samples
Lattices LWE Learning with Rounding
2018/1/30
The learning with rounding problem (LWR) has become a popular cryptographic assumption to study recently due to its determinism and resistance to known quantum attacks. Unfortunately, LWR is only know...
Large Modulus Ring-LWE ≥ Module-LWE
security reduction learning with errors lattice-based cryptography
2017/6/27
We present a reduction from the module learning with errors problem (MLWE) in dimension dd and with modulus qq to the ring learning with errors problem (RLWE) with modulus qdqd. Our reduction increase...
Cryptanalysis of the Overstretched NTRU Problem for General Modulus Polynomial
NTRU Ideal Lattice sub eld attack
2017/6/1
The overstretched NTRU problem, which is the NTRU problem with super-polynomial size q in n, is one of the important security foundation of cryptosystems which are recently suggested. Albrecht et al. ...
Faster Gaussian Sampling for Trapdoor Lattices with Arbitrary Modulus
Lattice-Based Cryptography Discrete Gaussian Sampling Lattice Trapdoors
2017/4/11
We present improved algorithms for gaussian preimage sampling using the lattice trapdoors of (Micciancio and Peikert, CRYPTO 2012). The MP12 work only offered a highly optimized algorithm for the on-l...
Pseudorandomness of Ring-LWE for Any Ring and Modulus
Learning with Errors lattice-based cryptography worst-case to average-case reduction
2017/3/27
We give a polynomial-time quantum reduction from worst-case (ideal) lattice problems directly to the decision version of (Ring-)LWE. This extends to decision all the worst-case hardness results that w...
Improved Fully Homomorphic Encryption with Composite Number Modulus
fully homomorphic encryption multivariate algebraic equation Gr鯾ner basis
2016/1/27
Gentry抯 bootstrapping technique is the most famous method
of obtaining fully homomorphic encryption. In previous work I proposed
a fully homomorphic encryption without bootstrapping which has the
w...
Some recent constructions based on LWE do not sample the secret uniformly at random but rather from some distribution which produces small entries. The most prominent of these is the binary-LWE proble...
We show the following reductions from the learning with errors problem (LWE) to the learning with rounding problem (LWR): (1) Learning the secret and (2) distinguishing samples from random strings is ...