|
[求助]帮忙看看这是什么算法?
Walsh变换的它是分析函数非线性度工具,应该有Walsh程序。。。。 |
|
[求助]帮忙看看这是什么算法?
翻了翻密码编码学书,好难啊 密码函数静态信息泄漏的缓慢性和均匀性(如相关免疫性、非线性性、均衡性等等)和动态信息泄漏的缓慢性和均匀性(如扩散性、高阶互相关性等等 感觉90------>100应该有距阵公式能给算出,关键是系数 http://d.wanfangdata.com.cn/Thesis.aspx?ID=Thesis_Y583850&transaction=%7b%22ExtraData%22%3a%5b%5d%2c%22Transaction%22%3a%7b%22DateTime%22%3a%22%5c%2fDate(1300699153700%2b0800)%5c%2f%22%2c%22Id%22%3a%220961360d-b86e-4430-a790-9ead011d6ec0%22%2c%22ProductDetail%22%3a%22Thesis_Y583850%22%2c%22SessionId%22%3a%22499b6427-d0f5-4c8f-9aa7-c08276b325e9%22%2c%22Signature%22%3a%22xItvQnpVIRG9FUKh7Tt5KG1bbwcIRfza%5c%2fTQlwUCVz7azTcR95XHwAsGpuSrNjv5Y%22%2c%22TransferIn%22%3a%7b%22AccountType%22%3a%22Income%22%2c%22Key%22%3a%22ThesisDigest%22%7d%2c%22TransferOut%22%3a%7b%22AccountType%22%3a%22GTimeLimit%22%2c%22Key%22%3a%22gjtsg%22%7d%2c%22Turnover%22%3a1.00000%2c%22User%22%3anull%7d%2c%22TransferOutAccountsStatus%22%3a%5b%5d%7d |
|
|
|
[讨论]关于1024位RSA的破解
几月前我在别处问过的 |
|
[讨论]关于1024位RSA的破解
证书里的RSA1024数都不同,这些1024bit数有多少个? 难道都不容易分解吗? 顶端 Posted: 2010-06-17 19:17 | [楼 主] 哪位帮算下:10^309/(in10^309)-10^308/(in10^308)=10^308*in10(10/309-1/308)=10^308*in10*(0.032362459546925566343042071197411-0.0032467532467532467532467532467532)=10^308*0.06704139129876960230334399110038=? 100000000000000000000000000000000000000000000000000000000000000000000000000000\ 000000000000000000000000000000000000000000000000000000000000000000000000000000\ 000000000000000000000000000000000000000000000000000000000000000000000000000000\ 000000000000000000000000000000000000000000000000000000000000000000000000000000\ 000000000000000000000000000000000000000000000000000000000000000000000000000000\ 000000000000000000000000000000000000000000000000000000000000000000000000000000\ 000000000000000000000000000000000000000000000000000000000000000000000000000000\ 000000000000000000000000000000000000000000000000000000000000000000000000000000\ 000000*0.06704139129876960230334399110038= (6.704139129876960230334399110038`30.82634301855642*10^307 顶端 Posted: 2010-06-18 20:29 | 2 楼 |
|
[求助]帮忙看看这是什么算法?
那个博士越译越难了。。。来篇简单点的 http://cdmd.cnki.com.cn/Article/CDMD-10613-2006091468.htm 试试:系数最好用0、1、-1。。。。看来楼主的不是NTRU,没用-1 N=5,M=x^5-1 f=x^4+11*x^3+x^2+7*x+23 g=11*x^4+13*x^3+x^2+17*x+2 M:=x^5-1; M; f:=x^4+11*x^3+x^2+7*x+23; f; g:=11*x^4+13*x^3+x^2+17*x+2; g; k:=f*g; k; k mod M x^5 - 1 x^4 + 11*x^3 + x^2 + 7*x + 23 11*x^4 + 13*x^3 + x^2 + 17*x + 2 11*x^8 + 134*x^7 + 155*x^6 + 118*x^5 + 534*x^4 + 345*x^3 + 144*x^2 + 405*x + 46 534*x^4 + 356*x^3 + 278*x^2 + 560*x + 164 |
|
[求助]帮忙看看这是什么算法?
感觉象对称密码一种里的S盒 不过多项式运算和NTRU有点关系,NTRU是公匙密码 http://bbs.sciencenet.cn/forum.php?mod=misc&action=attachcredit&aid=45226&formhash=9cc0d6cc |
|
[讨论]关于1024位RSA的破解
我也很菜。。。 RSA1024产生的算法有项要(N-1)/2也要有大素因子,还有些别的项更严格,就为防已知攻击,你这N强啊,素因子都有306 RSA1024是两155位左右素乘积,153---157位左右素数有天文个,有素数公式可估算,虽说越来越少,看看2到4位的就知道了,说解RSA1024最快得3年,也有说2018年的,现在攻RSA1024也没用分解它的,帐篷上金锁,别撬锁,我见过秏牛帐篷防雨但都透光 PrimesInInterval(10^2, 10^4); [ 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643, 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727, 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821, 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907, 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989, 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057, 4073, 4079, 4091, 。。。。。。。。。。。。 9439, 9461, 9463, 9467, 9473, 9479, 9491, 9497, 9511, 9521, 9533, 9539, 9547, 9551, 9587, 9601, 9613, 9619, 9623, 9629, 9631, 9643, 9649, 9661, 9677, 9679, 9689, 9697, 9719, 9721, 9733, 9739, 9743, 9749, 9767, 9769, 9781, 9787, 9791, 9803, 9811, 9817, 9829, 9833, 9839, 9851, 9857, 9859, 9871, 9883, 9887, 9901, 9907, 9923, 9929, 9931, 9941, 9949, 9967, 9973 ] |
|
[讨论]关于1024位RSA的破解
PollardRho分解程序都没反应,NFS/QS/ECM吧 PollardRho能算出素因子40以下的,再大看来这是真的RSA质数积,素因子153-156,很大。。。 N1:=(N-1)/2; time PollardRho(6135817276994228280921234492251989803971665251643387286275427290420608319493450\ 0337249494861464779526926371242841898461060708596061973503048747591840915196329\ 8627357536244380264618129149797307954428768010972481227997733354539212707332395\ 99770855133596274687458152509674661168407492427963270577499829974189911); [ <3, 1>, <11, 1> ] [ 18593385687861297820973437855309060012035349247404203897804325122486691877252\ 8788900756045034741756142201124978308783215335480594127192433481053308608833928\ 2723113204655286000801873118635749418043723539427189337054538585922846099113128\ 472720328943442311354165398560899232156618408861453432441742419090126967 ] Time: 0.030 Ilog(10, 18593385687861297820973437855309060012035349247404203897804325122486691877252\ 8788900756045034741756142201124978308783215335480594127192433481053308608833928\ 2723113204655286000801873118635749418043723539427189337054538585922846099113128\ 472720328943442311354165398560899232156618408861453432441742419090126967 ); [ <3, 1>, <11, 1> ] [ 18593385687861297820973437855309060012035349247404203897804325122486691877252\ 8788900756045034741756142201124978308783215335480594127192433481053308608833928\ 2723113204655286000801873118635749418043723539427189337054538585922846099113128\ 472720328943442311354165398560899232156618408861453432441742419090126967 ] 306 |
|
[求助]帮忙看看这是什么算法?
看系数都是1,类比下: 123456...........100 S1=1^2+2^2+....6^2+......100^2 S2=1(2+3+4............................100) S3=2( 3+4............................100) ........ S98=98( .. 99+100) S99=99( .... 100) b1=S1+S2..................+S99 若系数C∈(1,0),N∈(1,90) bN=CS1+CS2..................+CS99 格密码NTRU系数C∈(1,0),但数目有限制,不过你可找两个多项式试下 |
|
刚才在debugman上看到个很好的帖子 转载一下
中关村图书大厦里 UNIX/Linux 书5,6架, Windows 书就一架了,去年初还不是这样 数学书影印的SPRINGER书比中文书也差不多了,现在双语教学在好点的中学也快普级了 和老外接轨很快啊 想想西藏藏民学中文的技术书,和你我学英文的技术书,应该能理解作者了 |
|
[讨论]关于1024位RSA的破解
试了啊: N:= 122716345539884565618424689845039796079433305032867745725508545808412166389869000674498989722929559053852742485683796922121417192123947006097495183681830392659725471507248876052923625829959461590885753602194496245599546670907842541466479199541710267192549374916305019349322336814984855926541154999659948379823 少头一位: time PollardRho(22716345539884565618424689845039796079433305032867745725508545808412166389869000674498989722929559053852742485683796922121417192123947006097495183681830392659725471507248876052923625829959461590885753602194496245599546670907842541466479199541710267192549374916305019349322336814984855926541154999659948379823) ; [ <3, 1>, <11, 1>, <7400243, 1> ] [ 93020473418133601986365115410234731396896942327138511063834254387904298875087\ 3110129073596183979488972175909001734988977631287043196849571819145860309787479\ 1624050440067193720171664727340285083302589503498038795195970477491913376303371\ 5938466829245245011282435836062161915890300821186082923652886517 ] Time: 0.040 少尾一位: [ <2, 1>, <139, 1>, <353, 1>, <2039, 1>, <15061, 1>, <6358591, 1> ] [ 64039950419263281142667937980578696743630972204552186441340531871876629610146\ 2617525731936502701233860660400514662207063639059388629125320276929846635216611\ 3763346939520137816285212002297528742601692677227414841951513384782411829061966\ 97976490177638463722046204392444405713198314116143057 ] Time: 0.050 |
|
[讨论]关于1024位RSA的破解
Z := IntegerRing(); N:= 122716345539884565618424689845039796079433305032867745725508545808412166389869000674498989722929559053852742485683796922121417192123947006097495183681830392659725471507248876052923625829959461590885753602194496245599546670907842541466479199541710267192549374916305019349322336814984855926541154999659948379823 ; IsPrime(N); Ilog2(N); Ilog(10,N); false 1023 308 好像少一位。。。。。。。 |
|
|
|
关于DES算法的一些想法,希望大家讨论讨论
对称加密算法都有个P置换,和哈密尔顿图回路有关---------图论。。。难 感觉想着能把DES/AES等对称加密算法的那几个多元多参数方程组给解了才是正道,这些方程组可都是DES/AES加密过程确定的,就像当年那美国人把复杂的国民经济给线性方程组化了,DES/AES可没国民经济复杂 什麽差分,能量都是和自然界就没有真随机性有关----电脑就更不能产生真随机性了,但电脑速度总在变快,总有一天能给加密算法不随机了,3DES,10DES也能给不随机了 把方程组给解了,就是把加密算法给否了 |
|
[推荐]保密技术检查参考1/2/3》
3211123 |
|
[推荐]保密技术检查参考1/2/3》
234567 |
|
[推荐]保密技术检查参考1/2/3》
123456 |
操作理由
RANk
{{ user_info.golds == '' ? 0 : user_info.golds }}
雪币
{{ experience }}
课程经验
{{ score }}
学习收益
{{study_duration_fmt}}
学习时长
基本信息
荣誉称号:
{{ honorary_title }}
能力排名:
No.{{ rank_num }}
等 级:
LV{{ rank_lv-100 }}
活跃值:
在线值:
浏览人数:{{ visits }}
最近活跃:{{ last_active_time }}
注册时间:{{ user_info.create_date_jsonfmt }}
勋章
兑换勋章
证书
证书查询 >
能力值