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

Self-injective rings and linear (weak) inverses of linear finite automata over rings

Science China Mathematics 1999年第2期42卷 140-146页

作者：欧海文戴宗铎 1. State Key Laboratory of Information Security Graduate School University of Science and Technology of China 100039 Beijing China

LetR be a finite commutative ring with identity and τ be a nonnegative integer. In studying linear finite automata, one of the basic problems is how to characterize the class of rings which have the property that every (weakly) invertible linear finite automaton ? with delay τ over R has a linear finite automaton ?′ over R which is a (weak) inverse with delay τ of ?. The rings and linear finite automata are studied by means of modules and it is proved that *-rings are equivalent to self-injective rings, and the unsolved problem (for τ=0) is solved. Moreover, a further problem of how to characterize the class of rings which have the property that every invertible with delay τ linear finite automaton ? overR has a linear finite automaton ?′ over R which is an inverse with delay τ′ for some τ′?τ is studied and solved.

关键词： linear finite automaton (weak) inverse with delay τ self-idective ring

来源：评论

学校读者我要写书评

暂无评论

Robust AVS audio watermarking

引用

Science China(information Sciences) 2010年第3期53卷 607-618页

作者： WANG Yong & HUANG JiWu Guangdong key {1. of information security technology, School of information Science and technology, Sun Yat-Sen University, Guangzhou 51.275, China 1. Guangdong Key Laboratory of Information Security Technology School of Information Science and Technology Sun Yat-Sen University Guangzhou 510275 China

Part Ⅲ of AVS (China Audio and Video Coding Standard) is the first generic audio standard proposed in China and is becoming popular in some applications. For MP3 audio, some effiorts have been made to solve the copyright pirating and malicious modifications by the way of watermarking. To our best knowledge, similar work on the AVS audio has not been explored. In this paper, we present a novel robust watermarking algorithm for AVS audio. We find that the frame type in the AVS coded process can be used as a robust feature for watermarking. Then we design a novel watermarking algorithm which is integrated into the AVS audio coding process. The watermark bits are embedded into the compressed bit stream. At the extracting end, the watermark bits can be extracted from the compressed bit stream directly. This algorithm achieves robustness to decoding/re-coding attacks, and has low computation complexity for both embedding and extracting while preserving the quality of the audio signals.

关键词： AVS audio security problems robust watermarking

来源：评论

学校读者我要写书评

暂无评论

Twisted Ate pairing on hyperelliptic curves and applications

引用

Science China(information Sciences) 2010年第8期53卷 1528-1538页

作者： ZHANG FangGuo 1.2 1.School of information Science and {1., Sun Yat-Sen University, Guangzhou 51.275, China 2 Guangdong key laboratory of information security {1., Guangzhou 51.275, China 1. School of Information Science and Technology Sun Yat-Sen University Guangzhou 510275 China2. Guangdong Key Laboratory of Information Security Technology Guangzhou 510275 China

In this paper we show that the twisted Ate pairing on elliptic curves can be generalized to hyperelliptic curves, and give a series of variations of the hyperelliptic Ate and twisted Ate pairings. Using the hyperelliptic Ate pairing and twisted Ate pairing, we propose a new approach to speeding up the Weil pairing computation. For some hyperelliptic curves with high degree twist, computing Weil pairing by our approach may be faster than Tate pairing, Ate pairing, and all other known pairings.

关键词： Ate pairing Weil pairing hyperelliptic curves pairing-based cryptosystems twisted curves

来源：评论

学校读者我要写书评

暂无评论

Steganalysis of stochastic modulation steganography

引用

Science in China(Series F) 2006年第3期49卷 273-285页

作者： HE Junhui1.2 & HUANG Jiwu1.2 1. School of information Science and {1., Sun Yat-sen University, Guangzhou 51.275, China 2. Guangdong Province key laboratory of information security, Guangzhou 51.275, China 1. School of Information Science and Technology Sun Yat-sen University Guangzhou 510275 China 2. Guangdong Province Key Laboratory of Information Security Guangzhou 510275 China

Stochastic modulation steganography embeds secret message within the cover image by adding stego-noise with a specific probabilistic distribution. No method is known to be applicable to the estimation of stochastic modulation steganography. By analyzing the distributions of the horizontal pixel difference of images before and after stochastic modulation embedding, we present a new steganalytic approach to accurately estimate the length of secret message in stochastic modulation steganography. The pro- posed method first establishes a model describing the statistical relationship among the differences of the cover image, stego-image and stego-noise. In the case of stegoimage-only steganalysis, rough estimate of the distributional parameters of the cover image＇s pixel difference is obtained with the use of the provided stego-image. And grid search and Chi-square goodness of fit test are exploited to estimate the length of the secret message embedded with stochastic modulation steganography. The experimental results demonstrate that our new approach is effective for steganalyzing stochastic modulation steganography and accurately estimating the length of the secret message.

关键词： information hiding steganography steganalysis stochastic modulation statistical distribution models of difference.

来源：评论

学校读者我要写书评

暂无评论

New application methods for word-oriented cryptographic primitives

引用

Science China(information Sciences) 2012年第9期55卷 2149-2160页

作者： YANG Yang 1.2,ZENG Guang 1.2,JIN ChengHui 1.& QU YunYing 1.1.Zhengzhou information Science and {1. Institute,Zhengzhou 450002,China 2 State key laboratory of information security,Institute of Software,Chinese Academy of Sciences,Beijing 1.01.0,China 1. Zhengzhou Information Science and Technology Institute Zhengzhou 450002 China2. State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing 100190 China

Modern software oriented symmetric ciphers have become a key feature in utilizing word-oriented cryptographic *** the output sequence,in the order of its generation,of a word-oriented cryptographic primitive in the same way as traditional bit-oriented primitives,we can expose the intrinsic weakness of these primitives,especially for word-oriented linear feedback shift registers,T-functions,and so *** new methods for using word-oriented cryptographic primitives are presented in this paper,that is,the extracted state method and cascading extracted coordinate *** a T-function as an example,we research the different cryptographic properties of the output sequences of the original method and the two proposed methods,focusing mainly on period,linear complexity,and k-error linear *** conclusions show that the proposed methods could enhance at low cost the cryptographic properties of the output *** a result,since the new methods are simple and easy to implement,they could be used to design new word-oriented cryptographic primitives.

关键词： stream cipher single cycle T-function linear complexity k-error linear complexity

来源：评论

学校读者我要写书评

暂无评论

A provable secure fuzzy identity based signature scheme

引用

Science China(information Sciences) 2012年第9期55卷 2139-2148页

作者： WANG ChangJi 1.2 1.School of information Science and {1.,Sun Yat-sen University,Guangzhou 51.275,China 2 Guangdong Province information security key laboratory,Sun Yat-sen University,Guangzhou 51.275,China 1. School of Information Science and Technology Sun Yat-sen University Guangzhou 510275 China2. Guangdong Province Information Security Key Laboratory Sun Yat-sen University Guangzhou 510275 China

To use biometrics identities in an identity based encryption system,Sahai and Waters first introduced the notion of fuzzy identity based encryption(FIBE) in *** et *** it to digital signature and introduced the concept of fuzzy identity based signature(FIBS) in 2008,and constructed an FIBS scheme based on Sahai and Waters's FIBE *** this paper,we further formalize the notion and security model of FIBS scheme and propose a new construction of FIBS scheme based on bilinear *** proposed scheme not only provides shorter public parameters,private {1. and signature,but also have useful structures which result in more efficient verification than that of Yang et al.'s FIBS *** proposed FIBS scheme is proved to be existentially unforgeable under a chosen message attack and selective fuzzy identity attack in the random oracle model under the discrete logarithm assumption.

关键词： identity based cryptosystem fuzzy identity based encryption fuzzy identity based signature

来源：评论

学校读者我要写书评

暂无评论

Conjugate adjoining problem in braid groups and new design of braid-based signatures

引用

Science China(information Sciences) 2010年第3期53卷 524-536页

作者： WANG LiCheng1.2, WANG LiHua2, CAO ZhenFu3, YANG YiXian1.& NIU XinXin1.information {1. Center, State key laboratory of Networking and Switching technology, Beijing University of Posts and Telecommunications, Beijing 1.0876, China 2National Institute of information and Communications technology, Tokyo 1.4-8795, Japan 3Trusted Digital technology laboratory, Shanghai Jiao Tong University, Shanghai 200240, China 1. Information Security Center State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China2. National Institute of Information and Communications Technology Tokyo 184-8795 Japan3. Trusted Digital Technology Laboratory Shanghai Jiao Tong University Shanghai 200240 China

The development of quantum computation casts serious threats to the securities of most existing public-key cryptosystems. Braid-based cryptography is one of the alternatives that have potential advantages in resisting quantum attacks. In this paper, the state of the art of braid cryptography is surveyed, and then a new cryptographic problem-conjugate adjoining problem related to braid groups is proposed. Based on this problem, we design a new braid-based signature scheme. This scheme is efficient and provably secure in the random oracle model. Further, we present the comparison between braid-based signatures and RSA-based ones. The signing process of the braid-based schemes is more efficient than that of RSA-based ones, while the verifying process of the braid-based ones is observably slow. Hence, braid-based signatures are suitable for scenarios where the signing process has to be as quick as possible but delays are permitted in the verifying process, for example, in off-line e-cash systems. The key sizes in braid-based schemes are considerably large-about 2K bits in the case of secret keys and 1.K bits in the case of public keys. However, braid operations are much simpler and more efficient than modular exponential operations. Therefore, braid-based schemes can be embedded into devices with low computational ability and large memory space. The capability of braid cryptosystems to resist currently known quantum attacks is also discussed from the perspective of hidden subgroup problems.

关键词： braid group conjugate adjoining problem digital signature provable security resistance to quantum attack

来源：评论

学校读者我要写书评

暂无评论

On the number of rotation symmetric Boolean functions

引用

Science China(information Sciences) 2010年第3期53卷 537-545页

作者： FU ShaoJing1. LI Chao1.2 & QU LongJiang1.3 1.cience College of National University of Defense technology, Changsha 41.073, China 2State {1. laboratory of information security, Beijing 1.0039, China 3National Mobile Communications Research laboratory, Southeast University, Nanjing 21.096, China 1. Science College of National University of Defense Technology Changsha 410073 China2. State Key Laboratory of Information Security Beijing 100039 China3. National Mobile Communications Research Laboratory Southeast University Nanjing 210096 China

Rotation symmetric Boolean functions (RSBFs) have been used as components of different cryptosystems. This class of functions are invariant under circular translation of indices. In this paper, we investigated balanced RSBFs and 1.t order correlation immune RSBFs. Based on constructive techniques, we give an accurate enumeration formula for n-variable balanced RSBFs when n is a power of a prime. Furthermore, an original and efficient method to enumerate all n-variable (n prime) 1.t order correlationimmune functions is presented. The exact number of 1.t order correlation immune RSBFs with 1. variables is 69250471.65504788252252503741.976451.077684773805520800 and the number of 1. variables has 1.9 digits. Then for more variables, we also provide a significant lower bound on the number of 1.t order correlation immune RSBFs.

关键词： cryptography rotation symmetry correlation immunity balancedness

来源：评论

学校读者我要写书评

暂无评论

Threshold proxy quantum signature scheme with threshold shared verification

引用

Science China(Physics,Mechanics & Astronomy) 2008年第8期51卷 1079-1088页

作者： YANG YuGuang1,3,4 & WEN QiaoYan2 1 College of Computer Science and technology,Beijing University of technology,Beijing 100124,China 2 State key laboratory of Networking and Switching technology,Beijing University of Posts and Tele-communications,Beijing 100876,China 3 State key laboratory of Integrated Services Network,Xidian University,Xi’an 710071,China 4 State key laboratory of information security(Graduate University of Chinese Academy of Sciences) ,Beijing 100049,China 1. College of Computer Science and Technology Beijing University of Technology Beijing 100124 China 3. State Key Laboratory of Integrated Services Network Xidian University Xi’an 710071 China 4. State Key Laboratory of Information Security (Graduate University of Chinese Academy of Sciences) Beijing 100049 China 2. State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China

A threshold proxy quantum signature scheme with threshold shared verification is proposed. An original signer could authorize a group as its proxy signers. Then only t or more of n persons in the proxy group can generate the proxy signature on behalf of the original signer and any t-1.or fewer ones cannot do that. When the proxy signature needs to be verified,any t or more of n persons belonging to the verification group can verify the message and any t-1.or fewer ones cannot verify the validity of the proxy signature.

关键词： quantum signature threshold proxy quantum group signature threshold shared verification

来源：评论

学校读者我要写书评

暂无评论

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 {1. of cryptologic technology and information security, Ministry of Education, Shandong University, Jinan 2501.0, China 2 School of Mathematics, Shandong University, Jinan 2501.0, China 3 Institute for Advanced Study, Tsinghua University, Beijing 1.0084, 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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：