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

9th International Conference on Information Security Practice and Experience, ISPEC 2013

作者： Orumiehchiha, Mohammad Ali Pieprzyk, Josef Shakour, Elham Steinfeld, Ron Center for Advanced Computing Algorithms and Cryptography Department of Computing Macquarie University Sydney NSW 2109 Australia Faculty of Mathematics Amirkabir University Tehran Iran Clayton School of Information Technology Monash University Clayton VIC 3800 Australia

ISBN: (纸本)9783642380327

Rakaposhi is a synchronous stream cipher, which uses three main components: a non-linear feedback shift register (NLFSR), a dynamic linear feedback shift register (DLFSR) and a non-linear filtering function (NLF). NLFSR consists of 128 bits and is initialised by the secret key K. DLFSR holds 192 bits and is initialised by an initial vector (IV). NLF takes 8-bit inputs and returns a single output bit. The work identifies weaknesses and properties of the cipher. The main observation is that the initialisation procedure has the so-called sliding property. The property can be used to launch distinguishing and key recovery attacks. The distinguisher needs four observations of the related (K,IV) pairs. The key recovery algorithm allows to discover the secret key K after observing 29 pairs of (K,IV). Based on the proposed related-key attack, the number of related (K,IV) pairs is 2(128+192)/4 pairs. Further the cipher is studied when the registers enter short cycles. When NLFSR is set to all ones, then the cipher degenerates to a linear feedback shift register with a non-linear filter. Consequently, the initial state (and Secret Key and IV) can be recovered with complexity 263.87. If DLFSR is set to all zeros, then NLF reduces to a low non-linearity filter function. As the result, the cipher is insecure allowing the adversary to distinguish it from a random cipher after 217 observations of keystream bits. There is also the key recovery algorithm that allows to find the secret key with complexity 254. © 2013 Springer-Verlag.

关键词： cryptography

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of RC4(n, m) stream cipher 13

Cryptanalysis of RC4(n, m) stream cipher

引用

6th International Conference on Security of Information and Networks, SIN 2013

作者： Orumiehchiha, Mohammad Ali Pieprzyk, Josef Shakour, Elham Steinfeld, Ron Center for Advanced Computing - Algorithms and Cryptography Macquarie University Sydney NSW 2109 Australia Faculty of Mathematics Amirkabir University Tehran Iran Clayton School of Information Technology Monash University Clayton VIC 3800 Australia

ISBN: (纸本)9781450324984

RC4(n, m) is a stream cipher based on RC4 and is designed by G. Gong et al. It can be seen as a generalization of the famous RC4 stream cipher designed by Ron Rivest. The authors of RC4(n, m) claim that the cipher resists all the attacks that are successful against the original RC4. The paper reveals cryptographic weaknesses of the RC4(n, m) stream cipher. We develop two attacks. The first one is based on non-randomness of internal state and allows to distinguish it from a truly random cipher by an algorithm that has access to 24·n bits of the keystream. The second attack exploits low diffusion of bits in the KSA and PRGA algorithms and recovers all bytes of the secret key. This attack works only if the initial value of the cipher can be manipulated. Apart from the secret key, the cipher uses two other inputs, namely, initial value and initial vector. Although these inputs are fixed in the cipher specification, some applications may allow the inputs to be under the attacker control. Assuming that the attacker can control the initial value, we show a distinguisher for the cipher and a secret key recovery attack that for the L-bit secret key, is able to recover it with about (L/n) · 2 n steps. The attack has been implemented on a standard PC and can reconstruct the secret key of RC(8,32) in less than a second. Copyright © 2013 ACM.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of RC4-based hash function

Conferences in Research and Practice in Information Technolo...

引用

Conferences in Research and Practice in Information Technology Series 2012年 125卷 33-38页

作者： Orumiehchiha, Mohammad Ali Pieprzyk, Josef Steinfeld, Ron Center for Advanced Computing Algorithms and Cryptography Department of Computing Faculty of Science Macquarie University Sydney NSW 2109 Australia

ISBN: (纸本)9781921770067

