当前位置:网站首页>某视频网站m3u8非感知加密分析
某视频网站m3u8非感知加密分析
2022-06-25 07:35:00 【渔滒】
某视频网站m3u8非感知加密分析
样本地址:aHR0cHM6Ly92LnFxLmNvbS94L2NvdmVyL216YzAwMjAwMXB2eHd6eS9pMDAzM2NncjF2bi5odG1s
打开网站后,在播放界面右键,点击【视频信息】

可以看到,这里给出了视频的加密类型为【CHACHA】,按照原来的方法先查找m3u8

奇怪了,这里m3u8明显没有key的标志,但是为什么会显示有DRM呢?不管这么多,尝试直接下载。
果然不出所料,不管用什么m3u8下载器,下载完以后不是视频消失就是报错了,说明确实是有加密的,但是网页上可以播放,说明解密方法肯定在网页中。
初步分析后发现,事情并没有想象中的那么简单,解密过程是放在了wasm中,那么按照前面wasm相关文章的经验,来分析这个wasm,先把wasm下载到本地,然后转换为.o文件用IDA查看

解密是其中的【h】方法,这个方法前面都是内存相关的指令,
边栏推荐
- Day 5 script and UI System
- Internet of things (intelligent irrigation system - Android end)
- Hyper-v:hyper-v generation 1 or generation 2 virtual machines
- 城链科技平台,正在实现真正意义上的价值互联网重构!
- GIL问题带来的问题,解决方法
- [QT] qtcreator shortcut key and QML introduction
- Getting to know the generation confrontation network (12) -- using pytoch to build wgan-gp to generate handwritten digits
- 420 sequence traversal of binary tree 2 (429. sequence traversal of n-ary tree, 515. find the maximum value in each tree row, 116. fill in the next right node pointer of each node, 104. maximum depth
- Unit conversion - mm to pixel - pixel to MM
- Common action types
猜你喜欢

Daily question brushing record (III)

How is the ISM model analyzed?

Find the nearest common ancestor (Sword finger offer) of two nodes in the binary tree (search tree)

Find out the possible memory leaks caused by the handler and the solutions

城链科技平台,正在实现真正意义上的价值互联网重构!

Prepare these before the interview. The offer is soft. The general will not fight unprepared battles

linux中的mysql有10061错误怎么解决

Establish open data set standards and enable AI engineering implementation

Exchange: manage calendar permissions

About i/o -- the relationship between memory and CPU and disk
随机推荐
Unity addressable batch management
Similarity calculation method
Go language learning tutorial (13)
《树莓派项目实战》第五节 使用Nokia 5110液晶屏显示Hello World
TS environment setup
Is there any risk in making new bonds
关于I/O——内存与CPU与磁盘之间的关系
Is it really safe to pay new debts? Is it risky
各种同步学习笔记
UEFI:修复 EFI/GPT Bootloader
想开个户,网上股票开户安不安全?
GIL问题带来的问题,解决方法
Home server portal easy gate
420 sequence traversal of binary tree 2 (429. sequence traversal of n-ary tree, 515. find the maximum value in each tree row, 116. fill in the next right node pointer of each node, 104. maximum depth
In 2022, which industry will graduates prefer when looking for jobs?
检测点是否在多边形内
About i/o -- the relationship between memory and CPU and disk
Go语言学习教程(十三)
初识生成对抗网络(12)——利用Pytorch搭建WGAN-GP生成手写数字
Beam search and five optimization methods