Results 21 to 30 of about 389,362 (239)

A General Analysis of the Security of Elastic Block Ciphers [PDF]

open access: yes, 2005
We analyze the security of elastic block ciphers in general to show that an attack on an elastic version of block cipher implies a polynomial time related attack on the fixed-length version of the block cipher.
Cook, Debra L.   +2 more
core   +2 more sources

Cube Testers and Key Recovery Attacks On Reduced-Round MD6 and Trivium [PDF]

open access: yes, 2009
CRYPTO 2008 saw the introduction of the hash function MD6 and of cube attacks, a type of algebraic attack applicable to cryptographic functions having a low-degree algebraic normal form over GF(2).
A. Maximov   +16 more
core   +2 more sources

A Comprehensive Study of the Key Enumeration Problem

open access: yesEntropy, 2019
In this paper, we will study the key enumeration problem, which is connected to the key recovery problem posed in the cold boot attack setting. In this setting, an attacker with physical access to a computer may obtain noisy data of a cryptographic ...
Ricardo Villanueva-Polanco
doaj   +1 more source

Investing in Prevention or Paying for Recovery - Attitudes to Cyber Risk [PDF]

open access: yes, 2019
The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Broadly speaking an individual can invest time and effort to avoid becoming victim to a cyber attack and/or
A Cartwright   +19 more
core   +2 more sources

Meet-in-the-Middle Attacks on Classes of Contracting and Expanding Feistel Constructions

open access: yesIACR Transactions on Symmetric Cryptology, 2017
We show generic attacks on unbalanced Feistel ciphers based on the meet-in-the-middle technique. We analyze two general classes of unbalanced Feistel structures, namely contracting Feistels and expanding Feistels.
Jian Guo   +3 more
doaj   +1 more source

Cryptanalysis of a One-Time Code-Based Digital Signature Scheme

open access: yes, 2019
We consider a one-time digital signature scheme recently proposed by Persichetti and show that a successful key recovery attack can be mounted with limited complexity.
Baldi, Marco   +2 more
core   +1 more source

On Known-Plaintext Attacks to a Compressed Sensing-based Encryption: A Quantitative Analysis [PDF]

open access: yes, 2015
Despite the linearity of its encoding, compressed sensing may be used to provide a limited form of data protection when random encoding matrices are used to produce sets of low-dimensional measurements (ciphertexts).
Cambareri, Valerio   +4 more
core   +2 more sources

Women, men and coronary heart disease: a review of the qualitative literature [PDF]

open access: yes, 2005
Aim. This paper presents a review of the qualitative literature which examines the experiences of patients with coronary heart disease. The paper also assesses whether the experiences of both female and male patients are reflected in the literature and ...
Annandale E.   +44 more
core   +1 more source

Public Key Encryption Supporting Plaintext Equality Test and User-Specified Authorization [PDF]

open access: yes, 2011
In this paper we investigate a category of public key encryption schemes which supports plaintext equality test and user-specified authorization. With this new primitive, two users, who possess their own public/private key pairs, can issue token(s) to a ...
Tang, Qiang
core   +5 more sources

Polynomial-Time Key Recovery Attack on the Faure-Loidreau Scheme based on Gabidulin Codes

open access: yes, 2017
Encryption schemes based on the rank metric lead to small public key sizes of order of few thousands bytes which represents a very attractive feature compared to Hamming metric-based encryption schemes where public key sizes are of order of hundreds of ...
Gaborit, Philippe   +2 more
core   +3 more sources

Home - About - Disclaimer - Privacy