首页> 外文期刊>Journal of Discrete Mathematical Sciences and Cryptography >Dictionary based codes involving power product expansions
【24h】

Dictionary based codes involving power product expansions

机译:涉及电力产品扩展的基于词典的代码

获取原文
获取原文并翻译 | 示例
           

摘要

This paper introduces the Integer Power Product Cryptosystem, a prototype for a dictionary based crpytosytem which could be of interest to elite organizations. Let be a set of positive integers. The Integer Power Product Cryptosystem exploits the one to one correspondence between an integer power product expansion, and its associated power series representation, by taking the series representation, converting it into product format, and transmitting a set of N coefficients, namely. The crux of our decryption amounts to solving a finite number of Diophantine equations. It is accomplished through either a Basic Substitution Algorithm or a computer assisted guess and check algorithm and transforms. Algebraic and complexity properties of these two algorithms are analyzed. Preliminary security issues are discussed. Numerous detailed examples are provided.
机译:本文介绍了整数电源密码系统,基于词典的克罗维斯化的原型可能对精英组织感兴趣。 让一组正整数。 整数功率加密系统通过采用系列表示,将其转换为产品格式,并传输一组N系数,将整数功率扩展和其相关的电源系列表示之间的一对应的对应关系利用了整数功率扩展和其相关的电源系列表示之间的一对应的对应关系。 我们解密的关键是解决有限数量的衍生灵氨酸方程。 它是通过基本替代算法或计算机辅助猜测和检查算法和转换完成的。 分析了这两种算法的代数和复杂性特性。 讨论了初步安全问题。 提供了许多详细的例子。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号