一级黄色片免费播放|中国黄色视频播放片|日本三级a|可以直接考播黄片影视免费一级毛片

高級(jí)搜索

留言板

尊敬的讀者、作者、審稿人, 關(guān)于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁添加留言。我們將盡快給您答復(fù)。謝謝您的支持!

姓名
郵箱
手機(jī)號(hào)碼
標(biāo)題
留言內(nèi)容
驗(yàn)證碼

基于XTR體制的盲簽名方案

陳曉峰,  高虎明,  王育民

陳曉峰, 高虎明, 王育民. 基于XTR體制的盲簽名方案[J]. 電子與信息學(xué)報(bào), 2003, 25(6): 851-854.
引用本文: 陳曉峰, 高虎明, 王育民. 基于XTR體制的盲簽名方案[J]. 電子與信息學(xué)報(bào), 2003, 25(6): 851-854.
Chen Xiaofeng, Gao Huming, Wang Yumin. Blind Signature schemes based on XTR system[J]. Journal of Electronics & Information Technology, 2003, 25(6): 851-854.
Citation: Chen Xiaofeng, Gao Huming, Wang Yumin. Blind Signature schemes based on XTR system[J]. Journal of Electronics & Information Technology, 2003, 25(6): 851-854.

基于XTR體制的盲簽名方案

Blind Signature schemes based on XTR system

  • 摘要: XTR是一種新的基于有限域的乘法群的子群中元素跡的緊致表示的公鑰密碼體制。與RSA和ECC相比較,同等安全程度下 XTR密鑰長(zhǎng)度遠(yuǎn)遠(yuǎn)小于 RSA,最多只是 ECC密鑰長(zhǎng)度的 2倍,但XTR參數(shù)和密鑰選取的速度遠(yuǎn)遠(yuǎn)快于 ECC。利用基于離散對(duì)數(shù)問題的盲簽名方案以及有限域中元素跡的快速算法,該文給出了兩種基于 XTR體制的盲簽名方案,其安全性等價(jià)于解 XTR-DL困難問題,但是傳輸?shù)臄?shù)據(jù)量只有原來方案的 1/3。
    Abstract: XTR is a new public key system based on a method to represent elements of a subgroup of a multiplicative group of a finite field. Compared to RSA and ECC, XTR keys are much smaller than RSA keys of equivalent security, and at most twice as big as ECC keys, but parameter and key selection for XTR are much faster than ECC. Based on XTR system by using traditional blind signature schemes based on discrete logarithm problem and fast method for computing the trace of the elements in the finite field, two blind signature schemes are presented in this paper, the security of which is equivalence to solving XTR-DL problem while the datum is only as 1/3 as that of the previous schemes.
    • HTML全文
  • A.K. Lenstra, E. R. Verheul, The XTR public key system, Crypto2000, California, USA, LNCS 1880, Springer-Verlag 2000, 1-19.[2]A.E. Brouwer.[J].R. Pellikaan, E. R. Verheul, Doing more with fewer bits, Asiacrypt99, Singapore,LNCS 1716, Springer-Verlag.1999,:-[3]D. Chaum.[J].Blind signature for untraceable payments, Eurocrypt82, Burg Feuerstein, Germany, Plenum Press.1983,:-[4]M. Stadler.[J].J. M. Piveteau, Jan. Camenisch, Fair blind signatures, Eurocrypt95, St. Malo, France, LNCS 921, Springer-Verlag.1995,:-[5]J.L.C amenisch.[J].J. M. Piveteau, M. A. Stadler, Blind signature based on discrete logarithm problem, Eurocrypt94, Perugia, Italy, LNCS 950, Springer-Verlag.1994,:-[6]D. Pointcheval.[J].J. Stern, Provably secure blind signature schemes, Asiacrypt96, Kyongju, Korea,LNCS 1163, Springer-Verlag.1996,:-[7]A.K. Lenstra.[J].E. R. Verheul, Key improvements to XTR, Asiacrypt2000, Kyoto, Japan, LNCS1880, Springer-Verlag.2000,:-A. Menezes, Comparing the security of ECC and RSA, manuscript, 2000, available from www.carc.math.uwaterloo.ca/aj meneze/misc/cryptopramar tical.html.[8]E.R. Verheul.[J].Evidence that XTR is more secure than supersingular elliptic curve cryptosystems, Eurocrypt2001, Innsbruck, Austria, LNCS 2045, Springer-Verlag.2001,:-A. K Lenstra.[J].E.R. Verheul, Fast irreducibility and subgroup membership testing in XTR,PKC2001, Cheju Island, Korea, LNCS 1992, Springer-Verlag.2001,:-[9]A. Menezes, S. A. Vanstoe, ECSTR(XTR): Elliptic curve singular trace representation, RumpSession of Crypto2000.[10]M. Stam, A. K. Lenstra, Speeding up XTR, available from www.ecstr.com/.
  • 加載中
計(jì)量
  • 文章訪問數(shù):  2102
  • HTML全文瀏覽量:  87
  • PDF下載量:  722
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  2002-01-28
  • 修回日期:  2002-07-03
  • 刊出日期:  2003-06-19

目錄

    /

    返回文章
    返回