搜索结果: 1-15 共查到“军事学 More is Different”相关记录19条 . 查询时间(0.125 秒)
A note on different types of ransomware attacks
ransomware analysis infection crypto-ransomware
2019/6/3
Ransomware are malware whose purpose is to generate income for the attacker. The first of these malware made intense use of cryptography, specifically for file encryption. They encrypt some or most fi...
In this paper we focus on Polynomial Learning with Errors(PLWE). This problem is parametrized by a polynomial and we are interested in relating the hardness of the PLWEf and PLWEh problems for differe...
The Fiat-Shamir Zoo: Relating the Security of Different Signature Variants
public-key cryptography Different Signature Variants
2018/8/28
The Fiat-Shamir paradigm encompasses many different ways of turning a given identification scheme into a signature scheme. Security proofs pertain sometimes to one variant, sometimes to another. We sy...
Chaos Machine: Different Approach to the Application and Significance of Numbers
number theory pseudo-randomness one-way functions
2016/5/18
In this paper we describe a theoretical model of \underline{chaos machine}, which combines the benefits of hash function and pseudo-random function, forming flexible \textit{one-way} \underline{push-p...
Multipermutations in Crypto World: Different Faces of the Perfect Diffusion Layer
Perfect diffusion Recursive diffusion layer
2016/1/26
Diffusion layers, and specially perfect diffusion layers, are very important
subject for cryptographic research. Main quest is a perfect diffusion
layer with more optimal hardware and/or software im...
Template Attacks on Different Devices
side-channel attacks template attacks multivariate analysis
2016/1/9
Template attacks remain a most powerful side-channel technique
to eavesdrop on tamper-resistant hardware. They use a profiling
step to compute the parameters of a multivariate normal distribution
f...
Side-channel Power Analysis of Different Protection Schemes Against Fault Attacks on AES
AES differential fault analysis side-channel attacks
2016/1/6
A protection circuit can be added into cryptographic systems to detect both soft errors
and injected faults required by Differential Fault Analysis (DFA) attacks. While such protection
can improve t...
How Different Electrical Circuits of ECC Designs Influence the Shape of Power Traces measured on FPGA
cryptographic hardware architectures security processors countermeasures against side-channel attacks
2016/1/5
Side channel and fault attacks take advantage from the fact that the behavior of crypto implementations can be observed and provide hints that simplify revealing keys. These attacks use identical devi...
On Evaluating Circuits with Inputs Encrypted by Different Fully Homomorphic Encryption Schemes
Fully Homomorphic Encryption Multi-Scheme FHE Trivial Encryptions Ciphertext Trees Multiparty Computations
2013/4/18
We consider the problem of evaluating circuits whose inputs are encrypted with possibly different encryption schemes. Let $\mathcal{C}$ be any circuit with input $x_1, \dots, x_t \in \{0,1\}$, and let...
Comparing Different Definitions of Secure Session
foundations / secure session session protocol private key cryptography
2012/3/28
We first propose a definition of session protocol where two parties exchange information using a shared key. The notion of security based on our definition of session protocol requires the secure tran...
Comparing Different Definitions of Secure Session
foundations / secure session session protocol private key cryptography
2011/6/9
We first propose a definition of session protocol where two parties exchange information using a shared key. The notion of security based on our definition of session protocol requires the secure tran...
Uniqueness is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations
verifiable random functions trapdoor permutations black-box separations
2010/12/22
Verifiable random functions (VRFs), firstly proposed by Micali, Rabin, and Vadhan (FOCS 99), are pseudorandom functions with the additional property that the owner of the seed $\vsk$ can issue publicl...
Public Key Cryptography from Different Assumptions
Public Key Cryptography pseudorandom generator random graph
2009/6/5
In this work we give a construction of a public key encryption based on di erent assumptions. The
proposed system has, at this point, two major drawbacks. First, the new assumptions are not as well-s...
Efficient Conversion of Secret-shared Values Between Different Fields
Efficient Conversion Secret-shared Values Different Fields
2009/6/4
We show how to effectively convert a secret-shared bit b over
a prime field to another field. If initially given a random replicated secret
share this conversion can be done by the cost of revealing...
Complexity of the Collision and Near-Collision Attack on SHA-0 with Different Message Schedules
Collision and Near-Collision Attack SHA-0 Different Message Schedules
2009/4/2
SHA-0 employs a primitive polynomial of degree 16 over
GF(2) in its message schedule. There are 2048 primitive polynomials
of degree 16 over GF(2). For each primitive polynomial, a SHA-0 variant
ca...