搜索结果: 1-15 共查到“军事学 note”相关记录100条 . 查询时间(0.04 秒)
We examine the current parameter choice of Round5, and rectify its consideration of the improved dual attack due to Albrecht [Albrecht-EC17]: there is one significant optimization of Albrecht's dual a...
A Cautionary Note Regarding the Usage of Leakage Detection Tests in Security Evaluation
side-channel analysis leakage detection security certification
2019/6/14
An established ingredient in the security evaluation of cryptographic devices is leakage detection, whereby physically observable characteristics such as the power consumption are measured during oper...
A Note on Lower Digits Extraction Polynomial for Bootstrapping
Fully Homomorphic Encryption Bootstrapping
2019/6/12
Bootstrapping is a crucial but computationally expensive step for realizing Fully Homomorphic Encryption (FHE). Recently, Chen and Han (Eurocrypt 2018) introduced a family of low-degree polynomials to...
A Note on the (Im)possibility of Verifiable Delay Functions in the Random Oracle Model
Verifiable Delay Functions Random Oracle Model
2019/6/6
Boneh, Bonneau, B{\"u}nz, and Fisch (CRYPTO 2018) recently introduced the notion of a \emph{verifiable delay function} (VDF). VDFs are functions that take a long \emph{sequential} time TT to compute, ...
A note on different types of ransomware attacks
ransomware analysis infection crypto-ransomware
2019/6/3
Ransomware are malware whose purpose is to generate income for the attacker. The first of these malware made intense use of cryptography, specifically for file encryption. They encrypt some or most fi...
A note on the correlations between NIST cryptographic statistical tests suite
statistical testing cryptographic evaluation random bit generators
2019/5/24
This paper is focused on an open question regarding the correlation and the power of the NIST statistical test suite. If we found some correlation between these statistical tests, then we can improve ...
A Note on Sub-Gaussian Random Variables
sub-Gaussians fully homomorphic encryption FHE boostrapping
2019/5/21
A sub-Gaussian distribution is any probability distribution that has tails bounded by a Gaussian and has a mean of zero. It is well known that the sum of independent sub-Gaussians is again sub-Gaussia...
This paper presents the results of a new approach to the cryptanalysis of SIMON-32/6432/64, a cipher published by NSA in 2013. Our cryptanalysis essentially considers combinatorial properties. These p...
A Note on Key Agreement and Non-Interactive Commitments
Non-interactive commitments key agreement
2019/3/13
We observe that any key agreement protocol satisfying perfect completeness, regardless of its round complexity, can be used to construct a non-interactive commitment scheme.
A note on isogeny-based hybrid verifiable delay functions
verifiable delay function time-lock puzzle isogeny-based cryptography
2019/3/1
Using the idea behind the recently proposed isogeny- and paring-based verifiable delay function (VDF) by De Feo, Masson, Petit and Sanso, we construct an isogeny-based VDF without the use of pairings....
A Note on Transitional Leakage When Masking AES with Only Two Bits of Randomness
side-channel probing model transitional leakage
2018/11/21
Recently, Gross et al. demonstrated a first-order probing-secure implementation of AES using only two bits of randomness for both the initial sharing and the entire computation of AES. In this note, w...
Note on Constructing Constrained PRFs from OWFs with Constant Collusion Resistance
Constrained PRF collusion-resistance one-way functions
2018/11/8
Constrained pseudorandom functions (CPRFs) are a type of PRFs that allows one to derive a constrained key KCKC from the master key KK. While the master key KK allows one to evaluate on any input as a ...
A Note on Key Rank
Side-channel Attacks Key Rank
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 ...
A Note on the Communication Complexity of Multiparty Computation in the Correlated Randomness Model
multiparty computation correlated randomness model information- theoretic security
2018/5/22
Secure multiparty computation (MPC) addresses the challenge of evaluating functions on secret inputs without compromising their privacy. An central question in multiparty communication is to understan...
Clauser-Horne-Shimony-Holt inequality, an extension of Bell's inequality, is of great importance to modern quantum computation and quantum cryptography. So far, all experimental demonstrations of enta...