首页 | 本学科首页   官方微博 | 高级检索  
     检索      

Vectorial Resilient PC(l) of Order k Boolean Functions from AG-Codes
作者姓名:Hao CHEN  Liang MA  Jianhua LI
作者单位:Hao CHEN(Software Engineering Institute, East China Normal University, Shanghai 200062, China);Liang MA(Institute of Systems Science, University of Shanghai for Science and Technology, Shanghai 200093, China);Jianhua LI(Department of Electronic Engineering, Shanghai,Jiaotong University, Shanghai 200030, China)
基金项目:Project supported by the National Natural Science Foundation of China (No.10871068); the joint grant of the Danish National Research Foundation and the National Natural Science Foundation of China and the Shanghai Leading Academic Discipline Project (No.S30504)
摘    要:Propagation criteria and resiliency of vectorial Boolean functions are important for cryptographic purpose (see 1–4, 7, 8, 10, 11, 16]). Kurosawa, Stoh 8] and Carlet 1] gave a construction of Boolean functions satisfying PC(l) of order k from binary linear or nonlinear codes. In this paper, the algebraic-geometric codes over GF(2m) are used to modify the Carlet and Kurosawa-Satoh’s construction for giving vectorial resilient Boolean functions satisfying PC(l) of order k criterion. This new construction is compared with previously known results.

关 键 词:布尔函数  弹性  k阶  矢量  AG  电脑  传输标准  非线性码

Vectorial Resilient PC(l) of Order k Boolean Functions from AG-Codes
Hao CHEN,Liang MA,Jianhua LI.Vectorial Resilient PC(l) of Order k Boolean Functions from AG-Codes[J].Chinese Annals of Mathematics,Series B,2011,32(1):99-104.
Authors:Hao CHEN  Liang MA and Jianhua LI
Institution:1. Software Engineering Institute, East China Normal University, Shanghai 200062, China
2. Institute of Systems Science, University of Shanghai for Science and Technology, Shanghai 200093, China
3. Department of Electronic Engineering, Shanghai,Jiaotong University, Shanghai 200030, China
Abstract:Propagation criteria and resiliency of vectorial Boolean functions are important for cryptographic purpose (see 1–4, 7, 8, 1, 11, 16]). Kurosawa, Stoh 8] and Carlet 1] gave a construction of Boolean functions satisfying PC(l) of order k from binary linear or nonlinear codes. In this paper, the algebraic-geometric codes over GF(2 m ) are used to modify the Carlet and Kurosawa-Satoh’s construction for giving vectorial resilient Boolean functions satisfying PC(l) of order k criterion. This new construction is compared with previously known results.
Keywords:Cryptography  Boolean function  Algebraic-geometric code  
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录!
点击此处可从《数学年刊B辑(英文版)》浏览原始摘要信息
点击此处可从《数学年刊B辑(英文版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号