期刊文献+

一种网格环境下的密码计算模型

A Grid Computing Model for Cryptology
下载PDF
导出
摘要 由于密码学和信息安全领域的许多问题最终都被转化为一个耗时的计算,其中许多计算需要利用多台异构的和地理分布的计算机协同,才能有效完成.密码算法的设计、分析和应用对于计算环境敏感,且依赖性较强,不同类型的算法和算法的不同实现模式对计算环境要求差异很大,而且到目前为止还不存在一种通用的分布式密码计算模型.为此,本文根据密码计算本身的需求,首先分别分析了密码算法设计、分析和应用的目标和特征,提出了相应的计算模式,给出了一种网格环境下的通用密码计算模型.进而讨论了密码计算任务分割策略,资源分配和负载平衡问题.最后给出了网格环境Globus Toolkit下的模型构架、实现与实验结果. Many problems in cryptology and information security fields are eventually converted to time-consuming computations which usually need to be completed over heterogeneotts and geographically distributed computers. The analysis, design and application of a cryptographic algorithm usually depend on its concrete computing settings; different algorithms and different implementations of an algorithm need different computing enviromments. In this paper, the targets and fea.tures of different cryptographic computations are firstly analyzed according to their computing requirements; the corresponding computing modes are put forward; and a general purpose cryptographic computing model on grid is given. The task dividing policy, resource allocation and load balance for the model are then discussed. The implementation and the performance evaluation for the model based on Globus Toolkit 4 are further presented.
出处 《电子学报》 EI CAS CSCD 北大核心 2006年第10期1787-1792,共6页 Acta Electronica Sinica
基金 国家973重点基础研究发展规划基金(No.2004CB318004) 国家自然科学基金(No.90204016) 国家863高技术研究发展计划基金(No.2003AA144030)
关键词 密码学 资源分配 任务分割 计算网格 cryptology resource allocation task dividing computational grid
  • 相关文献

参考文献18

  • 1van Oorschot P C,Wiener M J.Parallel collision search with application to hash functions and discrete logarithms[A].In Proc the 2nd ACM Conference on Computer and Communications Security[C].ACM Press,New York,1994.210-218. 被引量:1
  • 2Brandon Dixon,Arjen K.Lenstra.Factoring integers using SIMD sieves[A].In Proc EUROCRYPT'93[C].LNCS 0765.Heidelberg:Springer-Verlag,1994.28-39. 被引量:1
  • 3Dan Page.Parallel Solution of Sparse Linear Systems Defined Over GF(p)[R].Technical Report CSTR-05-003,University of Bristol,2004.11. 被引量:1
  • 4Lenstra A,Manasse M.Factoring by electronic mail[A].In Proc EUROCRYPT'89[C].LNCS 434.Heidelberg:SpringerVerlag,1990.355-371. 被引量:1
  • 5White S R.Covert distributed processing with computer viruses[A].In Proc CRYPTO'89[C].LNCS 435.Heidelberg:Springer-Verlag.1990.616-619. 被引量:1
  • 6Quisquater J J,Desmedt Y G.Chinese lotto as an exhaustive code-breaking machine[J].Computer.1991,24(11):14-22. 被引量:1
  • 7Selkirk A P L,Escott A E.Distributed computing attacks on cryptographic systems[J].BT Technology Journal.1999,17(2):69-73. 被引量:1
  • 8Asbrink O,Brynielsson J.Factoring Large Integers Using Parallel Quadratic Sieve[R].Sweden:Royal Institute of technology,2000. 被引量:1
  • 9Foster I,Kesselman C,Tuecke S.The anatomy of the grid:Enabling scalable virtual organization[J].International J Supercomputer Applications,2001,15(3):200-222. 被引量:1
  • 10Foster I,Globus toolkit version 4:Software for service-oriented systems[A].In Proc NPC'05[C].LNCS 3779,Heidelberg:Springer-Verlag,2005.2-13. 被引量:1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部