### DSA数字签名的安全性分析

0

DSA数字签名的安全性分析
6 DSA 565 h x=(r(sh-H())imod (3 2.2穷搜索攻击 DS DS 160 b it P L P DSA 2.3生日攻击 Hash DSA y=g mod p g modp (rg moc P yg(m od p), j( m od DSA L=512+64 56+3 DSA 24伪造攻击 DSA M DSA 方法1 了 k=( d &r/m od p)m od q (4 s=(k(H()+(log y)mod p))mod g (5 方法2 R≡"()RmsA( m od p r=R mod g (6 方法3 k r=(g modp )m od q (7 s=(h(H()+(logy)mod p))mod q (8 3弱点攻击及解决方案 DSA P Hash 3.1随机数攻击 DSA k DSA r=(g mod p)mod q h 01994012ChinaAcademicJOurnalElectronicPublishingHouse.Allrightsreservedhttp://www.cnki.net 566 27 h k=((s-81)(H(M2)-HM1))modq (9 h DSA Blm-B lum-Shub RSA am er 13 3.2共r攻击 DSA (m odp) g=(h modp)'= l(modp),DSA GAmal ELgamal ELgamal DSA h1 m oo q ( modp (m od q ELgamal 3.3公共模数的安全性 开始 DSA 生成160bt的随机数s,g为s的位长,即g=160 p q l=H(s)⊕H(s+1)mod2 N IST DSS DSA 将u的最高位和最低位置1形成q g是素数吗? DSA p q DSA c=0,d=2 L-1=160+b0<b<160DSA k=k+1 H() =B(4++)md2习 M ilbr rab n k= n W=V+2V+…+2Vn-1+20(V,mod2”) ,,> C X=W+2 DSA p=X-((X mod 2q)-1) > DSA DSA P是素数吗? DSA 保存p,qS和c DSA C=c+1,d=d+n+1 结束 4096? DSA 图1DSA素数产生算法 Fig. 1 A lgo rithm generating dSa pr im es 3.4Hash的安全性 H ash DSA DSA SHA 160 bit Hash SHA-1 SHA-1 H ash N ISI SHA-1 o1994-2012ChinaAcademicJournalElectronicPublishingHouse.Allrightsreservedhttp://www.cnki.net 6 DSA 567 H ash HA-2241A-256SHA-384HA-512, 224 bit 256 b it 3 84 b it 512 bit 4结语 DSA 3)DSA h ask 厂 ④Hash SHA DSA DSA DSA [ 1R NEST R L SHAM IR A. ADLEM AN L A M ethod br btan ing D ig ital Signatures and Public-Key C ryptosys tem JI Camm ACM,197821(1):120126 2] FIPS186-1994 Federal In fom at in Processing Stan dard D gital S gnature Standard [SI 3]YEN SUNG-M NG, LA H CH FSUNG. Improved d igital S ignature A go rithm [J]. EEE T ransact ins on C am pu ters 1995 44(5):729730 [4] DSA J 200632(19):15 SH IW eim i NU ix in YANG Yixian et al Ex tend SelfCertificaton S igna ture Schem e based on dsa[ J]. Cam puter Engineering 2006 32(19): 1-5 [] 200830 (2):96-100 X IO II ong-guang WANG Jian, TAN Zuowen et al A New B lnd Proxy M u lt-Signa ture Schenes[ J]. Natural Science Journal of X iangtan U n ivers ity 2008 30(2): 96-100 6JHARN LE N, MEHTA M ANISH, HS N W EN-JUNG. Integ rating D iffe-Helhm an K ey exchange into thed g ita l s ignature a lge- rithm (DSA)[J. EEE Camm un ica tions Lette rs 2004,8(3: 198-20Q [7]POPE N ICK, CRUELLAS UAN CARLOS Oasis d g ital S igna ture Serv ices d gita l S igning w ithout the H earaches [ J EEE Intemet C am puting 2006 10(5):81-84 8N KODEM M. DSA S ignature Schem e mm une to he F au It Cryptanalysis [ C] l INCS 5189. Ber lirt Springer 200861- [M] 2006 DENG Arwen C rypto bgy The Cakulatng M ethods of Encryption [M]. Beijng Chaw atempo er Press 2006 [ 1OJELGAMAL T. A Public Key c ryptosys ten and Signature Schem e based on d isc rete Log arithms[ J]. IEEE T ransactions on Infom a tion Thoory 1985, T-31(4):469472 LIIFIPS180-1-1995 Federal In fom a tion P rocess ing Stand, Secure H ash Standard [s] [12] RSA GHR 200222(5):8285 SH IJ-, R escarch on Security of Tw n S gnature and Chr Based on RSA [J. Joumal of Soochow U n ie rsity Eng sneeringscienceEditon200222(5:naelectronicPublishingHouse.alLrightsreservedhttp://www.cnki.net 2-8 hina Academic 568 27 [13] [D] 2004 HUANG Feng Research on R andom Num ber g enerator and Des ign and Realization of B iam edical n age a nalysis System [D]. Guangzhou FirstM ilitary M edical U nivers ity 2004. [14 ANG Xiac-yun YN L IA Y QUN, YU Hong-bo Fidng Collisions n the Full SA-l[C] LNCS 3621. Berli Springer 2006 17-36 [15 N a tional Institu te of Stan dards and Tech no logy. Camm en ts Pos ted a bout SHA-1 A ttacks EB /oL]. (2005-02-22)[ 2009- 03-30].http://csrcnistgov/_newsevents/news_archve_/newsarchie_2005.hmI 基于随机多址协议的系统吞吐量分析 佘明辉,赵东风2 3512542 650091 围绕着对Abha系统的相关内容进行了系统介绍,并对随机多址系统的分析方法进行了较全面的 论述特别是详细阐述了时隙Abha系统和连续时间Alha系统以及非坚持CsMA( C arrier sense mult reaccess)控制协议的分析,分别得到了3种系统的平均成功队长和系统吞吐量的数学表达式,并通 过仿真实验验证了理论分析的正确性 o1994-2012ChinaAcademicJournalElectronicPublishingHouse.Allrightsreservedhttp://www.cnki.net

...展开详情

最新推荐
DSA数字签名的安全性分析 41积分/C币 立即下载
1/6

试读结束， 可继续阅读

41积分/C币 立即下载 ＞