avestura

YARA Rules Tests

We have two folders called:

• yararules: here we put our custom yara rules
• yararules.test: here we put the test cases for the yararules custom yaras

For each .yar file inside the yararules folder, we should create a folder with the same name as the yara file inside the yararules.test/testcases folder.

• If the test case file starts with ok-* it means that the file should not match the yara file.

avestura

#Requires AutoHotkey v2.0
#Include RegExHotstring.ahk
#SingleInstance Force

RegExHotstring("([s$]+)(h+)([i!]+)(r+)([i!]+)(n+)([i!]+)", (m) => DllCall("LockWorkStation"), "* ?")
RegExHotstring("(ش+)(ی+)(ر+)(ی+)(ن+)(ی+)", (m) => DllCall("LockWorkStation"), "* ?")
RegExHotstring("(b+)(a+)(s+)(t+)(a+)(n+)([i!]+)", (m) => DllCall("LockWorkStation"), "* ?")
RegExHotstring("(ب+)(س+)(ت+)(ن+)(ی+)", (m) => DllCall("LockWorkStation"), "* ?")
RegExHotstring("(m+)(i+)(d+)(a+)(m+)", (m) => DllCall("LockWorkStation"), "* ?")

avestura

{{- /* Template based on https://docs.gitlab.com/ee/user/application_security/dependency_scanning/#reports-json-format */ -}}
{
  "version": "15.0.7",
  "scan": {
    "analyzer": {
      "id": "trivy",
      "name": "Trivy",
      "vendor": {
        "name": "Aqua Security"
      },

avestura

[core]
	editor = nvim

[status]
	short = true
	branch = true

[url "https://"]
	insteadOf = git://
[url "https://github.com/"]

avestura

Written by @trgwii, not me:

Why Go is bad?

"If Go wasn't made by Google, what would be bad about it?" Stafn asked.

And this is the response from Thomas:

1. uncomposable error handling, this is like being back to:

avestura

document.location = decodeURI(new URLSearchParams(window.location.search).get("continue"))

avestura

# use pssuspend to suspend and resume a process
# download at SysInternals Process Utilities
# https://learn.microsoft.com/en-us/sysinternals/downloads/pssuspend

$targetProcessId = 102030
$freezeMS = 1000
$resumeMS = 1

while($true) {
  pssuspend.exe $targetProcessId

avestura

const getDragon2 = n => {
    const getDragonRecurse = (n, complement) => {
        if(n === 1) {
            return complement ? [0] : [1]
        }
        
        const right = getDragonRecurse(n - 1, complement);
        const left = getDragonRecurse(n - 1, !complement);
        return complement ? [...right, 0, ...left] : [...left, 1, ...right]
    }

avestura

const getDragonBit = (n) => {
    while ((n & 1) == 0) {
        n = n >> 1;
    }
    return 1 - ((n >> 1) & 1)
}

const getDragon = n => {
    let str = ""
    for (i = 1; i < Math.pow(2, n); i++) {

avestura

open System
open System.Linq
open System.Diagnostics


// change cpu affinity while app is running
// run in debug mode: optimizations off

printfn "Press enter to continue"