搜索结果: 1-12 共查到“军事学 approximation”相关记录12条 . 查询时间(0.109 秒)
Faster Sieving Algorithm for Approximate SVP with Constant Approximation Factors
foundations lattice techniques
2019/9/16
Abstract. There is a large gap between theory and practice in the complexities of sieving algorithms for solving the shortest vector problem in an arbitrary Euclidean lattice. In this paper, we work t...
Estimation of the Success Probability of Random Sampling by the Gram-Charlier Approximation
public-key cryptography lattice techniques
2018/11/19
The lattice basis reduction algorithm is a method for solving the Shortest Vector Problem (SVP) on lattices. There are many variants of the lattice basis reduction algorithm such as LLL, BKZ, and RSR....
Fast Correlation Attacks over Extension Fields, Large-unit Linear Approximation and Cryptanalysis of SNOW 2.0
Stream ciphers Cryptanalysis Large-unit
2016/3/23
Several improvements of fast correlation attacks have been proposed during the past two decades, with a regrettable lack of a better generalization and adaptation to the concrete involved primitives, ...
Linear Sequential Circuit Approximation of Acterbahn Stream Cipher
Linear Distinguishing Attack Linear Sequential Circuit Approximation Achterbahn Stream Cipher
2016/1/23
Achterbahn stream cipher is proposed as a candidate for ECRYPT eSTREAM project which deals with key of length 80-bit. The linear distinguishing attack,which aims at distinguishing the keystream from p...
Analysis of ARX Functions: Pseudo-linear Methods for Approximation, Differentials, and Evaluating Diffusion
ARX block ciphers hash functions
2016/1/6
This paper explores the approximation of addition mod 2n
by addition mod 2w, where
1 ≤ w ≤ n, in ARX functions that use large words (e.g., 32-bit words or 64-bit words). Three main areas
are explor...
DA-Encrypt: Homomorphic Encryption via Non-Archimedean Diophantine Approximation --- Preliminary Report
homomorphic encryption lattice-based cryptography
2015/12/23
We give a theoretical description of a new homomorphic encryption
scheme DA-Encrypt that is based on (non-archimedean) Diophantine
Approximation.
Accusation probabilities in Tardos codes: the Gaussian approximation is better than we thought
traitor tracing forensic watermarking Tardos fingerprinting
2010/9/6
We study the probability distribution of user accusations in the q-ary Tardos fingerprinting system under the Marking Assumption, in the restricted digit model. In particular, we look at the applicabi...
Using the Inhomogeneous Simultaneous Approximation Problem for Cryptographic Design
foundations Simultaneous Approximation Problem Analytic Number Theory Diophantine Approximation Provable Security Commitment Scheme
2010/5/20
Since the introduction of the concept of provable security, there has been the steady search for suitable problems that can be used as a foundation for cryptographic schemes. Indeed, identifying such ...
KronCrypt - A New Symmetric Cryptosystem Based on Kronecker's Approximation Theorem
KronCrypt Symmetric Cryptosystem Kronecker's Approximation Theorem
2009/9/2
In this paper we show how to use an old mathematical concept of
diophantine analysis, the approximation theorem of Kronecker, in symmetric
cryptography. As a first practical application we propose a...
Efficient Approximation of Higher Order Boolean function in a Low Order Function
Efficient Approximation Higher Order Boolean function Low Order Function
2009/7/14
A few of non-linear approximation methods for Boolean functions
have been developed but they are not of practical application. However,
if a low order Boolean function can be found that can nearly a...
Results from a Search for the Best Linear Approximation of a Block Cipher
Best Linear Approximation Block Cipher Substitution-Permutation Network
2009/6/3
In this paper, we investigate the application of an algorithm to find the best
linear approximation of a basic Substitution-Permutation Network block cipher. The
results imply that, while it is well...
Linear Sequential Circuit Approximation of Grain and Trivium Stream Ciphers
Stream Cipher Distinguishing Attack Linear Sequential Circuit Approximation Grain Trivium
2008/11/17
Grain and Trivium are two hardware oriented synchronous stream
ciphers proposed as the simplest candidates to the ECRYPT Stream Cipher Project,
both dealing with 80-bit secret keys. In this paper we...