|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | A new block cipher based on chaotic tent maps显示文摘 | Xun Yi Chik How Tan Chee Kheong Siew | 2002 | IEEE Trans Circuits and Systems Ⅰ2002，49，1： | 1 |
| 2 | A New Block Cipher Based on Chaotic Tent Maps, Circuits and Systems I: Fundamental Theory and Applications显示文摘 | XUN YI CHIK HOW TAN CHEE KHEONG SIEW | 2002 | IEEE Transactions on2002，49，12： | 1 |
| 3 | On a class of quadratic polynomials with no zeros and its application to APN functions显示文摘 | Carl Bracken Chik How Tan Yin Tan | 2014 | Finite Fields and Their Applications2014，25，： | 1 |
| 4 | Analysis of improved signcryption scheme with key privacy 显示文摘 | Chik How Tan | 2006 | Information Processing Letters2006，99，4： | 1 |
| 5 | Secure public-key encryption scheme with- out random oracles显示文摘 | Chik How Tan | 2008 | Information Sciences2008，178，17： | 1 |
| 6 | A Secure and Efficient Conference Scheme for Mobile Communications显示文摘 | Yi Xun Siew Chee Kheong Tan Chik How | 2006 | IEEE transactions on vehicular technology2006，52，54： | 1 |
| 7 | Fast eneryption for multimedia 显示文摘 | Xun Yi Chik How Tan Chee Kheong Slew Rahman Syed | 2001 | Consumer Electronics2001，，47： | 1 |
| 8 | Fast encryption for multimedia显示文摘 | Xun Yi Chik How Tan Chee Kheong Slew Rahman Syed | 2001 | Consumer Electronics2001，，47： | 1 |
| 9 | Analysis of improved signcryption scheme with key privacy显示文摘 | Chik How Tan | 2006 | Information Processing Letters2006，99，4： | 1 |
| 10 | Practical Cryptanalysis of a Public Key Cryptosystem Based on the Morphism of Polynomials Problem显示文摘Multivariate Public Key Cryptography(MPKC) has intensively and rapidly developed during the past three decades. MPKC is a promising candidate for post-quantum cryptography. However, designing it is universally regarded as a difficult task to design a secure MPKC foundation scheme, such as an encryption scheme and key exchange scheme. In this work, we investigate the security of a new public key cryptosystem that is based on the Morphism of Polynomials(MP). The public key cryptosystem proposed by Wang et al.(Wuhan University, China)comprises a key exchange scheme and encryption scheme. Its security can be provably reduced to the hardness of solving a new difficult problem, namely, the Decisional Multivariate Diffie Hellman(DMDH) problem. This problem is a variant of the MP problem, which is difficult to solve by random systems. We present a proposition that reduces the DMDH problem to an easy example of the MP problem. Then, we propose an efficient algorithm for the Key Recover Attack(KRA) on the schemes of the public key cryptosystem. In practice, we are able to entirely break the cryptosystem's claimed parameter of 96 security levels in less than 17.252 s. Furthermore, we show that finding parameters that yield a secure and practical scheme is impossible. | Jaihui Chen Chik How Tan Xiaoyu Li | 2018 | Tsinghua Science and Technology2018，23，6： | 0 |
| 11 | 一类PS_(ap)向量bent函数的存在性显示文摘Bent函数是非常特殊的组合对象,在序列、差集、编码和密码等领域都有重要应用.近年来,形如Trnk(P(x))的bent函数吸引了大量目光,其中k=1或k=n/2且P(x)∈F2n[x].本文在前人研究的基础上进一步研究二项式函数F(x)=Tr_k^n(x^(2^k-1)+ax(r(2~k-1)))(k=n/2≥2)的向量bent性,其中r为奇数.对于r|2~k+1的情形,本文得到了F满足向量bent性的一个充要条件,从而,对所有n和a∈F_(2~n)~*都完全确定了F的向量bent性.而对于r2k+1的情形,Muratovi-Ribi等(2014)曾提出过不存在此类向量bent函数的猜想.通过引入Lucas公式,对r分别等于5、7、9及所有的n和a∈F_(2~n)~*,本文也完全得到了F的向量bent性.特别地,本文找到了一些反例,否定了Muratovi-Ribi等(2014)提出的猜想. | 彭杰 TAN Chik How 阚海斌 | 2017 | 中国科学:数学2017，47，9： | 0 |
您所在的机构暂未开通此部分的功能，请联系管理员