Sissel Siss3l

注意：本文内容适用于 Tmux 2.3 及以上的版本，但是绝大部分的特性低版本也都适用，鼠标支持、VI 模式、插件管理在低版本可能会与本文不兼容。

Tmux 快捷键 & 速查表 & 简明教程

启动新会话：

tmux [new -s 会话名 -n 窗口名]

恢复会话：

Sometimes you need a 2048-bit RSA keypair for testing various things.

If you, like myself, have a child's sense of humor, I offer the following for your general use:

P = 19
Q = 1696986749729493925354392349339746171297507422986462747526968361144447230710192316397327889522451749459854070558277878297255552508603806832852079596337539247651161831569525505882103311631577368514276343192042634740927726070847704397913856975832811679847928433261678072951551065705680482548543833651752439700272736498378724153330763357721354498194000536297732323628263256733931353143625854828275237159155585342783077681713929284136658773985266864804093157854331138230313706015557050002740810464618031715670281442110238274404626065924786185264268216336867948322976979393032640085259926883014490947373494538254895109731

N = 0xFF69696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696969696

Count Leading/Trailing Zero Bits (Byte-wise)

Counting the trailing zero bit count (TZCNT) can be done by isolating the lowest bit, then depositing this into the appropriate locations for the count. The leading zero bit count (LZCNT) can be done by reversing bits, then computing the TZCNT.

__m128i _mm_tzcnt_epi8(__m128i a) {
	// isolate lowest bit
	a = _mm_andnot_si128(_mm_add_epi8(a, _mm_set1_epi8(0xff)), a);
	// convert lowest bit to index

Hacking the SX Core modchip

Background

On October 2nd 2020, CVE-2020-15808 was publicly announced, detailing an out-of-bounds memory read/write vulnerability in STM's microcontroller firmware. Any chip containing STM's USB CDC driver library contains the bugged code, which represents a large amount of products on the market. While bugged STM libraries may be bad enough, this problem is much more widespread. Several companies manufacture "clones" of STM chips which, due to mostly identical MMIO (Memory Mapped Input/Output) addresses, fully support the affected STM vendor code. Most clone manufacturers don't offer their own libraries, so developers must either write their own from scratch, or they can use the STM's existing libraries, and most clone manufacturers encourage this.

Armed with this information, I became interested in exploiting and dumping the flash on the "Team Xecuter" SX Core modchip for the Nintendo Switch. The MCU used on the ch

Service Workers Tips

Reloading a service worker

Reloading a page won't update/remove the previous version of its service worker. To make sure you're using the latest version of your service worker, make sure to check the "Update on reload" toggle in the "Application" ⭢ "Service Workers" section of the Chrome DevTools.

Simulate a network condition

To simulate a network condition (e.g.: offline, 3g, etc...) in a service worker on Chrome, uncheck the "Update on reload" toggle.

Think twice before abandoning Xorg. Wayland breaks everything!

Hence, if you are interested in existing applications to "just work" without the need for adjustments, then you may be better off avoiding Wayland.

Wayland solves no issues I have but breaks almost everything I need. Even the most basic, most simple things (like xkill) - in this case with no obvious replacement. And usually it stays broken, because the Wayland folks mostly seem to care about Automotive, Gnome, maybe KDE - and alienating everyone else (e.g., people using just an X11 window manager or something like GNUstep) in the process.

As 2024 is winding down:

Chunk Norris — Google CTF 2020

Author: Kevin He
Team: 3PAC
Challenge Category: Crypto
Points: 98
Attachments: See challenge.py and output.txt in this Gist.

Chunk Norris is black belt in fast random number generation.

Start off by examining the code for challenge.py. It uses RSA — a modern public key cryptography algorithm — to encrypt the flag. The idea behind public key cryptography is that given the public key, everyone can encrypt plaintext messages, but only the party who possesses the secret private key can decrypt the ciphertext back into plaintext. In this challenge, only the public key is given, and it consists of the modulo n — a product of 2 large prime numbers — and the exponent e. However, the security of RSA heavily depends on the fact that its public key modulo n cannot be factored into its constituent primes p and q. Once p and q are known, the private key `d






	cve-2019-8449
	The /rest/api/latest/groupuserpicker resource in Jira before version 8.4.0 allows remote attackers to enumerate usernames via an information disclosure vulnerability.
	https://jira.atlassian.com/browse/JRASERVER-69796
	https://victomhost/rest/api/latest/groupuserpicker?query=1&maxResults=50000&showAvatar=true
	=====================================================================================================================================

	#!/bin/sh

	# run while loop for boot_completed status & sleep 10 needed for magisk service.d
	while [ "$(getprop sys.boot_completed \| tr -d '\r')" != "1" ]; do sleep 1; done
	sleep 10

	# save currently active function name
	echo "$(ls -al /config/usb_gadget/g1/configs/b.1/)" \| grep -Eo f1.* \| awk '{print $3}' \| cut -d/ -f8 > /data/adb/.fixdd

	# loop

	Links from https://www.apple.com/final-cut-pro/trial/
	Final Cut Pro release notes https://support.apple.com/en-us/HT201237
	What's new in Final Cut Pro https://support.apple.com/en-us/HT207877
	Release history https://web.archive.org/web/20221121093911/https://en.wikipedia.org/wiki/Final_Cut_Pro_X#Release_history

	Final Cut Pro 10.1.3
	https://secure-appldnld.apple.com/Final_Cut_Pro_X/031-05296.20140814.VRR4r/FinalCutProTrial10.1.3.dmg

	Final Cut Pro 10.1.4
	https://secure-appldnld.apple.com/Final_Cut_Pro_X/031-02980.20141202.Jgt44/FinalCutProTrial10.1.4.dmg