Little_Small_Joze的博客

git 提交代码流程

Little_Small_Joze — Sat, 15 Feb 2025 22:13:57 +0800

git 提交代码流程

IOT设备入侵检测思路

Little_Small_Joze — Tue, 06 Apr 2021 08:38:45 +0800

一、思路1 登录日志查看如果当前设备登录日志存在超出预设频率的失败并最终成功，则初步判断为遭受入侵。网络请求监控监控当前设备对外发起的网络请求，如果频繁对外发送登录验证请求则判定为遭受入侵。监控当前设备对外发起的网络请求,若发现当前设备频繁对外发送telnet协议或者ssh协议的登录验证请求,并且对外的登录验证请求涉及的账号或者密码不同,并返回大量错误信息,则判定当前设备遭受入侵并尝试感染其他设备。端口服务检测检测当前设备网络端口服务，若预设端口原始服务被篡改，则判定为遭受入

记录一下清华源的地址

Little_Small_Joze — Sun, 21 Mar 2021 11:11:57 +0800

下载pwn工具的时候，发现换个清华源比较舒服 https://pypi.tuna.tsinghua.edu.cn/simple

printf(&x)的利用——CGfsb题解

Little_Small_Joze — Thu, 11 Mar 2021 11:33:06 +0800

例行检测 file CGfsb checksec CGfsb 反编译 int __cdecl main(int argc, const char **argv, const char **envp) { _DWORD buf[2]; // [esp+1Eh] [ebp-7Eh] BYREF __int16 v5; // [esp+26h] [ebp-76h] char s[100]; // [esp+28h] [ebp-74h] BYREF unsigned int v7; // [e

python3的pwn用法——when_did_you_born题解

Little_Small_Joze — Thu, 11 Mar 2021 01:15:33 +0800

检测截图 file when_did_you_born checksec when_did_you_born 我承认看到金丝雀+NX有那么一点点不开心，但是不影响。反编译程序根据上一步的file查看到它是64-bits的ELF文件，所以64-bits的IDA打开它，反编译找到主函数F5查看源代码。 __int64 __fastcall main(int a1, char **a2, char **a3) { __int64 result; // rax char v4[8]; // [rs

checksec安装与使用

Little_Small_Joze — Sun, 07 Mar 2021 01:47:20 +0800

checksec安装与使用安装 sudo apt install checksec 报错无处不在，安装的时候出现一下报错：然后换尝试了疯狂换源+updatge不行，最后换了一种安装方式，如下：参考 https://github.com/slimm609/checksec.sh git clone https://github.com/slimm609/checksec.sh 将其拷贝到任意全局bin目录下方便使用 sudo cp checksec /usr/local/bin/

宝塔搭建多个站点

Little_Small_Joze — Fri, 12 Feb 2021 15:34:33 +0800

添加第一个站点 ⇒ 在安装好宝塔的服务器上命令查看宝塔的外网地址，命令如下: bt default ⇒ 用给出的账号密码登录外网面板地址，然后左侧边栏“软件”里面配置网站需要的环境（包括nginx或者apache，还有php等等）。服务器安全组设置里，要确保放行了需要的端口。觉得不安全可以把SSH等服务的默认端口号改到其它端口去。 ⇒ 然后，在宝塔外网面板页面，左侧边栏的“文件”这里上传网站文件夹。 ⇒ 然后在“网站”里，添加站点，根目录和域名端口号要写对，然后选择对应软件版本。根目录一般就写

栈溢出

Little_Small_Joze — Wed, 03 Feb 2021 18:35:15 +0800

缓冲区溢出缓冲区溢出简介计算机程序的运行依赖于函数调用栈。栈溢出是指在栈内写入超出长度限制的数据，从而破坏程序运行甚至获得系统控制权的攻击手段。实现缓冲区溢出，要满足两个条件：第一，程序要有向栈内写入数据的行为，并且写入长度要大于目标存储长度；第二，程序并不限制写入数据的长度。历史上第一例被广泛注意的**“莫里斯蠕虫”病毒**就是利用C语言标准库的 gets() 函数并未限制输入数据长度的漏洞，从而实现了栈溢出。缓冲区溢出两种类型：基于栈的缓冲区溢出——目

ubuntu18 安装及使用docker

Little_Small_Joze — Wed, 03 Feb 2021 17:11:08 +0800

安装 update $ sudo apt-get update 安装 apt 依赖包，用于通过HTTPS来获取仓库 $ sudo apt-get install \ apt-transport-https \ ca-certificates \ curl \ gnupg-agent \ software-properties-common 添加 Docker 的官方 GPG 密钥 $ curl -fsSL https://download.docker.com/

计算机通信网

Little_Small_Joze — Sat, 12 Dec 2020 00:40:21 +0800

本文主要纳计算机通信网相关知识归纳，主要参考《计算机通信网原理与技术》薛质袁艺蒋兴浩编著 ps:本文现在处于疯狂在更状态，预计5天内更完。

1007 Maximum Subsequence Sum (25分)

Little_Small_Joze — Fri, 24 Jul 2020 22:32:39 +0800

Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1≤i≤j≤K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For exampl

1149 Dangerous Goods Packaging (25分)

Little_Small_Joze — Sun, 19 Jul 2020 18:33:31 +0800

When shipping goods with containers, we have to be careful not to pack some incompatible goods into the same container, or we might get ourselves in serious trouble. For example, oxidizing agent （氧化剂） must not be packed with flammable liquid （易燃液体）, or it

1141 PAT Ranking of Institutions (25分)

Little_Small_Joze — Sun, 19 Jul 2020 15:19:24 +0800

After each PAT, the PAT Center will announce the ranking of institutions based on their students' performances. Now you are asked to generate the ranklist. Input Specification: Each input file contains one test case. For each case, the first line gives a

1137 Final Grading (25分)

Little_Small_Joze — Sun, 19 Jul 2020 09:50:10 +0800

For a student taking the online course "Data Structures" on China University MOOC (http://www.icourse163.org/), to be qualified for a certificate, he/she must first obtain no less than 200 points from the online programming assignments, and then receive a

1004 Counting Leaves (30分)

Little_Small_Joze — Sat, 18 Jul 2020 18:30:03 +0800

A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child. Input Specification: Each input file contains one test case. Each case starts with a line containing 0

1003 Emergency (25分)

Little_Small_Joze — Sat, 18 Jul 2020 18:28:53 +0800

As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the length of each road between any pair of cities are marked

1002 A+B for Polynomials (25分)

Little_Small_Joze — Sat, 18 Jul 2020 18:26:54 +0800

This time, you are supposed to find A+B where A and B are two polynomials. Input Specification: Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial: K N1 aN1 N2 aN2

1001 A+B Format (20分)

Little_Small_Joze — Sat, 18 Jul 2020 18:24:53 +0800

Calculate a+b and output the sum in standard format -- that is, the digits must be separated into groups of three by commas (unless there are less than four digits). Input Specification: Each input file contains one test case. Each case contains a pair o

1117 Eddington Number (25分)

Little_Small_Joze — Sat, 18 Jul 2020 18:16:47 +0800

British astronomer Eddington liked to ride a bike. It is said that in order to show off his skill, he has even defined an "Eddington number", E -- that is, the maximum integer E such that it is for E days that one rides more than E miles. Eddington's own E

1140 Look-and-say Sequence (20分)

Little_Small_Joze — Sat, 18 Jul 2020 17:53:51 +0800

Look-and-say sequence is a sequence of integers as the following: D, D1, D111, D113, D11231, D112213111, ... where D is in [0, 9] except 1. The (n+1)st number is a kind of description of the nth number. For example, the 2nd number means that there is o