检索结果-内蒙古大学图书馆

6th International Conference on Anti-Counterfeiting, Security and Identification (ASID)

作者： Li, Lingyun Li, Junqing Yu, Huishan Xie, Shengxian Liaocheng Univ Sch Comp Sci Liaocheng Peoples R China

ISBN: (纸本)9781467321433

Some variants of second-preimage resistance(SPR)[1] assumptions of the keyless compression function, called c-SPR, r-SPR and e-SPR, have been put forth by Halevi and Krawczyk[2], in order to obtain more secure properties for the dedicated-key hash function. In this paper, we provide a full picture of the relation between r-SPR and other two security properties, Universal e-SPR and CR0 (n + b, n), and obtain two sufficient conditions of r-SPR, our contributions are twofold. Firstly, we extend the definition of the e-SPR property into the more general situation, called Universal e-SPR, we point out that for the keyless compression function, the Universal e-SPR property implies r-SPR. In the second part of this paper, we extend the analysis into the dedicated-key compression function, we point CRn (n + b, n) and CR0 (n + b, n) are c-SPR and r-SPR as for the keyless compression and hash functions. We continue analyze the dedicated-key compression family h(k) (c, m)= h(c, m circle plus k) used by Bellare and Rogaway to construct TCR hash function via iterations on the SPR-like assumption[2], and get the conclusion that CR0 (n + b, n) in the case of h(k) (c, m) implies r-SPR of keyless compression function, that is, CR0 (n + b, n) is more secure than the r-SPR property for this specific scheme.

关键词： compression function hash function second preimage resistance demain extension

来源：评论

学校读者我要写书评

暂无评论

Preimage awareness proofs of two compression functions

Preimage awareness proofs of two compression functions

引用

2010 IEEE International Conference on Information Theory and Information Security, ICITIS 2010

作者： Li, Mengdong Department of Information Security Beijing Electronic Science and Technology Institute Beijing China

ISBN: (纸本)9781424469406

Hash functions have to be with many security properties to meet the demands of various applications. The preimage awareness (PrA), proposed by Dodis et al., is a security property of hash function that lies between being a random oracle (RO) and collision resistance (CR). The virtue of PrA is that Merkle-Damgard (MD) paradigm is PrA preserving and one can realized a PRO hash function through composing a PRO compression function and a PrA hash function. In this paper we prove Stam's two compression functions having PrA property, where one proof is new and another is difference from Lee et al.'s proof. © 2010 IEEE.

关键词： compression function Domain extension Hash function Merkle-Damgard paradigm PRO compression function PrA property Preimage aware collision resistance cryptography data compression hash function preimage awareness proof random oracle security property

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of Tav-128 Hash function

Cryptanalysis of Tav-128 Hash Function

引用

11th International Conference on Cryptology in India

作者： Kumar, Ashish Sanadhya, Somitra Kumar Gauravaram, Praveen Safkhani, Masoumeh Naderi, Majid Indian Inst Technol Kharagpur 721302 W Bengal India Indraprastha Inst Informat Technol New Delhi India Tech Univ Denmark Lyngby Denmark Iran Univ Sci & Technol Tehran Iran

ISBN: (纸本)9783642174001

Many RFID protocols use cryptographic hash functions for their security. The resource constrained nature of RFID systems forces the use of light weight cryptographic algorithms. Tav-128 is one such 128-bit light weight hash function proposed by Pens-Lopez et al. for a low-cost RFID tag authentication protocol. Apart from some statistical tests for randomness by the designers themselves, Tav-128 has not undergone any other thorough security analysis. Based on these tests, the designers claimed that Tav-128 does not posses any trivial weaknesses. In this article, we carry out the first third party security analysis of Tav-128 and show that this hash function is neither collision resistant nor second preimage resistant. Firstly, we show a practical collision attack on Tav-128 having a complexity of 2(37) calls to the compression function and produce message pairs of arbitrary length which produce the same hash value under this hash function. We then show a second preimage attack on Tav-128 which succeeds with a complexity of 2(62) calls to the compression function. Finally, we study the constituent functions of Tav-128 and show that the concatenation of nonlinear functions A and B produces a 64-bit permutation from 32-bit messages. This could be a useful light weight primitive for future RFID protocols.

