剑庭安
首页
黑客安全首页全部安全栏目 黑客技术黑客技术、渗透测试、漏洞利用工具与教程 安全软件安全工具、扫描器、检测与审计软件 病毒分析恶意软件分析、样本、逆向与沙箱 CTF思路CTF 题目、writeup、解题思路与工具 防护思路防御技术、加固、检测响应与蓝队 红蓝攻防红队攻击模拟、蓝队对抗、攻防演练 漏洞知识库漏洞、CVE、PoC、EXP 与安全研究
逆向|反编译
PHP源码PHP 网站源码、程序、系统 APP源码安卓/iOS APP 源码 ASP源码ASP 网站源码与程序 NET源码.NET 网站源码与系统 小程序源码微信/支付宝小程序源码 Dedecms风格模板Dedecms 织梦风格模板 Empirecms风格模板EmpireCMS 帝国风格模板 Discuz商业模板/插件Discuz 商业模板与插件 WordPress主题/插件WordPress 主题与插件 其它源码、模板其它各类源码与模板 游戏源码游戏源码与引擎项目 加密货币源码加密货币、区块链、钱包、USDT/比特币相关源码与工具 手游源码手机游戏源码、服务端、客户端与引擎项目 传奇源码热血传奇、传奇世界、复古传奇等客户端/服务端/引擎源码 页游源码网页游戏、H5 游戏、浏览器游戏源码 端游源码电脑单机游戏、PC 网游客户端/服务端源码
最新万能免驱动支持所有型号打印机下载程序 日历天气老黄历 · 每天同步真实日期与天气
站长工具站长工具 自助开通会员浏览该分类 其他资源qtziy SEO工具SEO工具 站群源码站群源码 泛程序泛程序 蜘蛛模板蜘蛛模板 蜘蛛池蜘蛛池 外链工具外链工具
搜索 自助开通会员🔓 破甲 API
登录 注册
首页 分类列表 CTF思路 不等式_解决_与_CVP - 针对CTF挑战的CVP “…
不等式_解决_与_CVP - 针对CTF挑战的CVP “技巧” CTF思路 点击放大
作者:admin 发布:2026-10-05

不等式_解决_与_CVP - 针对CTF挑战的CVP “技巧”

项目说明Inequality Solving with CVP A special case of this problem has another algorithm : check the "Special Case" folder for details A full wr…
资源可下载 免费下载 0 条讨论
会员资源
开通会员后即可下载全部资源。
登录后开通会员
会员方案
237浏览量
0讨论
2下载链接
可下载资源状态
内容可验证
更新 2026-10-05
人工审核发布
评论区答疑

Inequality_Solving_with_CVP - CVP "trick" for CTF challenges

项目说明

Inequality Solving with CVP

A special case of this problem has another algorithm : check the "Special Case" folder for details

A full writeup on this toolkit (in Korean) will hopefully be posted for SAMSUNG Software Membership blog.

How to use

