搜索结果: 1-15 共查到“军事学 Selection”相关记录17条 . 查询时间(0.087 秒)
Statistical Analysis and Anonymity of TOR's Path Selection
onion routing cryptography cyber security
2019/6/3
Tor is a network based on the onion routing infrastructure and provides many advantages, including tracking avoidance, research, wider access and, unfortunately, illegal activities. To achieve this, t...
On the Relevance of Feature Selection for Profiled Side-channel Attacks
Profiled side-channel attacks feature selection machine learning
2017/11/21
In the process of profiled side-channel analysis there is a number of steps one needs to make. One important step that is often conducted without a proper attention is selection of the points of inter...
A Generalisation of the Conjugation Method for Polynomial Selection for the Extended Tower Number Field Sieve Algorithm
finite fields discrete logarithm tower number field sieve
2016/6/2
In a recent work, Kim and Barbulescu showed how to combine previous polynomial selection methods with the extended tower number field sieve algorithm to obtain improved complexity for the discrete log...
A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm
Discrete Log Tower Number Field Sieve
2016/5/24
In a recent work, Kim and Barbulescu had extended the tower number field sieve algorithm to obtain improved asymptotic complexities in the medium prime case for the discrete logarithm problem on Fpn w...
Tower Number Field Sieve Variant of a Recent Polynomial Selection Method
TNFS Recent Polynomial Selection Method
2016/4/25
At Asiacrypt 2015, Barbulescu et al. performed a thorough analysis of the tower number field sieve (TNFS) variant of the number field sieve algorithm. More recently, Kim and Barbulescu combined the TN...
Automatic Protocol Selection in Secure Two-Party Computations
Secure Two-Party Computation Performance Optimization
2016/1/25
Performance of secure computation is still often an obstacle to its practical adaption. There
are different protocols for secure computation that compete for the best performance. In this paper we
p...
Efficient Selection of Time Samples for Higher-Order DPA with Projection Pursuits
Higher-Order DPA Projection Pursuits
2016/1/9
The selection of points-of-interest in leakage traces is a frequently
neglected problem in the side-channel literature. However, it can
become the bottleneck of practical adversaries/evaluators as t...
(Nothing else) MATor(s): Monitoring the Anonymity of Tor's Path Selection
Tor Tor path selection Provable privacy
2016/1/8
In this paper we present MATOR: a framework for rigorously assessing the degree of anonymity in the
Tor network. The framework explicitly addresses how user anonymity is impacted by real-life charact...
MMBcloud-tree: Authenticated Index for Verifiable Cloud Service Selection
Cloud service selection Brokerage system Merkle hash tree
2015/12/31
Cloud brokers have been recently introduced as an additional computational layer to facilitate cloud selection and service
management tasks for cloud consumers. However, existing brokerage schemes on...
Systematic Reverse Engineering of Cache Slice Selection in Intel Processors
Cache slices Intel last level cache,
2015/12/29
Dividing last level caches into slices is a popular method to prevent memory accesses from
becoming a bottleneck on modern multicore processors. In order to assess and understand the benefits
of cac...
polynomial selection for the number field sieve in geometric view
cryptography number field sieve
2014/3/10
Polynomial selection is the first important step in number field sieve. A good polynomial not only can produce more relations in the sieving step, but also can reduce the matrix size. In this paper, w...
The Cryptographic Power of Random Selection
secret-key cryptography / Lightweight Cryptography Algebraic Attacks Algorithmic Learning, Foundations and Complexity Theory
2012/3/26
The principle of random selection and the principle of adding biased noise are new paradigms used in several recent papers for constructing lightweight RFID authentication protocols. The cryptographic...
On Nonlinear Polynomial Selection and Geometric Progression (mod N) for Number Field Sieve
foundations / Polynomial Selection Number Field Sieve LLL Algorithm
2012/3/28
The general number field sieve (GNFS) is asymptotically the fastest known factoring algorithm. One of the most important steps of GNFS is to select a good polynomial pair. A standard way of polynomial...
On Nonlinear Polynomial Selection and Geometric Progression (mod N) for Number Field Sieve
Polynomial Selection Number Field Sieve LLL Algorithm
2011/6/9
The general number field sieve (GNFS) is asymptotically the fastest known factoring algorithm. One of the most important steps of GNFS is to select a good polynomial pair. A standard way of polynomial...
On the Selection of Pairing-Friendly Groups
pairing-based cryptosystems group generators elliptic curves
2009/4/9
We propose a simple algorithm to select group generators
suitable for pairing-based cryptosystems. The selected parameters are
shown to favor implementations of the Tate pairing that are at once con...