RC4-Based Hash Function is a new proposed hash function based on RC4 stream cipher for ultra low power devices. In this paper, we analyse the security of the function against collision attack. It is shown that the attacker can find collision and multi-collision messages with complexity only 6 compress function operations and negligible memory with time complexity 213. In addition, we show the hashing algorithm can be distinguishable from a truly random sequence with probability close to one. © 2012, Australian Computer Society, Inc.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Evolution of Cryptographic Hashing 10

Evolution of Cryptographic Hashing

引用

International Conference on Security of Information and Networks

作者： Josef Pieprzyk Center for Advanced Computing - Algorithms and Cryptography Department of Computing Macquarie University Sydney AUSTRALIA

ISBN: (纸本)9781617824661

Hash functions were invented in Computer Science as a tool for fast searching, where collisions were a desired property as long as they tend to occur with uniform probability distribution. The invention of digital signatures was one of the main stimuli for constructing cryptographic hash functions. This time cryptographic hash functions need to satisfy few strict properties. The first is that the functions should take a message of arbitrary length and produce a digest of a fixed length. The functions should also be one-way or their inversion should be an intractable task. Also they should be collision resistant, i.e. finding a pair of colliding messages should be intractable. This talk is going to discuss properties of cryptographic hashing, their structures and generic attacks. We are going to overview three basic methods of cryptographic hash function constructions, namely, hashing based on block ciphers, custom-designed hashing and finally, hashing based on intractable problems. The talk is going to be concluded by an update on the progress of the SHA-3 call.

关键词： cryptography digital signatures cryptographic hashing hashing cryptography digital signatures UNIDIRECTIONAL computer science Collisions Messages Probability distribution DIGEST cryptographic hash function Block cipher

来源：评论

学校读者我要写书评

暂无评论

Secure coprocessor-based private information retrieval without periodical preprocessing

Conferences in Research and Practice in Information Technolo...

引用

Conferences in Research and Practice in Information Technology Series 2010年 105卷 5-11页

作者： Wang, Peishun Wang, Huaxiong Pieprzyk, Josef School of Computer Science and Software Engineering University of Wollongong NSW 2522 Australia Center for Advanced Computing Algorithms and Cryptography Department of Computing Macquarie University NSW 2109 Australia Division of Mathematical Sciences School of Physical and Mathematical Sciences Nanyang Technological University Singapore

ISBN: (纸本)9781920682866

Early works on Private Information Retrieval (PIR) focused on minimizing the necessary communication overhead. Theyseemed to achieve this goal but at the expense of query response time. To mitigate this weakness, protocols with secure coprocessors were introduced. They achieve optimal communication complexity and better online processing complexity. Unfortunately, all secure coprocessor-based PIR protocols require heavy periodical preprocessing. In this paper, we propose a new protocol, which is free from the periodical preprocessing while offering the opti-mal communication complexity and almost optimal online processing complexity. The proposed protocol is proven to be secure. © 2010, Australian Computer Society, Inc.

关键词： Coprocessor

来源：评论

学校读者我要写书评

暂无评论

On the Security of PAS (Predicate-Based Authentication Service)