The sol has four inputs, matrix `mat, lower/upper bounds lb, ub, and a weight.

Assume mat is an n x m integer matrix. This means there are n and m inequalities.

Each column of the mat represents a linear combination of the n .

Each entry of lb, ub denotes a lower/upper bound to that linear combination.

Of course, we require the length of lb, ub to be m.

weight is a that you do *NOT* have to initialize. It will be explained later.

result is the result of the CVP

applied_weights is the applied weights during the weighting process (see below)

fin is the actual value of the , recovered when n = m and are linearly independent

We also have a heuristic for number of solutions for the inequality. This is a good way to decide if this method is feasible. For some notes on this topic, check out Mystiz's writeup on Example Challenge 5.

The reasoning behind the algorithm

Warning : the stuff I say here are not mathematically precise. It's based on intuition

Basically what the algorithm does, is to build a lattice with the gi and find a closest (with Babai's algorithm) to (lb + vb) / 2. However, there is one more twist to the algorithm.

The reason we hope that CVP will solve our problem is basically as follows

  • CVP will try to minimize ||x - (lb + vb) / 2|| where x is in our lattice

  • Usually, that *implies* trying to minimize |x_i - (lb_i + ub_i) / 2| for each i

  • Therefore, it will try to keep |x_i - (lb_i + ub_i) / 2| below |(ub_i - lb_i) / 2|!
  • However, there's a case where this reasoning fails.

  • Assume we have an instance withlb = [0, 0], ub = [10 ** 300, 1]

  • Does the C "respect" the bound lb_2 = 0, ub_2 = 1?

  • C will ignore it to keep the first entry close to (10 ** 300) / 2 as possible
  • To do this, we have to *scale* our inequalities so ub_i - lb_i becomes of similar size.

  • This can be done by multiplying an entire column, as well as lb_i and ub_i

  • What if lb_i = ub_i? Then, we have to multiply a super large integer to that column.

  • This super large integer is the weight in the input.

  • The default weight` is what I think is "super large", but you can definitely change it :)
  • Further Comments

  • Babai's Algorithm implementation is NOT MINE - read solver.sage for details

  • I ha some example challenges I ha using this technique.

  • You can also break truncated LCG with this idea.

  • This method does not work *that* well with low density 0/1 knapsack - CJ LOSS is much better.

  • The *scaling* method (ob) increases the runtime of the LLL.

  • It seems like sometimes S better results than CVP...

  • If failed, it's a good idea to try a different scaling by observing the failed output.

  • 项目信息

    开发语言:Sage

    Star 数:149

    技术要点

    该项目属于CTF思路方向的开源资源,代码结构清晰,适合安全研究人员学习参考。项目围绕CVP "trick" for CTF challenges展开,提供了可运行的实现,对理解相关安全机制、工具原理与攻防技术具有较高的研究价值。

    从技术实现角度看,此类项目的核心在于对底层原理的深入理解与工程化落地。开发者在研究过程中可以结合官方文档与社区讨论,梳理项目的初始化流程、核心模块职责与数据流转,逐步掌握其中的技术细节与设计思路。

    使用与学习建议

    1. 下载源码压缩包,解压到本地环境。

    2. 根据项目类型准备对应的运行环境与依赖。

    3. 按照 README 中的步骤完成配置与部署。

    4. 在隔离的测试环境中运行验证,避免影响生产系统。

    免责声明

    本资源来源于开源社区,仅供安全研究、技术学习与合法授权范围内的攻防演练使用,请勿用于任何非法或侵害他人权益的用途。使用本项目产生的一切后果由使用者自行承担。

    资源标题不等式_解决_与_CVP - 针对CTF挑战的CVP “技巧”
    所属分类CTF思路
    发布作者admin
    发布时间2026-10-05 23:49:59
    下载权限 免费下载
    附件数量2 个下载链接
    浏览次数237
    讨论数量0
    主题状态正常讨论中

    本资源免费,登录后即可在本页「下载链接」区域获取全部附件。

    请在评论区留言说明具体链接,或联系作者补档。楼主更新后本页会同步最新的下载地址。

    请先阅读正文中的授权说明;未注明的默认仅限站内学习交流,禁止直接搬运到其他站点二次售卖。
    还没有讨论,快来抢沙发~
    登录 后才能参与讨论
    下载链接
    会员才能下载
    登录后开通会员
    同分类推荐
    暂无同类资源
    免费登录即可下载
    查看会员
    放大预览

    © 2026 剑庭安 - 网站开发定制 SEO 优化蜘蛛池代做 在线看手相算命. 保留所有权利。

    Powered by 酷像SEOv3.0

    网站地图 Sitemap.xml
    首页 全部分类 黑客安全 逆向|反编译 精品源码 站长工具自助开通会员其他资源SEO工具站群源码泛程序蜘蛛模板蜘蛛池外链工具创意乐园 搜索 会员服务 登录 注册