﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>BlogJava-心有多大舞台便有多大-文章分类-其它技术文章</title><link>http://www.blogjava.net/jjwwhmm/category/30945.html</link><description>Embrace changes, pursue excellence, share niceness.
</description><language>zh-cn</language><lastBuildDate>Mon, 21 Apr 2008 06:45:38 GMT</lastBuildDate><pubDate>Mon, 21 Apr 2008 06:45:38 GMT</pubDate><ttl>60</ttl><item><title>Diffie-Hellman密钥交换算法</title><link>http://www.blogjava.net/jjwwhmm/articles/194475.html</link><dc:creator>pony</dc:creator><author>pony</author><pubDate>Mon, 21 Apr 2008 03:47:00 GMT</pubDate><guid>http://www.blogjava.net/jjwwhmm/articles/194475.html</guid><wfw:comment>http://www.blogjava.net/jjwwhmm/comments/194475.html</wfw:comment><comments>http://www.blogjava.net/jjwwhmm/articles/194475.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.blogjava.net/jjwwhmm/comments/commentRss/194475.html</wfw:commentRss><trackback:ping>http://www.blogjava.net/jjwwhmm/services/trackbacks/194475.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: (转载)Diffie-Hellman密钥交换算法基础知识:什么是素数的原根?原根Primitive Root&#160;	g^i mod p &#8800; g^j mod p&#160;		其中i&#8800;j且i, j介於1至(p-1)之间&#160;	则g为p的原根。&#160;	mod读&#8220;模&#8221;， mod n的意思是除以n的余数。&#...&nbsp;&nbsp;<a href='http://www.blogjava.net/jjwwhmm/articles/194475.html'>阅读全文</a><img src ="http://www.blogjava.net/jjwwhmm/aggbug/194475.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.blogjava.net/jjwwhmm/" target="_blank">pony</a> 2008-04-21 11:47 <a href="http://www.blogjava.net/jjwwhmm/articles/194475.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>