<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Checksec on Ip2867</title><link>https://ip2867.github.io/tags/checksec/</link><description>Recent content from Ip2867</description><generator>Hugo</generator><language>zh-CN</language><managingEditor>xxx@example.com (栗悟饭与龟波功)</managingEditor><webMaster>xxx@example.com (栗悟饭与龟波功)</webMaster><copyright>本博客所有文章除特别声明外，均采用 BY-NC-SA 许可协议。转载请注明出处！</copyright><lastBuildDate>Fri, 30 Oct 2026 15:00:00 +0800</lastBuildDate><atom:link href="https://ip2867.github.io/tags/checksec/index.xml" rel="self" type="application/rss+xml"/><item><title>Pwn 入门基础：从汇编、栈到保护机制</title><link>https://ip2867.github.io/post/pwn-basics-asm-stack-protections/</link><pubDate>Fri, 30 Oct 2026 15:00:00 +0800</pubDate><author>xxx@example.com (栗悟饭与龟波功)</author><guid>https://ip2867.github.io/post/pwn-basics-asm-stack-protections/</guid><description>
<![CDATA[<h1>Pwn 入门基础：从汇编、栈到保护机制</h1><p>作者：栗悟饭与龟波功（xxx@example.com）</p>
        
          <blockquote>
<p>这篇笔记想做的事，是把「汇编基础」和「保护机制」两条线接起来。目标不是背指令表，而是让你看到一段 <code>read(0, buf, 256)</code> 时，脑子里能自动浮现出栈的布局、返回地址的位置，以及这道题可能开了哪些保护、该从哪里下手。</p>
        
        <hr><p>本文2026-10-30首发于<a href='https://ip2867.github.io/'>Ip2867</a>，最后修改于2026-10-30</p>]]></description><category>Pwn</category></item></channel></rss>