2021-07-24

最新推荐文章于 2021-10-24 15:56:53 发布

无名函数

最新推荐文章于 2021-10-24 15:56:53 发布

阅读量291

点赞数

分类专栏：密码小白刷题记录

本文链接：https://blog.csdn.net/m0_57291352/article/details/119065444

版权

密码小白刷题记录专栏收录该内容

71 篇文章 8 订阅

订阅专栏

[AFCTF2018]One Secret, Two encryption

一份秘密发送给两个人不太好吧，那我各自加密一次好啦~~~
素数生成好慢呀
偷个懒也……不会有问题的吧？
public1.pub

public2.pub

flag_encry1

螲繓r??28爔#_f鑑V枫戟>?靆鰵?崃mk?k稽jRL@f_離峹??$?"鰌'曣誨?磈j鵾挬"^>a4?缆鰿t?檣駼'?铯鮗籊邆w咗?玈獥鉹谸?饏s｝?U4z?澴?F牶劰BS?,衃F=nP?
譅Q%(?y価?簃覮=€w]mWg嗧糢?]b?S菾?跹瑂a.鞸寖娿饟~'uN?D7
5斨C?Au>羋T??y(DM

flag_encry2

?繨楺o偈?n(汏E*A聦t??`N`搯痲>0gh茅翭V筇旎畨 ?雧翍Om袥bZ?4鶒懍x趽巂\紧Z€_┅颌J魓?汕苤t4q??aR幚鯞腻s'仩愓楫?	sZ酨A咓蝘玧?留S?瓘顂eJv$洶[yD噓蟟K棠嶅э毽 頶??e姲H屁3倔擿In6?弈Z跟誺F蠎 @偖??~v圣V??@`3扲瑭ir^?嘭l舑-繇?

解题
公钥解析，
第一个公钥解出来为：

e1 = 1666626632960368239001159408047765991270250042206244157447171188195657302933019501932101777999510001235736338843107709871785906749393004257614129802061081155861433722380145001537181142613515290138835765236002811689986472280762408157176437503021753061588746520433720734608953639111558556930490721517579994493088551013050835690019772600744317398218183883402192060480979979456469937863257781362521184578142129444122428832106721725409309113975986436241662107879085361014650716439042856013203440242834878648506244428367706708431121109714505981728529818874621868624754285069693368779495316600601299037277003994790396589299
n1 = 4850297138162223468826481623082440249579136876798312652735204698689613969008632545220976699170308454082390834742570718247804202060929493571642074679428565168405877110681518105667301785653517697684490982375078989886040451115082120928982588380914609273008153977907950532498605486225883973643141516024058315360572988744607134110254489421516026937249163493982681336628726033489124705657217768229058487155865265080427488028921879608338898933540825564889012166181346177276639828346376362168934208822467295673761876965864573164529336885250577357767314256581019474130651412100897839606491189424373959244023695669653213498329

第二个公钥解析出来为：

e2 = 65537
n2 = 2367536768672000959668181171787295271898789288397672997134843418932405959946739637368044420319861797856771490573443003520137149324080217971836780570522258661419034481514883068092752166752967879497095564732505614751532330408675056285275354250157955321457579006360393218327164804951384290041956551855334492796719901818165788902547584563455747941517296875697241841177219635024461395596117584194226134777078874543699117761893699634303571421106917894215078938885999963580586824497040073241055890328794310025879014294051230590716562942538031883965317397728271589759718376073414632026801806560862906691989093298478752580277

根据提示，应该是使用了相同的素数
所以

p = gcd(n1,n2)

然后进行解密

from gmpy2 import *
from Crypto.Util.number import *

c1 = open('flag_encry1.txt','rb').read()
c1 = bytes_to_long(c1)
#print(c1)
p = gcd(n1,n2)

q1 = n1//p
phi1 = (q1-1) * (p-1)
d1 = invert(e1,phi1)
m1 = powmod(c1,d1,n1)
print(long_to_bytes(m1))

运行得到：

b'\x02\xd5\xd4\x02\xe3\x01w\x86E\x19#\xc5\x0e\x9d\xf5\xff\xf3\xac\xbd^[M\xe2\xcd[\x08\xa8\x11x\x8b\xaax\xc3\x958\x86\xe4\x05\x87B\x07F^\xf6\xf3[w\x81\x9fr\x80\x13\xab\xf9\xb6\xf7"\xff\x9bL\xea\xb9\x10|AI\xc2m\x01\xf4\x8d-\xcd\xd6PDf\xea+Ub\x96\x18\xbd\xe8\xff\x9e\xe9N\x05\x85\xc8:o\x06\xb9\xd7\xb9\xabT\xc1\xf8\t\xe4\xca0\xd84x\xc3\xb2)~}\xaa\x0f\r\xa5\x8a\xe5\xa1\xc6\x8f\rze\xb6\x8b\xa7\x0c\xca\xf9\xe3\xa6\x07\xa3\xaa\xcb\x14\xca\x15\xd3\x07\xc0T\x18\x87z-1\xa5\x9a\x92\xfe\xe3\xdb\x94\xf5d\xb3\x06\xae\x16\x98mqE4\x96\xf8Z\xd8\xef\xdb\xd6(\xb2Ws\xe7u\x95\xd5I\xddn\xdf\xb0\xe9\xa0\xef\xe8\x0c\x97B\xc7\xe1\x82\xeb\x00OpenSSL is widely used\r\nflag is afctf{You_Know_0p3u55I}'

答案
flag{You_Know_0p3u55I}

[AFCTF2018]MagicNum

题目

关于大小端
（https://blog.csdn.net/lis_12/article/details/52698634)
大端：较低的有效字节存放在较高的存储器地址中，较高的有效字节存放在较低的存储器地址
小端：
较高的有效字节存放在较高的存储器地址中，较低的有效字节存放在较低的存储器地址

72065910510177138000000000000000.000000
71863209670811371000000.000000
18489682625412760000000000000000.000000
72723257588050687000000.000000
4674659167469766200000000.000000
19061698837499292000000000000000000000.000000

解题

from libnum import*
import struct

s = [72065910510177138000000000000000.000000,71863209670811371000000.000000,18489682625412760000000000000000.000000,72723257588050687000000.000000,4674659167469766200000000.000000,19061698837499292000000000000000000000.000000]
a = ''
b = ''
for i in s:
    i = float(i)
    a += struct.pack('<f',i).hex()        #小端
print(a)

for j in s:
    i = float(i)
    b += struct.pack('>f',i).hex()        #大端
print(b)
a = 0x61666374667b7365635f69735f657665727977686572657d
b = 0x7d6572657d6572657d6572657d6572657d6572657d657265
print(n2s(a))
print(n2s(b))

答案
flag{sec_is_everywhere}
加密代码：

#include <stdio.h>
char flag[]="afctf{sec_is_everywhere}";

int main()
{
	for(int i=0;i<6;++i){
		printf("%20f\n",*(float*)(flag+i*4));
	}
	return 0;
}