浙江省信息通信行业职业技能竞赛CTF比赛Crypto部分ezrsa onetoone 古典密码

Geek极安云科

已于 2024-08-12 21:27:53 修改

阅读量363

点赞数 5

CC 4.0 BY-SA版权

分类专栏： CTF竞赛WP 文章标签：技能大赛职业院校网络安全信息安全管理与评估 CTF

于 2024-08-12 20:10:55 首次发布

本文链接：https://blog.csdn.net/qq_22406677/article/details/141140973

CTF竞赛WP 专栏收录该内容

9 篇文章

订阅专栏

浙江省信息通信行业职业技能竞赛CTF比赛Crypto部分

Author：Ns100kUp
From：极安云科-服务中心
Data：2024/08/07
Copyright:本内容版权归属极安云科，未经授权不得以任何形式复制、转载、摘编和使用。

培训、环境、资料、考证
公众号：Geek极安云科
网络安全群：624032112
网络系统管理群：223627079 
网络建设与运维群：870959784 

极安云科专注于技能提升，赋能
2024年广东省高校的技能提升，受赋能的客户院校均获奖！
2024年江苏省赛一二等奖前13名中，我们赋能客户占五支队伍！
2024年湖南省赛赋能三所院校均获奖！
2024年山东省赛赋能两所院校均获奖！
2024年湖北省赛赋能参赛院校九支队伍，共计斩获一等奖2项、三等奖7项!

1.ezrsa

ezrsa: dp,dq求p，q

exp:

from Crypto.Util.number import *
c = 12984135320111998873574284208610147602300905986217959419538725886311969631385604980849704698317538242799838245857289123091071349251591275978367188754240005974808961509492150202120151953693008634089934978536159008925600509028280369462106667855546503912051433697801514846972245497413065907784238494186125410856243734640516936177346571025698052830663060778574507557885018604184633299631706062619136509657977024503868262447002075619009176532816627273791451966490232673282178421973680772496780802099245335670508179008544993794890648142269641012990571695016243632752774627711418883649197477188116768487919588343174608495991
dp = 18598713082631939276398297903471224442860220045711450717767708864628167943510915427386526056198388742030768892248693798221502111231417458532065351033118225596376385178136639994687729547518864119963108205999615226694074683105883964770048464668481645706671573808282601903145630558136276999165909829520729419143
dq = 113766569421824041726846810274798228336927433449147236509947701685283444540885714658793637310584297609249374337472184581261522083483537079140340585494062393565248844238331816034147119755077887429821098094847516489669304992787729450983416332585592930393270400446728879429206388210603970266992207365767742919633
e = 65537
def get(x):
    for k in range(1,e)
 	   if(e*x-1)%k == 0:
		if isPrime((e*x-1)//k + 1):
            out =((e*x-1)//k+ 1)
            return out
p= get(dp)
9= get(dg)
n=p*9
phi =(p-1)*(q-1)d = inverse(e,phi)
print(long_to_bytes(pow(c,d,n)))
#b'flag{h311o_eazy_rsA_gOt_lt}'

2.onetoone

onetoone: 仿射密码

题目：

import random
import math
from flag import flag

assert flag[:5] == 'flag{'
b = random.randint(0,240)
while True:
    a = random.randint(0,240)
    if math.gcd(a,b) == 1:
        break

cipher = []
for i in flag:
    c = (ord(i)*a + b) % 240
    cipher.append(c)
print(cipher)

#[8, 230, 183, 165, 185, 17, 183, 230, 17, 100, 230, 73, 183, 129, 109, 64, 17, 183, 129, 17, 64, 221, 109, 17, 64, 129, 73, 17, 64, 19]

exp:

import gmpy2
s=[8,230,183,165,185,17,183,230,17,100,230,73,183,129,109,64,17,183,129,17,64221,109,17,64,129,73,17,64,19]
temp = 'flag{'for a in range(240):
	for b in range(240):
		if(a*ord(temp[0])+b)%240 == s[0]and (a*ord(temp[1])+b)%240 == s[1]and(a*ord(temp[2])+b)%240 ==s[2]and (a*ord(temp[3])+b)%240 ==s[3]and(a*ord(temp[4])+b)%240 == s[4]:
            print(a,b)
            break
a= 157
b=74
m=''
a_1= gmpy2.invert(a,240)
for i in s:
	m=m+chr(((i-b)*a 1)%240)
print(m)
#flag{calcblkas_ncascno_cnskcn)