搜索结果: 1-15 共查到“军事学 Sampling”相关记录39条 . 查询时间(0.093 秒)
Compact and Scalable Arbitrary-centered Discrete Gaussian Sampling over Integers
Lattice-based crypto discrete Gaussian sampling implementation
2019/9/16
The arbitrary-centered discrete Gaussian sampler is a fundamental subroutine in implementing lattice trapdoor sampling algorithms. However, existing approaches typically rely on either a fast implemen...
Efficiently Masking Binomial Sampling at Arbitrary Orders for Lattice-Based Crypto
Masking Post-quantum Cryptography
2019/8/8
With the rising popularity of lattice-based cryptography, the Learning with Errors (LWE) problem has emerged as a fundamental core of numerous encryption and key exchange schemes. Many LWE-based schem...
Securely Sampling Biased Coins with Applications to Differential Privacy
distributed differential privacy secure computation
2019/7/17
We design an efficient method for sampling a large batch of dd independent coins with a given bias p∈[0,1]p∈[0,1]. The folklore secure computation method for doing so requires O(λ+logd)O(λ+logd...
The Adversarial Robustness of Sampling
random sampling adversarial model epsilon-approximation
2019/7/8
Random sampling is a fundamental primitive in modern algorithms, statistics, and machine learning, used as a generic method to obtain a small yet ``representative'' subset of the data. In this work, w...
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 ...
Polar Sampler: Discrete Gaussian Sampling over the Integers Using Polar Codes
Discrete Gaussian sampling Polar codes Integer lattice
2019/6/10
Cryptographic constructions based on hard lattice problems have emerged as a front runner for the standardization of post quantum public key cryptography. As the standardization process takes place, o...
Lattice Gaussian Sampling by Markov Chain Monte Carlo: Bounded Distance Decoding and Trapdoor Sampling
lattice Gaussian sampling Markov chain Monte Carlo bounded distance decoding
2019/6/5
Sampling from the lattice Gaussian distribution plays an important role in various research fields. In this paper, the Markov chain Monte Carlo (MCMC)-based sampling technique is advanced in several f...
GALACTICS: Gaussian Sampling for Lattice-Based Constant-Time Implementation of Cryptographic Signatures, Revisited
Timing Attack Phase Retrieval algorithms Constant-time Implementation
2019/5/21
In this paper, we propose a constant-time implementation of the BLISS lattice-based signature scheme. BLISS is possibly the most efficient lattice-based signature scheme proposed so far, with a level ...
Quantum Lazy Sampling and Game-Playing Proofs for Quantum Indifferentiability
game-playing proofs QROM indifferentiability
2019/4/28
Game-playing proofs constitute a powerful framework for classical cryptographic security arguments, most notably applied in the context of indifferentiability. An essential ingredient in such proofs i...
Motivated by the quest for scalable and succinct zero knowledge arguments, we revisit worst-case-to-average-case reductions for linear spaces, raised by [Rothblum, Vadhan, Wigderson, STOC 2013]. The p...
Integral Matrix Gram Root and Lattice Gaussian Sampling without Floats
Lattice based cryptography Discrete Gaussian sampling Matrix decomposition
2019/4/1
Many advanced lattice based cryptosystems require to sample lattice points from Gaussian distributions. One challenge for this task is that all current algorithms resort to floating-point arithmetic (...
Pushing the speed limit of constant-time discrete Gaussian sampling. A case study on Falcon
Post-quantum signature Falcon constant-time
2019/3/6
Sampling from discrete Gaussian distribution has applications in lattice-based post-quantum cryptography. Several efficient solutions have been proposed in recent years. However, making a Gaussian sam...
Sampling the Integers with Low Relative Error
Sampling Discrete Gaussians Lattice-based Cryptography
2019/1/26
Randomness is an essential part of any secure cryptosystem, but many constructions rely on distributions that are not uniform. This is particularly true for lattice based cryptosystems, which more oft...
Compressive Sensing based Leakage Sampling and Reconstruction: A First Study
compressive sensing matching pursuit OMP
2018/12/3
An important prerequisite for Side-channel Attack (SCA) is leakage sampling where the side-channel measurements (e.g. power traces) of the cryptographic device are collected for further analysis. Howe...
Faster SeaSign signatures through improved rejection sampling
Isogeny-based cryptography signatures SeaSign
2018/11/20
We speed up the isogeny-based ``SeaSign'' signature scheme recently proposed by De Feo and Galbraith. The core idea in SeaSign is to apply the ``Fiat–Shamir with aborts'' transform to the parallel rep...