搜索结果: 1-14 共查到“军事学 structural”相关记录14条 . 查询时间(0.14 秒)
Structural Nonlinear Invariant Attacks on T-310: Attacking Arbitrary Boolean Functions
block ciphers Boolean functions non-linearity
2019/1/2
Recent papers show how to construct polynomial invariant attacks for block ciphers, however almost all such results are somewhat weak: invariants are simple and low degree and the Boolean functions te...
An efficient structural attack on NIST submission DAGS
cryptanalysis code based cryptography McEliece
2018/5/22
We present an efficient key recovery attack on code based encryption schemes using some quasi–dyadic alternant codes with extension degree 2. This attack permits to break the proposal DAGS recently su...
Structural Truncated Differential Attacks on round-reduced AES
AES Secret-Key Distinguisher Key-Recovery Attack
2017/9/1
At Eurocrypt 2017 the first secret-key distinguisher for 5-round AES has been presented. Although it allows to distinguish a random permutation from an AES like one, it seems (rather) hard to exploit ...
New Techniques for Structural Batch Verification in Bilinear Groups with Applications to Groth-Sahai Proofs
Batch verification bilinear maps Groth-Sahai proofs
2017/8/29
Bilinear groups form the algebraic setting for a multitude of important cryptographic protocols including anonymous credentials, e-cash, e-voting, e-coupon, and loyalty systems. It is typical of such ...
AES is probably the most widely studied and used block cipher. Also versions with a reduced number of rounds are used as a building block in many cryptographic schemes, e.g. several candidates of the ...
Structural Cryptanalysis of McEliece Schemes with Compact Keys
public-key cryptography McEliece cryptosystem algebraic cryptanalysis
2016/1/25
A very popular trend in code-based cryptography is to decrease the public-key size by
focusing on subclasses of alternant/Goppa codes which admit a very compact public matrix, typically
quasi-cyclic...
Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems
Lattices Worst-case to Average-case Reductions Homomorphic Encryption
2016/1/23
In lattice cryptography, worst-case to average-case reductions rely on two problems: Ajtai’s SIS and Regev’s LWE, which both refer to a very small class of random lattices related to the group G = Z...
An Asymptotically Optimal Structural Attack on the ABC Multivariate Encryption Scheme
multivariate public key cryptography differential invariant
2016/1/9
Historically, multivariate public key cryptography has been less
than successful at offering encryption schemes which are both secure and ef-
ficient. At PQCRYPTO ’13 in Limoges, Tao, Diene, Tang, a...
Structural Weaknesses in the Open Smart Grid Protocol
protocol analysis authentication protocol OSGP
2016/1/4
The Open Smart Grid Protocol (OSGP) is currently deployed in various countries in
large-scale Smart Metering projects. The protocol was developed by the OSGP Alliance
and published as a standard by ...
Structural Evaluation by Generalized Integral Property
Block cipher Integral distinguisher Feistel Network
2016/1/4
In this paper, we show structural cryptanalyses against two popular networks, i.e., the Feistel Network and the Substitute-Permutation Network (SPN). Our cryptanalyses are distinguishing attacks by an...
Meet-in-the-Middle Attacks and Structural Analysis of Round-Reduced PRINCE
PRINCE practical attacks meet-in-the-middle
2016/1/3
NXP Semiconductors and its academic partners challenged the cryptographic community with finding practical attacks on the block cipher they designed, PRINCE. Instead of trying to attack as many rounds...
Structural Evaluation of AES and Chosen-Key Distinguisher of 9-round AES-128
AES Related-Key
2014/3/12
While the symmetric-key cryptography community has now a good experience on how to build a secure and efficient fixed permutation, it remains an open problem how to design a key-schedule for block cip...
Certificateless Signatures: Structural Extensions of Security Models and New Provably Secure Schemes
Certificateless signature Security model Public key replacement Strong unforgeability
2013/4/18
Certificateless signatures (CLSs) were introduced to solve the key escrow problem of identity-based signatures. In CLS, the full private key is determined by neither the user nor the trusted third par...
Structural Identity-Based Encryption
HIBE SIBE
2008/5/22
In this paper, we introduce the concept of structural identity-
based encryption (SIBE). Similar to hierarchical identity-based encryp-
tion (HIBE), entities in the system are organized into hierar...