搜索结果: 1-15 共查到“军事学 Cryptosystems”相关记录135条 . 查询时间(0.079 秒)
Quantum LLL with an Application to Mersenne Number Cryptosystems
quantum attack lattice reduction Grover's algorithm
2019/9/16
In this work we analyze the impact of translating the well-known LLL algorithm for lattice reduction into the quantum setting. We present the first (to the best of our knowledge) quantum circuit repre...
A Reaction Attack against Cryptosystems based on LRPC Codes
Rank-based cryptography Code-based cryptography LRPC cryptosystems
2019/7/22
Rank metric is a very promising research direction for code-based cryptography. In fact, thanks to the high complexity of generic decoding attacks against codes in this metric, it is possible to easil...
Many post-quantum cryptosystems which have been proposed in the National Institute of Standards and Technology (NIST) standardization process follow the same meta-algorithm, but in different algebras ...
Indifferentiability for Public Key Cryptosystems
Indifferentiability Composition Public key encryption Random oracle model
2019/4/11
We initiate the study of indifferentiability for public key encryption and other public key primitives. Our main results are definitions and constructions of public key cryptosystems that are indiffer...
New Hybrid Method for Isogeny-based Cryptosystems using Edwards Curves
Isogeny Post-quantum cryptography Montgomery curves
2018/12/24
Along with the resistance against quantum computers, isogeny-based cryptography offers attractive cryptosystems due to small key sizes and compatibility with the current elliptic curve primitives. Whi...
Partial Key Exposure in Ring-LWE-Based Cryptosystems: Attacks and Resilience
public-key cryptography lattice-based cryptography leakage resilience
2018/11/12
Introduce the search and decision Leaky-RLWE assumptions (Leaky-SRLWE, Leaky-DRLWE), to formalize the hardness of search/decision RLWE under leakage of some fraction of coordinates of the NTT transfor...
Keeping or Losing Tiny-Error Correctness of Cryptosystems Implemented by Secure Pseudorandom Generators
foundations implementation pseudo-randomness
2018/8/2
Randomness is essential but expensive resource for cryptography, and secure (and efficient) implementations of randomness using pseudorandom generators (PRGs) are much concerned in this area. On the o...
Rank Analysis of Cubic Multivariate Cryptosystems
multivariate cryptography cubic polynomials tensor rank
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...
Quantum Algorithms for Boolean Equation Solving and Quantum Algebraic Attack on Cryptosystems
quantum algorithm Boolean equation solving quantum algebraic attac
2018/1/12
Decision of whether a Boolean equation system has a solution is an NPC problem and finding a solution is NP hard. In this paper, we present a quantum algorithm to decide whether a Boolean equation sys...
A toolbox for software optimization of QC-MDPC code-based cryptosystems
Code-based cryptosystems MDPC
2018/1/2
The anticipated emergence of quantum computers in the foreseeable future drives the cryptographic community to start considering cryptosystems, which are based on problems that remain intractable even...
Let N=pqN=pq be an RSA modulus with unknown factorization. Some variants of the RSA cryptosystem, such as LUC, RSA with Gaussian primes and RSA type schemes based on singular elliptic curves use a pub...
Threshold Cryptosystems From Threshold Fully Homomorphic Encryption
fully homomorphic encryption threshold cryptography lattices
2017/9/30
We develop a general approach to adding a threshold functionality to a large class of (non- threshold) cryptographic schemes. A threshold functionality enables a secret key to be split into a number o...
Loop-abort faults on supersingular isogeny cryptosystems
Supersingular isogeny cryptosystem fault injection real-world attacks
2017/5/2
Cryptographic schemes based on supersingular isogenies have become an active area of research in the field of post-quantum cryptography. We investigate the resistance of these cryptosystems to fault i...
We present the first fault attack on cryptosystems based on supersingular isogenies. During the computation of the auxiliary points, the attack aims to change the base point to a random point on the c...
Passwords bootstrap symmetric and asymmetric cryptography, tying keys to an individual user. Biometrics are intended to strengthen this tie. Unfortunately, biometrics exhibit noise between repeated re...