搜索结果: 1-15 共查到“军事学 Q-rank”相关记录27条 . 查询时间(0.062 秒)
Predicate Encryption from Bilinear Maps and One-Sided Probabilistic Rank
Predicate Encryption Bilinear Maps Probabilistic Rank
font style='font-size:12px;'>
2019/9/19
In predicate encryption for a function ff, an authority can create ciphertexts and secret keys which are associated with `attributes'. A user with decryption key KyKy corresponding to attribute yy can...
Durandal: a rank metric based signature scheme
signature code based crypto rank metric
font style='font-size:12px;'>
2018/12/19
We describe a variation of the Schnorr-Lyubashevsky approach to devising signature schemes that is adapted to rank based cryptography. This new approach enables us to obtain a randomization of the sig...
On Degree-d Zero-Sum Sets of Full Rank
Boolean function annihilator orthogonal matrix
font style='font-size:12px;'>
2018/12/19
A set S⊆Fn2S⊆F2n is called degree-dd zero-sum if the sum ∑s∈Sf(s)∑s∈Sf(s) vanishes for all nn-bit Boolean functions of algebraic degree at most dd. Those sets correspond to the supports of...
On a Rank-Metric Code-Based Cryptosystem with Small Key Size
code-based cryptography rank-metric codes interleaving
font style='font-size:12px;'>
2018/12/19
A repair of the Faure-Loidreau (FL) public-key code-based cryptosystem is proposed.The FL cryptosystem is based on the hardness of list decoding Gabidulin codes which are special rank-metric codes. We...
Poly-Logarithmic Side Channel Rank Estimation via Exponential Sampling
Side Channel Rank Estimation Key Enumeration
font style='font-size:12px;'>
2018/11/13
Rank estimation is an important tool for a side-channel evaluations laboratories. It allows estimating the remaining security after an attack has been performed, quantified as the time complexity and ...
DRANKULA: a McEliece-like rank metric based cryptosystem implementation
Code-based cryptography Public key cryptography Cryptosystem
font style='font-size:12px;'>
2018/8/28
We present and analyze the performance of DRANKULA, a McEliece-like cryptosystem implementation using \textit{rank metric} instead of Hamming distance. Namely, we use the scheme proposed by Loidreau i...
A Note on Key Rank
Side-channel Attacks Key Rank
font style='font-size:12px;'>
2018/6/25
In recent years key rank has become an important aspect of side-channel analysis, enabling an evaluation lab to analyse the security of a device after a side-channel attack. In particular, it enables ...
PRank: Fast Analytical Rank Estimation via Pareto Distributions
rank estimation side-channel
font style='font-size:12px;'>
2018/6/5
These estimations are particularly useful where the key is not reachable with exhaustive search. We propose a new method called PRank for rank estimation, that is conceptually simple, and more time an...
Revocable Identity-based Encryption from Codes with Rank Metric
Code-based Cryptography Identity-based Encryption Key Revocation
font style='font-size:12px;'>
2018/5/2
In this paper, we present an identity-based encryption scheme from codes with efficient key revocation. Recently, in Crypto 2017, Gaborit et al. proposed a first identity-based encryption scheme from ...
A polynomial attack on a NIST proposal: RankSign, a code-based signature in rank metric
public-key cryptography NIST
font style='font-size:12px;'>
2018/4/17
RankSign is a code-based signature scheme proposed to the NIST competition for post-quantum cryptography [AGHRZ17]. It is based on the rank metric and enjoys remarkably small key sizes, about 10KBytes...
Homomorphic Rank Sort Using Surrogate Polynomials
Private computation encrypted computing fully homomorphic encryption
font style='font-size:12px;'>
2018/3/26
In this paper we propose a rank based algorithm for sorting encrypted data using monomials. Greedy Sort is a sorting technique that achieves to minimize the depth of the homomorphic evaluations. It is...
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...
Rank Analysis of Cubic Multivariate Cryptosystems
multivariate cryptography cubic polynomials tensor rank
font style='font-size:12px;'>
2018/1/31
In this work we analyze the security of cubic cryptographic constructions with respect to rank weakness. We detail how to extend the big field idea from quadratic to cubic, and show that the same rank...
Identity-based Encryption from Codes with Rank Metric, Full Version
Code-based cryptography Rank metric IBE
font style='font-size:12px;'>
2017/6/6
Code-based cryptography has a long history, almost as long as the history of public-key encryption (PKE). While we can construct almost all primitives from codes such as PKE, signature, group signatur...
A new rank metric codes based encryption scheme
McEliece encryption scheme code based cryptography
font style='font-size:12px;'>
2017/3/13
We design a new McEliece-like rank metric based encryption scheme from Gabidulin codes. We explain why it is not affected by the invariant subspace attacks also known as Overbeck's attacks. The idea o...