搜索结果: 1-15 共查到“军事学 Type”相关记录53条 . 查询时间(0.172 秒)
CCA-Secure Leakage-Resilient Identity-Based Key-Encapsulation from Simple (not $\mathtt{q}$-type) Assumptions
public-key cryptography leakage-resilient identity-based encryption
2019/8/30
In this paper, we propose a new leakage-resilient identity-based encryption (IBE) scheme that is secure against chosen-ciphertext attacks (CCA) in the bounded memory leakage model. It is the first CCA...
Improved quantum attack on Type-1 Generalized Feistel Schemes and Its application to CAST-256
Generalized Feistel Scheme Quantum attack Simon's algorithm
2019/4/1
Generalized Feistel Schemes (GFS) are important components of symmetric ciphers, which have been extensively researched in classical setting. However, the security evaluations of GFS in quantum settin...
Quantum Distinguishing Attacks against Type-1 Generalized Feistel Ciphers
Generalized Feistel cipher Simon's algorithm Grover search,
2019/4/1
A generalized Feistel cipher is one of the methods to construct block ciphers, and it has several variants. Dong, Li, and Wang showed quantum distinguishing attacks against the (2d−1)(2d−1...
Using MILP in Analysis of Feistel Structures and Improving Type II GFS by Switching Mechanism
MILP Generalized Feistel structure Switching mechanism
2018/8/16
Some features of Feistel structures have caused them to be considered as an efficient structure for design of block ciphers. Although several structures are proposed relied on Feistel structure, the t...
The presented work continues the line of recent distributed computing community efforts dedicated to the theoretical aspects of blockchains. This paper is the first to specify blockchains as a composi...
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...
Lightweight MDS Serial-type Matrices with Minimal Fixed XOR Count
MDS matrix Serial matrix lightweight cryptography
2017/11/13
Many block ciphers and hash functions require the diffusion property of Maximum Distance Separable (MDS) matrices. Serial matrices with the MDS property obtain a trade-off between area requirement and...
Efficient Square-based Montgomery Multiplier for All Type C.1 Pentanomials
Montgomery multiplication Squaring Bit-parallel
2017/9/1
In this paper, we present a low complexity bit-parallel Montgomery multiplier for GF(2m)GF(2m) generated with a special class of irreducible pentanomials xm+xm−1+xk+x+1xm+xm−1+xk+x+1. Base...
Deja Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
assumptions reductions
2016/12/10
In this paper, we demonstrate that various cryptographic constructions--including ones for broadcast, attribute-based, and hierarchical identity-based encryption--can rely for security on only the sta...
We describe an asymptotically fast variant of the LLL lattice reduction algorithm. It takes as input a basis B∈Zn×nB∈Zn×n and returns a (reduced) basis CC of the Euclidean lattice LL spanned by BB, wh...
The closest vector problem in tensored root lattices of type A and in their duals
Lattice based cryptography Cyclotomic lattices Tensored root lattices
2016/12/9
The closest vector problem in tensored root lattices of type A and in their duals.
Exact Security Analysis of Hash-then-Mask Type Probabilistic MAC Constructions
MAC secret-key cryptography
2016/12/8
Probabilistic MAC (message authentication code) is an alternative choice for a stateful MAC where maintaining internal state may be difficult or unsafe. Usually tag of a probabilistic MAC consists of ...
A GMM type construction for resilient S-boxes with higher-dimensional vectorial outputs and strictly almost optimal nonlinearity
secret-key cryptography Boolean functions
2016/7/4
Resilient substitution boxes (S-boxes) with high nonlinearity are important cryptographic primitives in the design of certain encryption algorithms. There are several trade-offs between the most impor...
Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion using Integer Programming
Conversion Bilinear Groups Integer Programming
2016/6/6
Bilinear-type conversion is to convert cryptographic schemes designed over symmetric groups instantiated with imperilled curves into ones that run over more secure and efficient asymmetric groups. In ...
More Efficient Structure-Preserving Signatures - Or: Bypassing the Type-III Lower Bounds
Structure-Preserving Digital Signatures Type-III Bilinear Groups
2016/3/9
Structure-preserving signatures are an important cryptographic primitive that is useful for the design of modular cryptographic protocols. It has been proven that structure-preserving signatures (in t...