关键词： Hash function Tav-128 Cryptanalysis RFID compression function

来源：评论

学校读者我要写书评

暂无评论

Domain extender for collision resistant hash functions: Improving upon Merkle-Damgard iteration

引用

DISCRETE APPLIED MATHEMATICS 2009年第5期157卷 1086-1097页

作者： Sarkar, Palash Indian Stat Inst Appl Stat Unit Kolkata 700108 India

We study the problem of securely extending the domain of a collision resistant compression function. A new construction based on directed acyclic graphs is described. This generalizes the usual iterated hashing constructions. Our main contribution is to introduce a new technique for hashing arbitrary length strings. Combined with DAG-based hashing, this technique yields a new hashing algorithm. The amount of padding and the number of invocations of the compression function required by the new algorithm is smaller than the general Merkle-Damgard algorithm. (C) 2008 Elsevier B.V. All rights reserved.

关键词： Hash function compression function Composition principle Collision resistance Directed acyclic graph

来源：评论

学校读者我要写书评

暂无评论

compression functions Suitable for the Multi-Property-Preserving Transform

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2008年第10期E91A卷 2851-2859页

作者： Kuwakado, Hidenori Morii, Masakatu Kobe Univ Grad Sch Engn Kobe Hyogo 6578501 Japan

Since Bellare and Ristenpart showed a multi-property preserving domain extension transform, the problem of the construction for multi-property hash functions has been reduced to that of the construction for multi-property compression functions. However, the Davies-Meyer compression function that is commonly used for standard hash functions is not a multi-property compression function. That is, in the ideal cipher model, the Davies-Meyer compression function is collision resistant, but it is not indifferentiable from a random oracle. In this paper, we show that the compression function proposed by Lai and Massey is a multi-property compression function. In addition, we show that the simplified version of the Lai-Massey compression function is also a multi-property compression function. The use of these compression functions enables us to construct multi-property hash functions by the multi-property preserving domain extension transform.

关键词： compression function hash function multi-property preserving

来源：评论

学校读者我要写书评

暂无评论

Constructing an ideal hash function from weak ideal compression functions

Constructing an ideal hash function from weak ideal compress...

引用

13th Annual International Workshop on Selected Areas in Cryptography

作者： Liskov, Moses Coll William & Mary Dept Comp Sci Williamsburg VA 23185 USA

ISBN: (纸本)9783540744610

We introduce the notion of a weak ideal compression function, which is vulnerable to strong forms of attack, but is otherwise random. We show that such weak ideal compression functions can be used to create secure hash functions, thereby giving a design that can be used to eliminate attacks caused by undesirable properties of compression functions. We prove that the construction we give, which we call the "zipper hash," is ideal in the sense that the overall hash function is indistinguishable from a random oracle when implemented with these weak ideal building blocks. The zipper hash function is relatively simple, requiring two compression function evaluations per block of input, but it is not streamable. We also show how to create an ideal (strong) compression function from ideal weak compression functions, which can be used in the standard iterated way to make a streamable hash function.

关键词： hash function compression function Merkle-Damgard ideal primitives non-streamable hash functions zipper hash

来源：评论

学校读者我要写书评

暂无评论

Analysis of Zipper as a hash function

引用

4th Information Security Practice and Experience Conference (ISPEC 2008)

作者： Lin, Pin Wu, Wenling Wu, Chuankun Qiu, Tian Chinese Acad Sci Inst Software State Key Lab Informat Secur Beijing 100864 Peoples R China Chinese Acad Sci Inst Software Natl Key Lab Integrated Informat Sys Technol Beijing 100864 Peoples R China Chinese Acad Sci Grad Sch Beijing Peoples R China

ISBN: (纸本)9783540791034

