整数的最佳带符号二进制表示的随机生成算法

计算机科学 ›› 2014, Vol. 41 ›› Issue (Z11): 282-283.

整数的最佳带符号二进制表示的随机生成算法

李忠,张永华

宜宾学院计算机科学与技术研究所宜宾644000;宜宾学院计算机与信息工程学院宜宾 644000;宜宾学院计算机科学与技术研究所宜宾644000

出版日期:2018-11-14 发布日期:2018-11-14
基金资助:
本文受四川省教育厅重点科研项目(13ZA0196),宜宾学院博士科研启动金项目(2012B16)资助

Random Generation Algorithm of Optimal Binary Signed Digit Representation of Integer

LI Zhong and ZHANG Yong-hua

Online:2018-11-14 Published:2018-11-14

摘要/Abstract

摘要： 整数的带符号数字(BSD)表示广泛应用于计算机算术、密码学、数字信号处理等领域。给定整数有多种最佳带符号二进制表示。对整数的最佳带符号二进制表示的性质进行研究,给出了整数的最佳带符号二进制表示随机生成算法,所得算法能快速产生给定整数的随机最佳带符号二进制表示。

关键词: 整数,带符号二进制表示,最佳带符号二进制表示,随机生成算法

Abstract: Binary Signed Digit(BSD) representation of an integer is widely used in computer arithmetic,cryptogr-aphy and digital signal processing.A given integer can have several optimal BSD representations.This paper studied the pro-perties of the optimal BSD representation of an integer,and presented an generation algorithm,which can rapidly generate a random optimal BSD representation of a given integer.

Key words: Integer,Binary signed digit representation,Optimal binary signed digit representation,Random generation algorithm

李忠,张永华. 整数的最佳带符号二进制表示的随机生成算法[J]. 计算机科学, 2014, 41(Z11): 282-283. https://doi.org/

LI Zhong and ZHANG Yong-hua. Random Generation Algorithm of Optimal Binary Signed Digit Representation of Integer[J]. Computer Science, 2014, 41(Z11): 282-283. https://doi.org/

参考文献

[1] Ebeid N,Hasan M A.On binary signed digit repress-entations of integers[C]∥Design Code Cryptogr.2007,42:43-65
[2] 李忠,彭代渊.整数的带符号二进制表示数的快速计算[J].计算机应用,2012,2(11):3121-3124
[3] Wu T,Zhang M,Du H,et al.On optimal binary signed digit representations of integers[J].Applied Mathematics,2010,5(3):331-340
[4] Ganesan P,Manku G S.Optimal routing in Chord[C]∥Proc.15th ACM-SIAM Symposium on Discrete Algorithms(SODA 2004).2004:169-178
[5] Sawada J.A Gray code for binary subtraction[C]∥2nd Brazilian Symposium on Graphs,Algorithms and Combinatorics(GRACO 2005).2005
[6] Manku G S,Sawada J.A Loopless Gray Code for MinimalSigned-Binary Representations[C]∥Brodal G S,Leonardi S,eds.ESA 2005.LNCS 3669,2005:438-447
[7] Hankerson D,Menezes A,Vanstone S.Guide to elliptic curve cryptography[M].Springer-Verlag Professional Computing Series,2004
[8] Avanzi R M.A note on the signed sliding window integer recoding and a left-to-right analogue[C]∥Handschuh H,Hasan A,eds.SAC 2004.LNCS 3357,2004:130-143
[9] Joye M,Yen S M.Optimal left-to-right binary signed-digit recoding[J].IEEE Transactions on Computers,2000,9:740-748
[10] Okeya K,Schmidt-samoak C,Spahn,et al.Signed binary representations revisited[C]∥Andances in Cryptology-CRYPTO’04.LNCS 3152,2004:123-139

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed