Quinn Sheng a1exlism

## gcc-security.txt
Source material:
  http://security.stackexchange.com/questions/24444/what-is-the-most-hardened-set-of-options-for-gcc-compiling-c-c
  https://wiki.gentoo.org/wiki/Hardened_Gentoo
  https://wiki.debian.org/Hardening

================================================================================================================>
GCC Security related flags and options:

CFLAGS="-fPIE -fstack-protector-all -D_FORTIFY_SOURCE=2"
LDFLAGS="-Wl,-z,now -Wl,-z,relro"

## 密码模块安全要求.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                a1exlism
                / 密码模块安全要求.md
            
            
              Created
              November 23, 2022 08:09
                — forked from orxvan/密码模块安全要求.md
            
          
    from http://www.sanlen.com/news/e7/2014-02-24/sl_news_41573.htm
1 范围
本标准提出了用于保护计算机与通信系统内部敏感信息的安全系统内使用的密码模块的安全要求。本标准为密码模块定义了四个安全等级，以满足不同安全等级要求的敏感数据及多样化的应用环境的安全需求。本标准划分了10个安全领域，在每种安全领域中定义了四个安全等级，每一种安全等级都比较低的安全等级提供了更高的安全性。 
本标准适用于密码模块的安全性检测，亦可用于指导密码模块的设计、开发和测试工作。 

2 规范性引用文件 

下列文件对于本文件的应用是必不可少的。凡是注日期的引用文件，仅注日期的版本适用于本文件。凡是不注日期的引用文件，其最新版本（包括所有的修改单）适用于本文件。 

GM/T 0005 随机性检测规范

  
## symbols
SYMBOLS = """ !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\] ^_`abcdefghijklmnopqrstuvwxyz{|}~"""

## large_file_read.py
# LINK https://segmentfault.com/a/1190000005356779
#!/usr/bin/env python
# coding=utf-8
import sys
import time

start = time.time()
lines = 0

for each_line in sys.stdin:

## ES6_Assign at once.js
class Test {
  constructor() {
    this.data = {
      name: null,
      age: -1,
      attr: null
    }
  }
  init() {
    this.data = {

## java_exceptions.java
public class ThrowException {
  public static void main(String args[]) {
    try {
      process1();
    } catch (Exception e) {
      e.printStackTrace();
    }
  }

  static void process1() {

## random_numbers.cpp
/*
 * 生成在[a, b]范围内的随机数据
 * Random numbers in the range of [a,b]
 */
#include <cstdio>
#include <cstdlib>
#include <ctime>
const int MAXN = 1000;
int main() {
  int arr[MAXN];

## binary_sarch.cpp
/*
 * INPUT: 100 \n
 * TIPS: 输入必须有序, 否则pos无意义
 * 1 10 11 11 12 12 13 15 16 18 2 2 20 20 20 20 21 21 21 22 22 22 23 23 23 23 24 24 24 24 24 27 27 28 32 35 4 40 40 40 41 42 44 44 46 47 47 5 5 52 53 54 57 58 6 60 61 62 62 63 63 64 65 65 65 69 7 70 70 71 71 72 75 75 76 77 8 8 82 84 84 85 86 86 87 89 9 9 91 91 93 93 95 95 96 97 97 98 98 99
 * Search X \n
 * OUTPUT: position of X
 */
#include <cstdio>
#include <algorithm>
using namespace std;

## innderHTMLCode.php
<?php

print <<<EOT

<!DOCTYPE html>
<html lang="en">
<head>
  <meta charset="UTF-8">
  <meta name="viewport" content="width=device-width, initial-scale=1.0">
  <meta http-equiv="X-UA-Compatible" content="ie=edge">

## shell_dirctor.sh
# Link: https://unix.stackexchange.com/questions/77007/mv-cannot-stat-no-such-file-or-directory-in-shell-script

# Failed
mv /path/to/FILE /new/path/to/FILE

# Double Quote the directory
mv "/path/to/"FILE "/new/path/to/"FILE
	Source material:
	http://security.stackexchange.com/questions/24444/what-is-the-most-hardened-set-of-options-for-gcc-compiling-c-c
	https://wiki.gentoo.org/wiki/Hardened_Gentoo
	https://wiki.debian.org/Hardening

	================================================================================================================>
	GCC Security related flags and options:

	CFLAGS="-fPIE -fstack-protector-all -D_FORTIFY_SOURCE=2"
	LDFLAGS="-Wl,-z,now -Wl,-z,relro"
	# LINK https://segmentfault.com/a/1190000005356779
	#!/usr/bin/env python
	# coding=utf-8
	import sys
	import time

	start = time.time()
	lines = 0

	for each_line in sys.stdin:
	class Test {
	constructor() {
	this.data = {
	name: null,
	age: -1,
	attr: null
	}
	}
	init() {
	this.data = {
	public class ThrowException {
	public static void main(String args[]) {
	try {
	process1();
	} catch (Exception e) {
	e.printStackTrace();
	}
	}

	static void process1() {
	/*
	* 生成在[a, b]范围内的随机数据
	* Random numbers in the range of [a,b]
	*/
	#include <cstdio>
	#include <cstdlib>
	#include <ctime>
	const int MAXN = 1000;
	int main() {
	int arr[MAXN];
	/*
	* INPUT: 100 \n
	* TIPS: 输入必须有序, 否则pos无意义
	* 1 10 11 11 12 12 13 15 16 18 2 2 20 20 20 20 21 21 21 22 22 22 23 23 23 23 24 24 24 24 24 27 27 28 32 35 4 40 40 40 41 42 44 44 46 47 47 5 5 52 53 54 57 58 6 60 61 62 62 63 63 64 65 65 65 69 7 70 70 71 71 72 75 75 76 77 8 8 82 84 84 85 86 86 87 89 9 9 91 91 93 93 95 95 96 97 97 98 98 99
	* Search X \n
	* OUTPUT: position of X
	*/
	#include <cstdio>
	#include <algorithm>
	using namespace std;
	<?php

	print <<<EOT

	<!DOCTYPE html>
	<html lang="en">
	<head>
	<meta charset="UTF-8">
	<meta name="viewport" content="width=device-width, initial-scale=1.0">
	<meta http-equiv="X-UA-Compatible" content="ie=edge">
	# Link: https://unix.stackexchange.com/questions/77007/mv-cannot-stat-no-such-file-or-directory-in-shell-script

	# Failed
	mv /path/to/FILE /new/path/to/FILE

	# Double Quote the directory
	mv "/path/to/"FILE "/new/path/to/"FILE