At CRYPTO 2005, Coron etc. proposed several modified methods to make the usual hash functions based on MD method indifferentiable from random oracles. However, the compression functions used in Coron's schemes are supposed to be random oracles. This assumption is too strong. To achieve Coron's goal in the real world, Liskov proposed Zipper structure and implemented a new scheme indifferentiable from random oracle based on this structure. Unlike Coron's schemes, the indifferentiability of Liskov's scheme does not depend on strong compression functions and insecure compression functions can be used to implement Liskov's scheme. In this paper, we show that the security of Liskov's scheme is not ideal as a hash function. We also analyze those Zipper schemes whose compression functions are insecure PGV compression functions instead of Liskov's weak compression functions, and we find that some insecure PGV compression functions whose security is stronger than Liskov's weak compression function cannot be used to build indifferentiable and collision-resistant Zipper schemes.

关键词： Zipper hash function compression function

来源：评论

学校读者我要写书评

暂无评论

A One-Pass Mode of Operation for Deterministic Message Authentication - Security beyond the Birthday Barrier

引用

15th International Workshop on Fast Software Encryption

作者： Yasuda, Kan NTT Corp NTT Informat Sharing Platform Labs Musashino Tokyo 1808585 Japan

ISBN: (纸本)9783540710387

We present a novel mode of operation which iterates a compression function f : {0, 1}(n+b) -> {0, 1}(n) meeting a condition b >= 2n. Our construction can be viewed as a way of domain extension, applicable to a fixed-input-length PRF (pseudo-random function) f(k) : {0, 1}(b) -> {0, 1}(n) meeting the condition b >= 2n, which yields an arbitrary-input-length PRE F-k. : {0, 1}* -> {0, 1}(n). Our construction accomplishes both high security (beyond the birthday barrier) and high efficiency (onepass), with engineering considerations of being stateless, deterministic and single-keyed.

关键词： pseudo-random function domain extension birthday barrier compression function mode of operation message authentication code tweak checksum quasi-random function

来源：评论

学校读者我要写书评

暂无评论

Flow properties of cohesive powders tested by a press shear cell

引用

PARTICULATE SCIENCE AND TECHNOLOGY 2006年第4期24卷 353-367页

作者： Grossmann, L. Tomas, J. Otto Von Guericke Univ Dept Mech Proc Engn D-39106 Magdeburg Germany

The most important design parameters for roller presses can be referred to flow and compression characteristics of bulk materials. Usually the flow properties are measured in the low stress range 1-50 kPa at the shear rate of about 1mm/min. But this does not fit the stress regimes in the roller press. Therefore, the compression and flow behavior of the powder have to be investigated at higher pressures, shear rates, and shear displacements. These properties of bulk materials in the so-called medium pressure range 50-1000 kPa can be analyzed using a press shear cell. Tests were implemented with limestone, bentonite, and microcrystalline cellulose at average 23 degrees C powder bed temperature using shear rates from 0.00042 to 0.042m/s and a more realistic preshear displacement from 0.1 to 2m for practical applications in powder compaction. Physical observation based compression functions were developed for the low and medium pressure range, which include simple equations for the compression rate and specific compression work.

关键词： compression compression function flow properties medium pressure range press shear cell

来源：评论

学校读者我要写书评

暂无评论

Reducing the collision probability of alleged Comp128 3rd

引用

3rd International Conference on Smart Card Research and Advanced Applications

作者： Handschuh, H Paillier, P GEMPLUS Cryptog Dept F-92447 Issy Les Moulineaux France ENST Dept Comp Sci F-75634 Paris 13 France

ISBN: (纸本)3540679235

Wagner, Goldberg and Briceno have recently published an attack [2] on what they believe to be Comp 128, the GSM A3A8 authentication function [1]. Provided that the attacker has physical access to the card and to its secret PIN code (the card has to be activated), this chosen plaintext attack recovers the secret key of the personalized SIM (Secure Identification Module) card by inducing collisions on the second (out of 40) round of the compression function. In this paper we suggest two different approaches to strengthen the alleged Comp128 algorithm with respect to this attack. An evaluation of the number of chosen plain-texts and the new complexity of the attack are given.

关键词： alleged Comp128 chosen plaintext attack authentication compression function cryptanalysis smart cards GSM

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：