| 注册
首页|期刊导航|计算机应用研究|分组密码 PRESENT算法基于MI LP的分析

分组密码 PRESENT算法基于MI LP的分析

王衡 张文英

计算机应用研究2017,Vol.34Issue(1):229-232,4.
计算机应用研究2017,Vol.34Issue(1):229-232,4.DOI:10.3969/j.issn.1001-3695.2017.01.052

分组密码 PRESENT算法基于MI LP的分析

Analysis of PRESENT block cipher based on MILP

王衡 1张文英1

作者信息

  • 1. 山东师范大学 信息科学与工程学院,济南250358
  • 折叠

摘要

Abstract

CHES2007 proposed a lightweight block cipher algorithm is PRESENT algorithm.The key is divided into two ver-sions,such as 80 bit and 128 bit,the attacker uses a variety of methods including the impossible differential analysis to its analysis.This paper used mixed integer linear programming (MILP),and frequently used this method in business and eco-nomics to solve optimization problems.This technique significantly reduced the workload of designers and cryptanalysts.This paper used this method to analyze the PRESENT algorithm,used the MILP method to get the optimal solution of the PRESENT algorithm which was the impossible differential characteristic.

关键词

PRESENT/不可能差分分析/分组密码/MILP/差分特征

Key words

PRESENT/impossible differential cryptanalysis/block cipher/MILP/differential characteristic

分类

信息技术与安全科学

引用本文复制引用

王衡,张文英..分组密码 PRESENT算法基于MI LP的分析[J].计算机应用研究,2017,34(1):229-232,4.

基金项目

国家自然科学基金资助项目 ()

计算机应用研究

OA北大核心CSCDCSTPCD

1001-3695

访问量0
|
下载量0
段落导航相关论文