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

On an attack on RSA with small CRT-exponents

Science China(Information Sciences) 2010年第8期53卷 1511-1518页

作者： HAN LiDong 1,2 , WANG XiaoYun 3 & XU GuangWu 3,4 1 Key Laboratory of Cryptologic Technology and Information security, Ministry of Education, Shandong University, Jinan 250100, China 2 School of mathematics, Shandong University, Jinan 250100, China 3 Institute for Advanced Study, Tsinghua University, Beijing 100084, China 4 department of Electrical engineering and computer Science, University of Wisconsin-Milwaukee, Milwaukee, WI 53201, USA 1. Key Laboratory of Cryptologic Technology and Information Security Ministry of Education Shandong University Jinan 250100 China2. School of Mathematics Shandong University Jinan 250100 China3. Institute for Advanced Study Tsinghua University Beijing 100084 China4. Department of Electrical Engineering and Computer Science University of Wisconsin-Milwaukee Milwaukee WI 53201 USA

This paper concerns the RSA system with private CRT-exponents. Since Chinese remainder representation provides efficiency in computation, such system is of some practical significance. In this paper, an existing attack to small private CRT-exponents is analyzed. It is indicated that this attack makes nice use of lattice in RSA analysis, but some argument does not hold in general. Several counterexamples are constructed. Refinements and more precise statements of the attack are given.

关键词： RSA CRT cryptanalysis continued fraction lattice reduction

来源：评论

学校读者我要写书评

暂无评论

A new secret sharing scheme based on commutative encrypted function

A new secret sharing scheme based on commutative encrypted f...

引用

International Forum on Information Technology and Applications

作者： He, Jun Li, Ximei Li, Lijuan Tang, Chunming Computer and Information Engineering Department HuaiHua Vocational and Technical College Huaihua Hunan 418000 China School of Computer and Communication Hunan University Changsha Hunan 410082 China School of Mathematics and Information Science Guangzhou University Guangzhou Guangdong 510006 China State Key Laboratory of Information Security Institute of Software Science CAS Beijing 100080 China

ISBN: (纸本)9780769541150

With the characteristic that the commutativity of modular exponential function makes the specific order of secret distribution process less important and on basis of the abstruseness of discrete logarithm, this paper proposed a new secret sharing scheme. In the scheme, the participants themselves select the private keys, which can avoid the distributor's fraud and reduce the distribution's burden as well as ensure the scheme's reuse. The credible participants can join in or leave the participants collection at any time without restarting the scheme procedures. © 2010 IEEE.

关键词： Exponential functions

来源：评论

学校读者我要写书评

暂无评论

A new forward-secure proxy signature scheme

A new forward-secure proxy signature scheme

引用

2010 International Forum on Information Technology and Applications, IFITA 2010

ISBN: (纸本)9780769541150

Based on the shortcomings of WCF scheme, this paper proposed an improved forward-secure proxy signature scheme. The new scheme does not evolve the authorized keys, but the proxy signer's private key, making it have the forward security. Even if the proxy signer's signature key at a certain time segment is given away, the attacker could not get the proxy signer's signature key in the previous time segment. Under these assumptions of strong RSA problem, computational Diffie-Hellman problem being hard, and discrete logarithm problem being hard in a finite field, the scheme has favorable security. © 2010 IEEE.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Authenticated Asymmetric Group Key Agreement Protocol and Its Application

Authenticated Asymmetric Group Key Agreement Protocol and It...

引用

IEEE International Conference on Communications

作者： Lei Zhang Qianhong Wu Bo Qin Department of Computer Engineering and Mathematics Universitat Rovira i Virgili Catalonia Spain School of Computer Key Laboratory of AeroSpace Information Security and Trusted Computing Ministry of Education Wuhan University of China China School of Science Department of Maths Xi''an University of Technology China

A recent primitive known as asymmetric group key agreement allows a group of users to negotiate a common encryption key which is accessible to any entities while each user holds her respective secret decryption key. This concept not only enables confidential communications among group users but also permits any outsider to send encrypted messages to the group. The existing instantiation is only secure against passive adversaries. In this paper, we first propose an authenticated asymmetric group key agreement protocol which captures the practical security properties against active attacks. Based on our protocol, we then propose a broadcast encryption system without relying on a trusted dealer to distribute the secret keys to the users. Our system has also short ciphertexts. Furthermore, the proposal is equipped with the perfect forward security property.

关键词： Protocols Cryptography Broadcasting Peer to peer computing Communication system security Bandwidth Communication channels Multimedia communication Communications Society Application software

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Certificateless Signatures

Hierarchical Certificateless Signatures

引用

IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, EUC

作者： Lei Zhang Qianhong Wu Josep Domingo-Ferrer Bo Qin UNESCO Chair in Data Privacy Department of Computer Engineering and Mathematics Universitat Rovira i Virgili Catalonia Spain School of Computer Key Laboratory of AeroSpace Information Security and Trusted Computing Wuhan University of Technology China School of Science Department of Maths Xi'an University of Technology China

Certificateless cryptography eliminates the key escrow problem in identity-based cryptography. Hierarchical cryptography exploits a practical security model to mirror the organizational hierarchy in the real world. In this paper, to incorporate the advantages of both types of cryptosystems, we instantiate hierarchical certificate less cryptography by formalizing the notion of hierarchical certificate less signatures. Furthermore, we propose an HCLS scheme which, under the hardness of the computational Diffie-Hellman (CDH) problem, is proven to be existentially unforgeable against adaptive chosen-message attacks in the random oracle model. As to efficiency, our scheme has constant complexity, regardless of the depth of the hierarchy. Hence, the proposal is secure and scalable for practical applications.

关键词： Public key Games Artificial intelligence Tin Protocols

来源：评论

学校读者我要写书评

