搜索结果: 1-15 共查到“Efficient Algorithms”相关记录16条 . 查询时间(0.468 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Efficient algorithms for the anisotropic dendritic crystal models
各向异性 树枝状晶体 有效算法
2023/4/14
We consider numerical approximations of the anisotropic phase-field dendritic crystal growth model. This is a highly complex coupled nonlinear system consisting of the anisotropic Allen-Cahn equation,...
More Efficient Algorithms for the NTRU Key Generation using the Field Norm
lattice techniques public-key cryptography quantum cryptography
2019/1/9
NTRU lattices are a class of polynomial rings which allow for compact and efficient representations of the lattice basis, thereby offering very good performance characteristics for the asymmetric algo...
Efficient Algorithms for Broadcast and Consensus Based on Proofs of Work
Broadcast Byzantine Agreement Proof of Works
2017/9/25
Inspired by the astonishing success of cryptocurrencies, most notably the Bitcoin system, several recent works have focused on the design of robust blockchain-style protocols that work in a peer-to-pe...
Design, Implementation and Performance Analysis of Highly Efficient Algorithms for AES Key Retrieval in Access-driven Cache-based Side Channel Attacks
AES access-driven cache attacks
2017/9/21
Leakage of information between two processes sharing the same processor cache has been exploited in many novel approaches targeting various cryptographic algorithms. The software implementation of AES...
Memory-Efficient Algorithms for Finding Needles in Haystacks
Cryptanalysis Needles in Haystacks Mode Detection
2016/6/6
One of the most common tasks in cryptography and cryptanalysis is to find some interesting event (a needle) in an exponentially large collection (haystack) of N=2n possible events, or to demonstrate t...
Efficient algorithms for supersingular isogeny Diffie-Hellman
Post-quantum cryptography Diffie-Hellman key exchange supersingular elliptic curves
2016/5/3
We propose a new suite of algorithms that significantly improve the performance
of supersingular isogeny Diffie-Hellman (SIDH) key exchange. Subsequently, we present a
full-fledged implementation of...
Efficient Algorithms for High-Order Discretizations of the Euler and Navier-Stokes Equations
Efficient Algorithms High-Order Discretizations Euler Navier-Stokes Equations
2015/7/2
Higher order discretizations have not been widely successful in industrial applications to compressible ow simulation. Among several reasons for this, one may identify the lack of tailor-suited, best-...
Efficient Algorithms for Multivariate Linear Mixed Models in Genome-wide Association Studies
Efficient Algorithms Multivariate Linear Mixed Models Genome-wide Association Studies
2013/6/17
Multivariate linear mixed models (mvLMMs) have been widely used in many areas of genetics, and have attracted considerable recent interest in genome-wide association studies (GWASs). However, existing...
Comunication-Efficient Algorithms for Statistical Optimization
Comunication-Efficient Algorithms Statistical Optimization
2012/11/22
We present and study two communication-efficient algorithms for distributed statistical optimization on large-scale data sets. The first algorithm is a standard averaging method that distributes the $...
Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms
Non-adaptive probabilistic group noisy measurements Near-optimal bounds efficient algorithms
2011/9/19
Abstract: We consider the problem of detecting a small subset of defective items from a large set via non-adaptive "random pooling" group tests. We consider both the case when the measurements are noi...
Computationally efficient algorithms for statistical image processing. Implementation in R
Image analysis signal detection image recon-struction percolation noisy image unsupervised machine learning spatial statistics
2011/3/24
In the series of our earlier papers on the subject, we proposed a novel statistical hypothesis testing method for detection of objects in noisy images. The method uses results from percolation theory ...
MORE EFFICIENT ALGORITHMS FOR CLOSEST STRING AND SUBSTRING PROBLEMS
MORE EFFICIENT ALGORITHMS CLOSEST STRING AND SUBSTRING
2012/12/3
The closest string problem and the closest substring problem are all natural theoretical computer science problems and find important applications in computational biology. Given n input strings, the ...
Efficient Algorithms for Computing Differential Properties of Addition
modular addition differential cryptanalysis differential probability
2009/4/16
We also present log-time algorithms for finding good differentials. Despite the apparent simplicity of modular addition,the best known algorithms require naive exhaustive computation.
Efficient Algorithms for Pairing-Based Cryptosystems
Efficient Algorithms Pairing-Based Cryptosystems
2009/4/13
We describe fast new algorithms to implement recent cryptosystems
based on the Tate pairing. In particular, our techniques improve
pairing evaluation speed by a factor of about 55 compared to previo...
Some Efficient Algorithms for the Final Exponentiation of ´T Pairing
Tate pairing ´ T pairing final exponentiation
2009/1/4
Recently Tate pairing and its variations are attracted in
cryptography. Their operations consist of a main iteration loop and a
final exponentiation. The final exponentiation is necessary for gener...