搜索结果: 1-15 共查到“军事学 modulo”相关记录26条 . 查询时间(0.046 秒)
We prove our result by reducing ff to (a variant of) the SINK-OF-VERIFIABLE-LINE problem, which is known to imply PPAD (and in fact CLS) hardness. The main building block of our reduction is a recentl...
On the Distribution of Quadratic Residues and Non-residues Modulo Composite Integers and Applications to Cryptography
Jacobi symbol probability distribution statistical distance
2019/6/4
We develop exact formulas for the distribution of quadratic residues and non-residues in sets of the form a+X={(a+x)modn∣x∈X}a+X={(a+x)modn∣x∈X}, where nn is a prime or the product of two primes and X...
Fully homomorphic encryption modulo Fermat numbers
public-key cryptography Fully Homomorphic Encryption
2019/3/1
In this paper, we recast state-of-the-art constructions for fully homomorphic encryption in the simple language of arithmetic modulo large Fermat numbers. The techniques used to construct our scheme a...
Secure Modulo Zero-Sum Randomness as Cryptographic Resource
cryptographic resource public channel multi-party secure computation
2018/11/20
We propose a new cryptographic resource, which we call modulo zero-sum randomness, for several cryptographic tasks. The modulo zero-sum randomness X1,…,XmX1,…,Xm is distributed randomness among mm par...
On inversion modulo pseudo-Mersenne primes
Elliptic Curves side-channel secure modular inversion
2018/11/2
It is well established that the method of choice for implementing a side-channel secure modular inversion, is to use Fermat's little theorem. So 1/x=xp−2modp1/x=xp−2modp. This can be calcu...
Practical Fully Secure Unrestricted Inner Product Functional Encryption modulo $p$
Inner Product Functional Encryption Adaptive Security Diffie-Hellman Assumptions
2018/9/6
Functional encryption is a modern public-key cryptographic primitive allowing an encryptor to finely control the information revealed to recipients from a given ciphertext. Abdalla, Bourse, De Caro, a...
Encryption Switching Protocols Revisited: Switching modulo p
Two-party computation encryption switching protocols homomorphic encryption
2017/6/5
At CRYPTO 2016, Couteau, Peters and Pointcheval introduced a new primitive called Encryption Switching Protocols, allowing to switch ciphertexts between two encryption schemes. If such an ESP is built...
We give a systematic overview of techniques to compute efficient arithmetic modulo 2xpy±12xpy±1. This is useful for computations in the supersingular isogeny Diffie-Hellman (SIDH) key-exchange protoco...
Cryptographic Properties of Addition Modulo $2^n$
Modular addition Boolean function Component Boolean function
2016/2/24
The operation of modular addition modulo a power of
two is one of the most applied operations in symmetric cryptography.
For example, modular addition is used in RC6, MARS and
Twofish block ciphers...
A new algorithm for residue multiplication modulo $2^{521}-1$
residue multiplication Toeplitz matrix-vector product Mersenne prime
2016/2/23
We present a new algorithm for residue multiplication modulo the Mersenne prime 2521−1 based on the Toeplitz matrix-vector product. For this modulo, our algorithm yields better result in terms o...
Algebraic Properties of Modular Addition Modulo a Power of Two
applicable operators symmetric cryptography
2016/1/25
Modular addition modulo a power of two, is one of the
most applicable operators in symmetric cryptography; therefore,
investigating cryptographic properties of this operator has a
significant role ...
In this work, we describe a simple and efficient construction of a large subset S of F_p, where p is a prime, such that the set A(S) for any non-identity affine map A over F_p has small intersection w...
Solving Linear Equations Modulo Unknown Divisors: Revisited
Lattice-based analysis Linear modular equations RSA
2016/1/9
We revisit the problem of finding small solutions to a collection
of linear equations modulo an unknown divisor p for a known
composite integer N. In CaLC 2001, Howgrave-Graham introduced an
effici...
Bivariate Polynomials Modulo Composites and their Applications
algebraic curves bivariate polynomials cryptographic commitments
2016/1/7
We investigate the hardness of finding solutions to bivariate
polynomial congruences modulo RSA composites. We establish necessary
conditions for a bivariate polynomial to be one-way, second preimag...
Statistical Properties of the Square Map Modulo a Power of Two
Square map modulo a power of two Vectorial Boolean function Component Boolean function
2016/1/6
The square map is one of the functions that is used in cryptography. For instance, the square map is used in Rabin encryption scheme, block cipher RC6 and stream cipher Rabbit, in different forms. In ...