计算机与现代化

• 信息安全 • 上一篇    下一篇

基于MPI的并行密码恢复框架

  

  1. (湖南省妇幼保健院信息中心,湖南 长沙 410011)
  • 收稿日期:2014-04-08 出版日期:2014-07-16 发布日期:2014-07-17
  • 作者简介:蒋璐瑾(1985-),女,湖南长沙人,湖南省妇幼保健院信息中心工程师,硕士,研究方向:并行计算及信息安全技术。

Parallel Password Recovery Framework Using MPI

  1. (Computer Department of Hunan Maternity and Child Health Care Hospital, Changsha 410011, China)
  • Received:2014-04-08 Online:2014-07-16 Published:2014-07-17

摘要: 现代信息系统中,使用密码保存加密数据是维护数据保密性的基本方法。当需要解密未知密钥的加密数据时,通常需要几百万甚至几百万亿次的解密操作。这些解密操作虽然计算复杂度较高,但是不同的解密操作相互独立而易于并行。所以,使用高性能计算机(HPC)可以减少数据解密的时间。本文设计一个基于MPI的并行密码恢复框架(P2RF),该框架把需要解密的数据和候选密钥在任务级分布到不同的计算节点上,计算节点再根据节点计算资源配置的不同把计算分布到计算资源上。实验结果表明:P2RF的扩展性随着节点的增多而线性扩展。

关键词: P2RF, 解密, MPI, 并行解密

Abstract: Using passwords to protect data is the most widely deployed method for securities. When people need to recover encrypted data for easily guessable passwords, it can require millions of Hash function and string comparison operations. These operations can be computationally expensive but are easily parallelizable because each password can be tested independently. Therefore, using high performance computing (HPC) can greatly reduce the time required to perform password recovery. This paper designs P2RF: A parallel password recovery framework using MPI. P2RF can distribute decryption task into different computing nodes. Then, the computing node distributes tasks into different PEs. The experimental results show that: P2RF is linearly scalable.

Key words: P2RF, decryption, MPI, parallel decryption

中图分类号: