对称加密,只用一次替换和一次置换,密钥大于UINT16_MAX小于UINT64_MAX,挑战3个月内无法破解

中文版

如题此次加密只使用一次替换和一次置换,这个加密操作比较新奇。为了不被秒了,我采用将密文分段加密。

这个加密方法是我自创的,如果用暴力破解也许可以,但内容越多我的加密方法的加密性就越强,我不觉得暴力破解能用多久。

这次用分段加密是为了让加密特性让大家看看,也是为了加大难度。

加密方法绝对真实有效,可被解密。至于解密出奇怪的东西,那你就解密错了,说明我的加密有强度。

规则

我会把密文放在这里和Q群(835336852),你们要将结果塞进Q群994104619中验证。加入群聊成功就算答案正确。

现在是8月多,那就12月后还没有人进群就算我赢了,反之,你们赢了。不论输赢我都会公开加密方法。

English

As the title suggests, this encryption uses only one substitution and one permutation, which is quite a novel encryption operation. To avoid being cracked instantly, I've adopted the method of segmenting the ciphertext for encryption.

This encryption method is my own creation. If brute force is used, it might be possible to crack it, but the more content there is, the stronger the encryption of my method becomes. I don't believe brute force will last long.

I'm using segmented encryption this time to showcase the characteristics of the encryption and to increase the difficulty.

The encryption method is absolutely genuine and effective, and it can be decrypted.If you end up decrypting something strange, then you've decrypted incorrectly, which indicates that my encryption has strength.

Rules

I will place the ciphertext here and in the Q group (835336852), and you need to submit the result to the Q group 994104619 for verification. Successfully joining the group chat will count as the correct answer.

It's now August, so if no one joins the group after December, I win; otherwise, you win. Regardless of winning or losing, I will disclose the encryption method.

密文 / Cipher

<nnj~uJk"vJQkuj>"[Q~JnvkD>Q#D&"nu|&Q~njvj~jvJPjQvjn"uP"cvu>j&uDDjV]vvv&DDDDQjQJD~vavnDjJv"u~gQu>vn~Jvj""~&v&VZn&~dvvjDvQjg"]dJv]>Jkv"vjDj"&&jj"uvDJ3eJ"~QjjJ&nZjDQ~ovnuZaDJVkv||v(|uv|>uJPjD>"~"vvjvnDv>nnn"evvJa#D&~v]vvjv"j#Pnu>av>~"|nvdvvvu"P6#DancnvJD["]vvvjV"u"#PJuQPV""u+sQ~njQQvJjv"eaPcQ"nnv>6&&P@nj#D""n~6Qavvv6#D&QnJnvuunvJD

(;(^sSXS^%l;b-(;lmllb%xg* lV*V(;jbblX\l(*gl(%b;(\mbb%mbn%zSlQS,((mY;\(lY6slb(^(slFlSS\jllls(l^gmVscsXglgQbgg;fz%lg\jmlbzSXf*ljXbbXll%z%zH;l\%Xgfgllg6(szb%\lg;llXljlSs%z\(^6sm\lsmY(\sSbs(slj;mXlXzSmsslH\lV+z(s^6^*gl(sm^(%lX-6QlljgS(X(m;SXm(l^Sjlll(%%m\X%l(%Xll(\Q;lzb%((Hg;s%lbgVb\gXQHll(z{m^l"lcl(\m;HglXVYbl6lji(6%;S\ll^mb~z%m;blb+X\s\smm(l;Vb\gj*bHjXl%;%mggX"mss%s(\g(mQmSz"lg(csQHlSj(SzXlm(g\g\llmlzm;jbX*z\z(z\zS;

z9gTQiXXgg2;X<g4i.*J@4<@.Ji*2.Lz2XLiT.Xgig2.*JXg.9^g*JggiTii.<JJ<2*JbATQ_.J.ZbiT.[4LZ[*z[._@iT4L[Lg2<*<<Z[XT.9<T@.g4<.<*TTQgJg.bZJgb2XbgKiXgiZTT(B9ZgJg[J<J*gg.g.gg.gRT<@4@Z2.TJ49Pz4g<.^TQZT.XTgJ@g.*gX^AT@QL*g@.@g.9i<K.g.4{giXXJwXL@xXXTg4XL*J@[Z9X.@"g^<4QX)Jb@TZ4

??^I{s?IFJ}*{-7s^F{{{I{_I!{7F`qI*7?I)7*0^K7{_{{`0{4v{-{{7^4!+7Is_7IIs^s{KsK{F4+-IIIs7sKs}]7`{!-ss?{|sss]4T{_{!F7K-K?F{7{{sT4F}?-Ks+s!Ks`ss_s+V]{{{{v]7K^KP7}{]{7}I:7+?-Fs-F-s-07I7^F|I`}I7KI_-v|{I+?F\K`w_&I{sIs\0F?{IK{^-]sF{{}{{4?]4{{I??74)?s!K!v{?FFs-0]vsv)_]7+}IK?}0{-{]!K?{^vv]`IK{`{TIKV{K?{w]|w`s47-{?v{wvss+s7F7{I7]I{}K{{7-]-%K7-{sVsPs4F-|?V4v{K{-{{KK`{IK--F-{{s{

Z!zZx}&W-TsR-Ozz-Z`MZi^m^Ti-OxJZzx-@!xOxB$zsxs-$x!U-xMZ`xss@xsi-xB!-xsxzzBXxix$sB!!ssx@[B`szi&BMZ$zOxzw$-@+-wB|[$&-xzO:xsxx[z-xB-@O--xZx!x:|zix-ZZ[[x&!B[&W[U!|sB--ZzO:@xmMTxBi}ixx-m-x[ZjMZOwBZxMkmiOz!O-x--T-x!sz-@ss-!@@&[-[-$-ZxBs-Zz@m&O!Z!sBz!mx@s:zsBxJ!

问题 / Question:


j]ZOY{\~h!+?{\S~St9uASZ0!SeZeL00ej^S~![e[SLSjuj~

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值