搜索结果: 1-12 共查到“军事学 security bounds”相关记录12条 . 查询时间(0.125 秒)
Tight Security Bounds for Generic Stream Cipher Constructions
Stream Ciphers Generic Time-Memory-Data Tradeoff Attacks Security Lower Bound Proofs
2019/1/9
The design of modern stream ciphers is strongly influenced by the fact that Time-Memory-Data tradeoff attacks (TMD-TO attacks) reduce their effective key length to SL/2SL/2, where SLSL denotes the inn...
Salvaging Weak Security Bounds for Blockcipher-Based Constructions
blockcipher ideal cipher model tweakable blockcipher
2016/12/9
The concrete security bounds for some blockcipher-based constructions sometimes become worrisome or even vacuous; for example, when a light-weight blockcipher is used, when large amounts of data are p...
On the Influence of Message Length in PMAC's Security Bounds
unforgeability integrity verification
2016/2/24
Many MAC (Message Authentication Code) algorithms have
security bounds which degrade linearly with the message length. Often
there are attacks that confirm the linear dependence on the message
leng...
In this paper, we revisit the old problem asking the exact provable security of triple encryption in the ideal cipher model. For a blockcipher with key length k and block size n, triple encryption is ...
Some security bounds for the DGHV scheme
Public-key cryptography Fully Homomorphic Encryption Somewhat Homomorphic Encryption
2016/1/26
The correctness in decrypting a ciphertext after some operations in the DGVH
scheme depends heavily on the dimension of the secret key. In this paper we compute
two bounds on the size of the secret ...
Tight security bounds for multiple encryption
multiple encryption cascade ciphers provable security
2016/1/26
Multiple encryption---the practice of composing a blockcipher several times with itself under independent keys---has received considerable attention of late from the standpoint of provable security. D...
True Random Number Generators Secure in a Changing Environment: Improved Security Bounds
True Random Number Generators Resilient Extractors Hash Functions
2016/1/6
Barak, Shaltiel Tromer showed how to construct a True Random
Number Generator (TRNG) which is secure against an adversary
who has some limited control over the environment.
A constant of 222 appears in the security bounds of the Galois/Counter Mode of Operation,
GCM. In this paper, we first develop an algorithm to generate nonces that have a high
counter-collision prob...
A $t$-round \emph{key-alternating cipher} (also called \emph{iterated Even-Mansour cipher}) can be viewed as an abstraction of AES. It defines a cipher $E$ from $t$ fixed public permutations $P_1, \ld...
Security Bounds for the Design of Code-based Cryptosystems
computational syndrome decoding information set decoding generalized birthday algorithm
2009/9/2
Code-based cryptography is often viewed as an interesting
"Post-Quantum" alternative to the classical number theory cryptogra-
phy. Unlike many other such alternatives, it has the convenient advan-
...
OMAC, TMAC and XCBC are CBC-type MAC schemes which are provably
secure for arbitrary message length. In this paper, we present a more tight upper bound on
Advmac for each scheme, where Advmac denote...
Security Bounds for the NIST Codebook-based Deterministic Random Bit Generator
Security Bound NIST Codebook-based Deterministic Random Bit Generator
2008/12/25
The NIST codebook-based deterministic random bit generators are analyzed in the context of
being indistinguishable from random. Upper and lower bounds based on the probability of distin-
guishing th...