暂无评论

A novel clustering topology control for reliable multi-hop routing in wireless sensor networks

引用

Journal of Communications 2010年第9期5卷 654-664页

作者： Du, Ruiying Ai, Chunyu Guo, Longjiang Chen, Jing Liu, Jianwei He, Jing Li, Yingshu School of Computer science Wuhan University Wuhan China State Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education Wuhan China Department of Mathematics Physics Computer Science and Geomatics Troy University Troy AL 36082 United States Department of Computer Science Heilongjiang University Harbin China Department of Computer Science Georgia State University Atlanta GA 30303 United States School of Electronics Information Engineering Beihang University Beijing China

The reliability of wireless sensor networks is significant in certain applications, especially the reliable routing. Most existing routing protocols use multi-paths to improve routing reliability. However, multi-paths waste a large amount of energy to obtain redundancy. This is not an optimal option for sensor nodes with limited energy. In this paper, a novel clustering-based reliable multi-hop routing algorithm (CRMR) is proposed. The algorithm adopts a mechanism of multiple backup cluster heads efficiently to extend time of stable period of clusters and to decrease energy consumption for reconstructing clusters. The local reconstruction of clusters is addressed for improving coverage, maintaining connectivity, and extending the network lifetime. While the algorithm overcomes the randomicity of selecting cluster heads and ensures well proportioned clusters. Employing backup cluster heads and gateways can ensure reliability of routing and overcome disadvantages of most existing reliable routing protocols, which is to preserve multiple backup paths. The algorithm adopts query driving data transmission mode for finding routes and bypassing unavailable routing nodes for backtracking to ensure the speediness of data transmissions and the reliability. The simulation results show that the algorithm can achieve good performance on both routing reliability and energy consumption. © 2010 ACADEMY PUBLISHER.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

A New Forward-Secure Proxy Signature Scheme

A New Forward-Secure Proxy Signature Scheme

引用

International Forum on Information Technology and Applications, IFITA

作者： Jun He Ximei Li Lijuan Li Chunming Tang Computer and Information Engineering Department HuaiHua Vocational and Technical College Huaihua Hunan China School of Computer and Communication Hunan University Changsha Hunan China State Key Laboratory of Information Security CAS State Key Laboratory of Information Security Hunan China CAS Institute of Software Science Beijing China School of Mathematics and Information Science Guangzhou University Guangzhou Guangdong China

关键词： Digital signatures Public key Mathematical model Equations Authorization computers

来源：评论

学校读者我要写书评

暂无评论

Protection of an intrusion detection engine with watermarking in Ad hoc networks

引用

International Journal of Network security 2010年第2期10卷 93-106页

作者： Mitrokotsa, Aikaterini Komninos, Nikos Douligeris, Christos Information and Communication Theory Group Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Mekelweg 4 2628 CD Delft Netherlands Algorithms and Security Group Athens Information Technology GR-19002 Peania Greece Department of Informatics University of Piraeus GR-18534 Piraeus Greece

In this paper we present an intrusion detection engine comprised of two main elements;firstly, a neural network for the actual detection task and secondly watermarking techniques for protecting the related information that must be exchanged between nodes. In particular, we exploit information visualization and machine learning techniques in order to achieve efficient and effective intrusion detection. In order to avoid possible modification or alteration of the maps produced by the intrusion detection engine, we focus on safeguarding and authenticating them using a novel embedded watermarking method. Previously, we had shown promising results in the intrusion detection task using this system. This paper focuses on the watermarking technique and gives a detailed exposition that includes an experimental evaluation of its quality.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

A New Secret Sharing Scheme Based on Commutative Encrypted Function

A New Secret Sharing Scheme Based on Commutative Encrypted F...

引用

International Forum on Information Technology and Applications, IFITA

作者： Jun He Ximei Li Lijuan Li Chunming Tang Computer and Information Engineering Department HuaiHua Vocational and Technical College Huaihua Hunan China School of Computer and Communication Hunan University Changsha Hunan China School of Mathematics and Information Science Guangzhou University Guangzhou Guangdong China State Key Laboratory of Information Security Institute of Software Science Chinese Academy and Sciences Beijing China

关键词： Encryption computers Performance analysis Presses Data mining

来源：评论

学校读者我要写书评

暂无评论

A generic weakness of the k-normal Boolean functions exposed to dedicated algebraic attack

A generic weakness of the k-normal Boolean functions exposed...

引用

International Symposium on Information Theory and Its Applications, ISITA

作者： Miodrag Mihaljević Sugata Gangopadhyay Goutam Paul Hideki Imai Mathematical Institute Serbian Academy of Arts and Sciences Belgrade Serbia Serbian Academy of Sciences and Arts Mathematical Institute Belgrade Serbia Research Center for Information Security (RCIS) Nat. Inst. Adv. Ind. Sci.&Tech. (AIST) Tokyo Japan Department of Mathematics Indian Institute of Technology Roorkee India Department of Computer Science and Engineering Jadavpur University Kolkata India Faculty of Sciences and Engineering Chuo University Tokyo Japan RCIS-AIST Tokyo Japan

A Boolean function is k-normal if it is constant on a k-dimensional flat of its domain. This paper demonstrates that k-normality of a Boolean function can be exploited to mount a dedicated algebraic attack on a stream cipher of the nonlinear filter generator type, which employs a k-normal Boolean function as its filter function. The cryptanalysis is based on the possibility for pre-computing a table of the state-key stream pairs via solving certain system of algebraic equations as a consequence of the employed k-normal Boolean function. This pre-computed table is the main origin for mounting the cryptanalysis and it is independent of a the sample for cryptanalysis and the secret key employed for generating the sample.

关键词： Boolean functions Generators Cryptography Equations Algorithm design and analysis Complexity theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：