All issues
Volume E95.A, Issue 1
Displaying 51-53 of 53 articles from this issue
Regular Section
-
Bennian DOU, Chun-Hua CHEN, Hong ZHANGArticle type: LETTER
Subject area: Cryptography and Information Security
2012 Volume E95.A Issue 1 Pages 414-416
Published: January 01, 2012
Released on J-STAGE: January 01, 2012
JOURNAL RESTRICTED ACCESSAt Asiacrypt'2001, Courtois, Finiasz and Sendrier proposed the first coding-based signature scheme which is also known as the CFS signature. The CFS signature is seen as one of the candidates of quantum immune signatures. In this letter, we show that the CFS signature is susceptible to both strong-key substitution attacks and weak-key substitution attacks. We also discuss potential countermeasures.View full abstractDownload PDF (72K) -
Yusong DU, Fangguo ZHANGArticle type: LETTER
Subject area: Cryptography and Information Security
2012 Volume E95.A Issue 1 Pages 417-420
Published: January 01, 2012
Released on J-STAGE: January 01, 2012
JOURNAL RESTRICTED ACCESSBased on Tu-Deng's conjecture and the Tu-Deng function, in 2010, X. Tang et al. proposed a class of Boolean functions in even variables with optimal algebraic degree, very high nonlinearity and optimal algebraic immunity. In this corresponding, we consider the concatenation of Tang's function and another Boolean function, and study its cryptographic properties. With this idea, we propose a class of 1-resilient Boolean functions in odd variables with optimal algebraic degree, good nonlinearity and suboptimal algebraic immunity based on Tu-Deng's conjecture.View full abstractDownload PDF (86K) -
Jonghoon RYUArticle type: LETTER
Subject area: Coding Theory
2012 Volume E95.A Issue 1 Pages 421-424
Published: January 01, 2012
Released on J-STAGE: January 01, 2012
JOURNAL RESTRICTED ACCESSPermutation polynomial based interleavers over integer rings have recently received attention for their excellent channel coding performance, elegant algebraic properties and simplicity of implementation. In this letter, it is shown that permutation polynomial based interleavers of practical interest is decomposed into linear permutation polynomials. Based on this observation, it is shown that permutation polynomial based interleavers as well as their inverses can be efficiently implemented.View full abstractDownload PDF (126K)