Construction and Counting of 1-Resilient Rotation Symmetric Boolean Functions on <i>pq</i> Variables

• DU Jiao

  State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications Department of Mathematics and Information Science, Xinxiang University

• WEN Qiaoyan

  State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications

• ZHANG Jie

  School of Science, Beijing University of Posts and Telecommunications

• PANG Shanqi

  College of Mathematics and Information Science, Henan Normal University

抄録

In this letter, a property of the characteristic matrix of the Rotation Symmetric Boolean Functions (RSBFs) is characterized, and a sufficient and necessary condition for RSBFs being 1st correlation-immune (1-CI for simplicity) is obtained. This property is applied to construct resilient RSBFs of order 1 (1-resilient for simplicity) on pq variables, where p and q are both prime consistently in this letter. The results show that construction and counting of 1-resilient RSBFs on pq variables are equivalent to solving an equation system and counting the solutions. At last, the counting of all 1-resilient RSBFs on pq variables is also proposed.

収録刊行物

• IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

  IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E96.A (7), 1653-1656, 2013

  一般社団法人 電子情報通信学会

キーワード

• cryptology
• rotation symmetric
• characteristic matrix
• correlation immune
• resilient function

詳細情報

• CRID: 1390282681287245184
• NII論文ID: 130003370696
• DOI: 10.1587/transfun.e96.a.1653
• ISSN: 17451337
• ISSN: 09168508
• Web Site: https://www.jstage.jst.go.jp/article/transfun/E96.A/7/E96.A_1653/_pdf
• 本文言語コード: en
• データソース種別:
  • JaLC
  • Crossref
  • CiNii Articles
• 抄録ライセンスフラグ: 使用不可