On the Security of PAS (Predicate-Based Authentication Servi...

引用

Annual Computer Security Applications Conference

作者： Shujun Li Hassan Jameel Asghar Josef Pieprzyk Ahmad-Reza Sadeghi Roland Schmitz Huaxiong Wang Department of Computer and Information Science University of Konstanz Germany Center of Advanced Computing Algorithms and Cryptography Macquarie University Australia System Security Group Ruhr University of Bochum Germany Department of Computer Science and Media Stuttgart Media University Germany Division of Mathematical Sciences Nanyang Technological University Singapore

ISBN: (纸本)9781424453276

Recently a new human authentication scheme called PAS (predicate-based authentication service) was proposed, which does not require the assistance of any supplementary device. The main security claim of PAS is to resist passive adversaries who can observe the whole authentication session between the human user and the remote server. In this paper we show that PAS is insecure against both brute force attack and a probabilistic attack. In particular, we show that its security against brute force attack was strongly overestimated. Furthermore, we introduce a probabilistic attack, which can break part of the password even with a very small number of observed authentication sessions. Although the proposed attack cannot completely break the password, it can downgrade the PAS system to a much weaker system similar to common OTP (one-time password) systems.

关键词： Authentication Humans cryptography Computer security Usability Information security Resists Protocols Hardware Application software

来源：评论

学校读者我要写书评

暂无评论

Improvement of a Dynamic Accumulator at ICICS 07 and Its Application in Multi-user Keyword-Based Retrieval on Encrypted Data

Improvement of a Dynamic Accumulator at ICICS 07 and Its App...

引用

IEEE Asia-Pacific Conference on Services computing (APSCC)

作者： Peishun Wang Huaxiong Wang Josef Pieprzyk Center for Advanced Computing-Algorithms and Cryptography Department of Computing Macquarie University NSW Australia

A dynamic accumulator is an algorithm, which merges a large set of elements into a constant-size value such that for an element accumulated, there is a witness confirming that the element was included into the value, with a property that accumulated elements can be dynamically added and deleted into/from the original set. Recently Wang et al. presented a dynamic accumulator for batch updates at ICICS 2007. However, their construction suffers from two serious problems. We analyze them and propose a way to repair their scheme. We use the accumulator to construct a new scheme for common secure indices with conjunctive keyword-based retrieval.

关键词： Information retrieval cryptography Keyword search Australia Council Dictionaries Broadcasting Filters Privacy Data security

来源：评论

学校读者我要写书评

暂无评论

Algebraic attacks on SOBER-t32 and SOBER-t16 without stuttering

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2004年 3017卷 49-64页

作者： Cho, Joo Yeon Pieprzyk, Josef Center for Advanced Computing - Algorithms and Cryptography Department of Computing Macquarie University NSW 2109 Australia

This paper presents algebraic attacks on SOBER-t32 and SOBER-t16 without stuttering. For unstuttered SOBER-t32, two different attacks are implemented. In the first attack, we obtain multivariate equations of degree 10. Then, an algebraic attack is developed using a collection of output bits whose relation to the initial state of the LFSR can be described by low-degree equations. The resulting system of equations contains 269 equations and monomials, which can be solved using the Gaussian elimination with the complexity of 2196.5. For the second attack, we build a multivariate equation of degree 14. We focus on the property of the equation that the monomials which are combined with output bit are linear. By applying the Berlekamp-Massey algorithm, we can obtain a system of linear equations and the initial states of the LFSR can be recovered. The complexity of attack is around O(2100) with 292 keystream observations. The second algebraic attack is applicable to SOBER-t16 without stuttering. The attack takes around O(285) CPU clocks with 278 keystream observations. © International Association for Cryptologic Research 2004.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Separability criterion for separate quantum systems

Separability criterion for separate quantum systems

引用

Quantum Electronics and Laser Science, QELS 2003

作者： Raymer, M.G. Funk, A. Sanders, B.C. De Guise, H. Oregon Center for Optics Department of Physics University of Oregon EugeneOR97403 United States Department of Physics Centre for Advanced Computing -Algorithms and Cryptography Macquarie University SydneyNSW2109 Australia Dept. of Physics Lakehead University Thunder BayOntarioP7B 5E1 Canada

We develop a sufficiency criterion for quantum separability, valid for arbitrary states of two arbitrary systems. Our criterion confirms spin entanglement of two macroscopic atomic samples in experiments by Julsgaard,... 详细信息

ISBN: (纸本)1557527490

关键词： Quantum optics

来源：评论

学校读者我要写书评

暂无评论

Separability criterion for separate quantum systems

Separability criterion for separate quantum systems

引用

Quantum Electronics and Laser Science Conference (QELS)

作者： M.G. Raymer A. Funk B.C. Sanders H. de Guise Oregon Center for Optics and Department of Physics University of Oregon Eugene OR USA Departmnent of Physics and Centre for Advanced Computing-Algorithms and Cryptography Macquarie University Sydney NSW Australia Department of Physics Lakehead University Thunder Bay ONT Canada

Summary form only given. We develop a sufficiency criterion for quantum separability, valid for arbitrary states of two arbitrary systems. Our criterion confirms spin entanglement of two macroscopic atomic samples in ... 详细信息

关键词： Quantum entanglement Atom optics Quantum computing Physics computing cryptography Australia Lakes Electron microscopy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：