搜索结果: 1-15 共查到“密码学 Enumeration”相关记录30条 . 查询时间(0.14 秒)
Lower Bounds on Lattice Enumeration with Extreme Pruning
Lattices Enumeration Pruning Security Estimates
font style='font-size:12px;'>
2018/6/13
At Eurocrypt '10, Gama, Nguyen and Regev introduced lattice enumeration with extreme pruning: this algorithm is implemented in state-of-the-art lattice reduction software and used in challenge records...
Quantum Lattice Enumeration and Tweaking Discrete Pruning
Lattices Quantum algorithms Enumeration
font style='font-size:12px;'>
2018/6/5
Enumeration is a fundamental lattice algorithm used in challenge records. We show how to speed up enumeration on a quantum computer, which affects the security estimates of several lattice-based submi...
Scalable Key Rank Estimation (and Key Enumeration) Algorithm for Large Keys
Side-channel analysis Evaluation Security assessment
font style='font-size:12px;'>
2018/3/6
Evaluation of security margins after a side-channel attack is an important step of side-channel resistance evaluation. The security margin indicates the brute force effort needed to recover the key gi...
Towards Easy Key Enumeration
key enumeration KGE Group Collision Attack
font style='font-size:12px;'>
2017/3/21
Key enumeration solutions are post-processing schemes for the output sequences of side channel distinguishers, the application of which are prevented by very large key candidate space and computation ...
Random Sampling Revisited: Lattice Enumeration with Discrete Pruning
Enumeration Algorithms Short Vectors
font style='font-size:12px;'>
2017/2/23
In 2003, Schnorr introduced Random sampling to find very short lattice vectors, as an alternative to enumeration. An improved variant has been used in the past few years by Kashiwabara et al. to solve...
Orthogonalized Lattice Enumeration for Solving SVP
Lattice-based SVP sparse representations, enumeration
font style='font-size:12px;'>
2016/12/8
In 2014, the orthogonalized integer representation is presented
indepently by Dan Ding etc and Fukase etc to solve SVP respectively
by genetic algorithm and sampling technique, and both work have
a...
Simple Key Enumeration (and Rank Estimation) using Histograms: an Integrated Approach
Key enumeration Key rank side-channel analysis
font style='font-size:12px;'>
2016/6/6
The main contribution of this paper, is a new key enumeration algorithm that combines the conceptual simplicity of the rank estimation algorithm of Glowacz et al. (from FSE 2015) and the parallelizabi...
Parallel Implementation of CVP enumeration for LWE
cryptanalysis implementation lattice techniques
font style='font-size:12px;'>
2016/4/15
One of the most attractive problems for post-quantum secure cryptographic schemes is the LWE problem. Beside combinatorial and algebraic attacks, LWE can be solved by a lattice-based Bounded Distance ...
Time-Memory Trade-Off for Lattice Enumeration in a Ball
Lattice Enumeration public-key cryptography
font style='font-size:12px;'>
2016/3/1
Enumeration algorithms in lattices are a well-known technique for solving the Short Vector Problem (SVP) and improving blockwise lattice reduction algorithms. Here, we propose a new algorithm for enum...
NSEC5 from Elliptic Curves: Provably Preventing DNSSEC Zone Enumeration with Shorter Responses
verifiable random functions DNSSEC zone enumeration secure Internet protocols
font style='font-size:12px;'>
2016/2/23
While DNSSEC securely provides authenticity and integrity to the domain name system (DNS), it also creates a new security vulnerability called zone enumeration that allows an adversary that asks a sma...
A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-Dimensional Side-Channel Attacks
cryptanalysis near-optimal ranks
font style='font-size:12px;'>
2016/1/26
Enumeration of cryptographic keys in order of likelihood based on side-channel leakages has a significant importance in cryptanalysis. Previous algorithms enumerate the keys in optimal order, however ...
On the Enumeration of Double-Base Chains with Applications to Elliptic Curve Cryptography
Double-base number system elliptic curve cryptography
font style='font-size:12px;'>
2016/1/9
The Double-Base Number System (DBNS) uses two bases, 2 and 3, in order to represent any integer n. A Double-Base Chain (DBC) is a special case of a DBNS expansion. DBCs have been introduced to speed u...
Fast Lattice Point Enumeration with Minimal Overhead
Closest Vector Problem Enumeration Algorithms
font style='font-size:12px;'>
2016/1/8
Enumeration algorithms are the best currently known methods to solve lattice problems,
both in theory (within the class of polynomial space algorithms), and in practice (where they
are routinely use...
NSEC5: Provably Preventing DNSSEC Zone Enumeration
cryptographic protocols NSEC3 records
font style='font-size:12px;'>
2016/1/8
We use cryptographic techniques to study zone enumeration in DNSSEC. DNSSEC is designed to prevent attackers from tampering with domain name system (DNS) messages. The cryptographic machinery used in ...
Towards Finding the Best Characteristics of Some Bit-oriented Block Ciphers and Automatic Enumeration of (Related-key) Differential and Linear Characteristics with Predefined Properties
Automatic cryptanalysis Related-key differential cryptanalysis Linear cryptanalysis
font style='font-size:12px;'>
2016/1/7
In this paper, we investigate the Mixed-integer Linear Programming (MILP) modelling of
the differential and linear behavior of a wide range of block ciphers. We point out that the differential
behav...