搜索结果: 1-15 共查到“军事学 Algorithms”相关记录118条 . 查询时间(0.141 秒)
Quantum Algorithms for the Approximate k-List Problem and their Application to Lattice Sieving
approximate k-list problem cryptanalysis distributed computation
2019/9/16
The Shortest Vector Problem (SVP) is one of the mathematical foundations of lattice based cryptography. Lattice sieve algorithms are amongst the foremost methods of solving SVP. The asymptotically fas...
Duel of the Titans: The Romulus and Remus Families of Lightweight AEAD Algorithms
Authenticated encryption lightweight cryptography tweakable block cipher
2019/9/3
In this article, we propose two new families of very lightweight and efficient authenticated encryption with associated data (AEAD) modes, Romulus and Remus, that provide security beyond the birthday ...
Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions
time-memory trade-off representations parallel collision search
2019/7/15
For enabling post-quantum cryptanalytic experiments on a meaningful scale, there is a strong need for low-memory algorithms. We show that the combination of techniques from representations, multiple c...
Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms
discrete logarithm problem finite fields elliptic representation
2019/7/10
Elliptic bases, introduced by Couveignes and Lercier in 2009, give an elegant way of representing finite field extensions. A natural question which seems to have been considered independently by sever...
Exploring NIST LWC/PQC Synergy with R5Sneik: How SNEIK 1.1 Algorithms were Designed to Support Round5
Post-Quantum Cryptography Lightweight cryptography Permutation-Based Cryptography
2019/6/12
Most NIST Post-Quantum Cryptography (PQC) candidate algorithms use symmetric primitives internally for various purposes such as ``seed expansion'' and CPA to CCA transforms. Such auxiliary symmetric o...
On the Geometric Ergodicity of Metropolis-Hastings Algorithms for Lattice Gaussian Sampling
Lattice Gaussian sampling MCMC methods Metropolis-Hastings algorithm
2019/6/10
Sampling from the lattice Gaussian distribution has emerged as an important problem in coding, decoding and cryptography. In this paper, the classic Metropolis-Hastings (MH) algorithm in Markov chain ...
Stopping time signatures for some algorithms in cryptography
foundations number theory discrete logarithm problem
2019/5/23
We consider the normalized distribution of the overall running times of some cryptographic algorithms, and what information they reveal about the algorithms. Recent work of Deift, Menon, Olver, Pfrang...
Algorithms for CRT-variant of Approximate Greatest Common Divisor Problem
CCK-ACD Lattice orthogonal lattice attack
2019/3/1
The approximate greatest common divisor problem (ACD) and its variants have been used to construct many cryptographic primitives. In particular, variants of the ACD problem based on Chinese remainder ...
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...
Improving the MILP-based Security Evaluation Algorithms against Differential Cryptanalysis Using Divide-and-Conquer Approach
Block Cipher Differential Cryptanalysis MILP
2019/1/9
In recent years, Mixed Integer Linear Programming (MILP) has been widely used in cryptanalysis of symmetric-key primitives. For differential and linear cryptanalysis, MILP can be used to solve the two...
More is Less: Perfectly Secure Oblivious Algorithms in the Multi-Server Setting
oblivious RAM muli-server perfect security
2018/11/15
The problem of Oblivious RAM (ORAM) has traditionally been studied in the single-server setting, but more recently the multi-server setting has also been considered. Yet it is still unclear whether th...
Higher dimensional sieving for the number field sieve algorithms
public-key cryptography exTNFS
2018/11/6
Since 2016 and the introduction of the exTNFS (extended Tower Number Field Sieve) algorithm, the security of cryptosystems based on non- prime finite fields, mainly the paring and torus-based one, is ...
Revisiting Single-server Algorithms for Outsourcing Modular Exponentiation
modular exponentiations secure outsourcing
2018/11/2
We investigate the problem of securely outsourcing modular exponentiations to a single, malicious computational resource. We revisit recently proposed schemes using single server and analyse them agai...
Fully Automated Differential Fault Analysis on Software Implementations of Cryptographic Algorithms
differential fault analysis cryptographic fault attacks automation
2018/6/5
Emerging technologies with the requirement of small size and portability, such as Internet-of-Things devices, represent a good target for physical attacks, e.g., fault attacks. These attacks often aim...
Improved Parallel Mask Refreshing Algorithms: Generic Solutions with Parametrized Non-Interference \& Automated Optimizations
Side-channel attacks masking countermeasure refreshing algorithms
2018/5/28
Refreshing algorithms are a critical ingredient for secure masking. They are instrumental in enabling sound composability properties for complex circuits, and their randomness requirements dominate th...