Jul 16, 2019 04:19 PM
(This post was last modified: Aug 13, 2019 01:01 AM by Phizo.)
EDIT:
So, I’ve had quite a lot of offers, three of which seemed worthwhile. One PM’d me twice and then dropped off after my second reply (hasn't responded for a while despite being online/active), another hit me up on XMPP but haven’t heard anything since, the other being on-site and the only one I’ve taken up: Sui Generis (cheers Tyler).
Due to this, I may just spin something up of my own off-site (while still being a part of Sui Generis).
PM me if you meet the requirements. I’d appreciate it if you don’t PM me otherwise, as I do not want my time wasted. A degree in Computer Science or equivalent would be much preferred. If you cheated your way through university, and therefore cannot prove yourself; again, please don’t waste my time.
Please note this is not about bragging; I'm seriously looking for some cool individuals to hang with.
Also note that I'm not necessarily suggesting that I'm forming the crew and inviting others in. I'm either looking for an existing crew or forming one.
As can be observed on my profile, I've been here since February '09. I've seen a lot of groups/crews but nothing of immediate interest. I haven't frequented these forums in quite some time due to the lack of intriguing content. However, I'll be on to scout for anything of interest for the next couple weeks to see if there's anything interesting to reply to and to check for responses to this thread; for the past couple years or so, mostly I come online just to answer others' enquiries through random threads and received PMs.
Requirements
My own experience and knowledge can be observed in my threads and posts. However, I will demonstrate some of my experience below.
Introduction
I have a degree in computer science (among others) and have since been working as a security consultant/penetration tester. I majored in digital systems security and finished with a distinction. I was also invited/added to an honours society for being (anywhere) within the top 15% of computer science studies in the state. I have a fair amount of programming and general computer science and security experience.
From a testing standpoint, I have decent experience with web-apps, web services (e.g., APIs), mobile-apps, internal/external infrastructures, wireless, VoIP (e.g., RTP/SIP/H.323 attacks, VLAN hopping, eavesdropping, spoofing, etc.), cloud and virtualisation, social engineering, source code review, etc. Also more specialised testing such as reverse engineering, cryptanalysis and general cryptography/cryptanalysis knowledge, (zero-day) exploit development (of various layers), red-teaming, etc. Note that this is not an exhaustive list.
Examples of programming experience
Within the past few years, I have demonstrated fluency in the following programming languages:
Note that this is not exhaustive; I have worked in many other languages. This is simply what I've worked with during the past few years. I have been programming for a very long time.
I am also very familiar with the following programming paradigms:
I have no problem proving that I am fluent in any of the above (or otherwise).
I'm pedantic when it comes to the quality of code and have worked on plenty of complex projects - hacking/security-related and otherwise.
I will mention a few projects, challenges, etc., I've involved myself in to demonstrate knowledge/experience.
Note that this is not a fork of Jynx2/Azazel/Umbreon or otherwise, as they're, quite frankly, are awful and the developer's know nothing about C.
I know the developers. They're admittedly not good at working at such a low-level and programming in general (at least at the time). Sue me.
I am also developing a fully-weaponised Linux C2 / post-exploitation agent (Listeners, Stagers, Modules, etc.), as there are already many dedicated to Windows (however, I'll incorporate functionality to allow for Windows targets down the track). It will be, as it's name suggests (redacted), very focused on being weaponised while efficiently evading IPS/IDS/AV/etc., incorporating malware-evasive techniques, and tunnelling connections and transactions non-suspiciously in a seemingly-legitimate fashion. It will have some neat features such as in-memory ELF binary execution to prevent touching disk and other types of way of executing native code (perhaps equivalent things to process hollowing and doppleganging on Windows). It has an adjustable beacon interval, which can also be randomised each time to seem like requests are even more legitimate, for each target among other things, so infected clients will check the C2 server every so often for tasks in the queue commanded via HTTP or DNS (typically - to look legit; however, other protocols also exist). TLS for end-to-end encryption so NIDSs and such won’t flag packets based on the payload or strange TCP/IP streams in general; e.g., the aggregated payload data of sequenced packets and/or unusual data in the headers of each individually or aggregated [signifying data like magic bytes or configuration of TCP flags to distinguish C2 related traffic from the rest]. It’ll be pretty dynamic. For instance, the colour scheme (and theme in general), among other settings, can be overloaded with a YAML config file. Also modules/payloads are grouped and ranked according to things like cleverness, portability, etc. They're listed in an ASCII-drawn table noting those attributes. Just a few things. Not going over everything.
I may even mix this and the rootkit to develop a more powerful C2 where itself and the rootkit are either entirely codependent or, more likely, independent with a compatibility layer in the rootkit that provides an interface (abstracting Local IPC) with which it (the rootkit) and the C2 can interact to combine functionality both automatically (dynamically event-driven and such) as well as in response to defined commands issued through the rootkit's interface to further aid in fulfilling each others' individual purposes (which have a strong overlap on a subset of their given functions).
Both are well into development; I'm not just rambling. In any case, if there are any decent individuals out there, give me a shout.
EDIT: I actually got a PM because someone was interested in the fact I'm acquainted with Prolog. I thought I may as well quote this set theory math challenge I did in Prolog a while back (also incorporated asymptotic computational complexity theory and other math).
So, I’ve had quite a lot of offers, three of which seemed worthwhile. One PM’d me twice and then dropped off after my second reply (hasn't responded for a while despite being online/active), another hit me up on XMPP but haven’t heard anything since, the other being on-site and the only one I’ve taken up: Sui Generis (cheers Tyler).
Due to this, I may just spin something up of my own off-site (while still being a part of Sui Generis).
PM me if you meet the requirements. I’d appreciate it if you don’t PM me otherwise, as I do not want my time wasted. A degree in Computer Science or equivalent would be much preferred. If you cheated your way through university, and therefore cannot prove yourself; again, please don’t waste my time.
Please note this is not about bragging; I'm seriously looking for some cool individuals to hang with.
Also note that I'm not necessarily suggesting that I'm forming the crew and inviting others in. I'm either looking for an existing crew or forming one.
As can be observed on my profile, I've been here since February '09. I've seen a lot of groups/crews but nothing of immediate interest. I haven't frequented these forums in quite some time due to the lack of intriguing content. However, I'll be on to scout for anything of interest for the next couple weeks to see if there's anything interesting to reply to and to check for responses to this thread; for the past couple years or so, mostly I come online just to answer others' enquiries through random threads and received PMs.
Requirements
- No skids.
- Proficiency in at least one area per person related to hacking (but preferably several areas each) with a continued curiosity/development in general.
- A degree in Computer Science or equivalent would be much preferred.
My own experience and knowledge can be observed in my threads and posts. However, I will demonstrate some of my experience below.
Introduction
I have a degree in computer science (among others) and have since been working as a security consultant/penetration tester. I majored in digital systems security and finished with a distinction. I was also invited/added to an honours society for being (anywhere) within the top 15% of computer science studies in the state. I have a fair amount of programming and general computer science and security experience.
From a testing standpoint, I have decent experience with web-apps, web services (e.g., APIs), mobile-apps, internal/external infrastructures, wireless, VoIP (e.g., RTP/SIP/H.323 attacks, VLAN hopping, eavesdropping, spoofing, etc.), cloud and virtualisation, social engineering, source code review, etc. Also more specialised testing such as reverse engineering, cryptanalysis and general cryptography/cryptanalysis knowledge, (zero-day) exploit development (of various layers), red-teaming, etc. Note that this is not an exhaustive list.
Examples of programming experience
Within the past few years, I have demonstrated fluency in the following programming languages:
- Assembly (x86/x86-64)
- C
- C++
- Java
- Fortran
- Lisp
- Prolog
- Haskell
- Ruby
- Python
- PHP
- JavaScript
- XML (including XQuery and XPath)
- HTML
- CSS
Note that this is not exhaustive; I have worked in many other languages. This is simply what I've worked with during the past few years. I have been programming for a very long time.
I am also very familiar with the following programming paradigms:
- Imperative
- Object-oriented
- Declarative: functional and logic
- Literate
I have no problem proving that I am fluent in any of the above (or otherwise).
I'm pedantic when it comes to the quality of code and have worked on plenty of complex projects - hacking/security-related and otherwise.
I will mention a few projects, challenges, etc., I've involved myself in to demonstrate knowledge/experience.
- Currently working through set 5/8 of Matasano's cryptography challenges (now NCC Group). Let me know if you want to see some code.
- GNU/Linux rootkit (see below for more info). Let me know if you want to see some code.
- Participate in modern binary exploitation labs/challenges such as RPISEC MBE, STS, OTW, etc.
- Developed a PHP shell back in 2011 which bypassed Suhosin-protected environments among other (unique) features (and was better than Fuhosin).
Note that this is not a fork of Jynx2/Azazel/Umbreon or otherwise, as they're, quite frankly, are awful and the developer's know nothing about C.
I know the developers. They're admittedly not good at working at such a low-level and programming in general (at least at the time). Sue me.
I am also developing a fully-weaponised Linux C2 / post-exploitation agent (Listeners, Stagers, Modules, etc.), as there are already many dedicated to Windows (however, I'll incorporate functionality to allow for Windows targets down the track). It will be, as it's name suggests (redacted), very focused on being weaponised while efficiently evading IPS/IDS/AV/etc., incorporating malware-evasive techniques, and tunnelling connections and transactions non-suspiciously in a seemingly-legitimate fashion. It will have some neat features such as in-memory ELF binary execution to prevent touching disk and other types of way of executing native code (perhaps equivalent things to process hollowing and doppleganging on Windows). It has an adjustable beacon interval, which can also be randomised each time to seem like requests are even more legitimate, for each target among other things, so infected clients will check the C2 server every so often for tasks in the queue commanded via HTTP or DNS (typically - to look legit; however, other protocols also exist). TLS for end-to-end encryption so NIDSs and such won’t flag packets based on the payload or strange TCP/IP streams in general; e.g., the aggregated payload data of sequenced packets and/or unusual data in the headers of each individually or aggregated [signifying data like magic bytes or configuration of TCP flags to distinguish C2 related traffic from the rest]. It’ll be pretty dynamic. For instance, the colour scheme (and theme in general), among other settings, can be overloaded with a YAML config file. Also modules/payloads are grouped and ranked according to things like cleverness, portability, etc. They're listed in an ASCII-drawn table noting those attributes. Just a few things. Not going over everything.
PHP Code
<?php
...
drwxr-xr-x 5 phizo staff 160 4 Feb 10:09 Clever
drwxr-xr-x 4 phizo staff 128 4 Feb 10:09 Common
drwxr-xr-x 3 phizo staff 96 4 Feb 10:09 Common (Easily Identified)
drwxr-xr-x 4 phizo staff 128 4 Feb 10:09 Less Common
...
I may even mix this and the rootkit to develop a more powerful C2 where itself and the rootkit are either entirely codependent or, more likely, independent with a compatibility layer in the rootkit that provides an interface (abstracting Local IPC) with which it (the rootkit) and the C2 can interact to combine functionality both automatically (dynamically event-driven and such) as well as in response to defined commands issued through the rootkit's interface to further aid in fulfilling each others' individual purposes (which have a strong overlap on a subset of their given functions).
Both are well into development; I'm not just rambling. In any case, if there are any decent individuals out there, give me a shout.
EDIT: I actually got a PM because someone was interested in the fact I'm acquainted with Prolog. I thought I may as well quote this set theory math challenge I did in Prolog a while back (also incorporated asymptotic computational complexity theory and other math).
(Nov 8, 2016 02:27 PM)Phizo Wrote: 2 ez tbh imo etc et al. :\
I decided to solve it mostly using first-order predicate calculus, computationally in Prolog, which I did follow up with some handwork.
Here is an illustration of the program that computes all solutions in P([0, 5]), where P is a function which maps a given set into a powerset (the set of all subsets):
PHP Code
<?php
| ?- [n0sya].
compiling /private/tmp/n0sya.pl for byte code...
/private/tmp/n0sya.pl compiled, 21 lines read - 3838 bytes written, 6 ms
(1 ms) yes
| ?- make_list(0, 5, L), maplist(go, L).
Reduced powerset: [[0],[]]
Number of subsets: 2
Reduced powerset: [[0,1],[1],[],[0]]
Number of subsets: 4
Reduced powerset: [[1,2],[2],[],[1],[0],[0,1]]
Number of subsets: 6
Reduced powerset: [[2,3],[3],[],[2],[1],[1,2],[0,3],[0],[0,1]]
Number of subsets: 9
Reduced powerset: [[3,4],[4],[],[3],[2],[2,3],[1,4],[1],[1,2],[0,3,4],[0,4],[0],[0,3],[0,1,4],[0,1]]
Number of subsets: 15
Reduced powerset: [[4,5],[5],[],[4],[3],[3,4],[2,5],[2],[2,3],[1,4,5],[1,5],[1],[1,4],[1,2,5],[1,2],[0,4,5],[0,5],[0],[0,4],[0,3],[0,3,4],[0,1,4,5],[0,1,5],[0,1],[0,1,4]]
Number of subsets: 25
It can solve for:As you may notice, an increment in set cardinality causes an increase in computational time by a factor of ~2.09 on average, which can be represented functionally by t(f(n+k)) = t(f(n)) 2.09^k, where t is a function that measures computational time and f = go (my top-level Prolog predicate).
- [0, 10] in ~7ms.
- [0, 15] in ~179ms
- [0, 20] in ~6 seconds
- [0, 21] in ~12 seconds
- [0, 22] in ~24 seconds
- [0, 24] in ~1.9 minutes
- [0, 25] in ~3.47 minutes
- [0, 26] in ~6.8 minutes
That is, the running time is O(2^n) (exponential with a linear exponent), which is fairly inefficient. Note that Prolog (and logic programming in general) is not concerned with runtime efficiency: the declarative paradigm promotes theorem-proving, and consequently program correctness, to programmers and proof procedures, which are often computationally expensive.
As it is such a computationally complex problem, I cannot practically compute the solution for the set [0, 31], as it will take t(f(31)) ~ t(f(26)) 2.09^5 = ~4.5 hours.
So, I will compute the rest of the solution by hand. :)
Allow P to represent the powerset and f = go (my top-level Prolog predicate). I analyse f with the intent of finding a pattern such that I can conceptually derive solutions for any x in f(x).
I worked backwards in order to determine a pattern and define the necessary base conditions. I layed out f(x) = y such that 0 <= x <= 11.
Quite clearly, f is akin to the Fibonacci function, but with a seperate rule for odd numbers in its domain.
- n is even => f(n) = f(n-1) + f(n-2)
- n is odd => f(n) = f(n-1) + f(n-3) + f(n-4)
Codef(0) = 2 = f(-1) + f(-1)
f(1) = 4 = f(0) + f(-1) + (f-1)
f(2) = 6 = f(1) + f(0)
f(3) = 9 = f(2) + f(0) + f(-1)
f(4) = 15 = f(3) + f(2)
f(5) = 25 = f(4) + f(2) + f(1)
f(6) = 40 = f(5) + f(4)
f(7) = 64 = f(6) + f(4) + f(3)
f(8) = 104 = f(7) + f(6)
f(9) = 169 = f(8) + f(6) + f(5)
f(10) = 273 = f(9) + f(8)
f(11) = 441 = f(10) + f(8) + f(7)
These are the base cases I subsequently defined:
CodeP({}) = {{}}
f(-1) = 1 = |P({})|
The time has come. What is f(31)? A Husaid would never fugg know a thing of this. :/ jaz0r 🤭
Codef(31) = f(30) + f(28) + f(27)
= [f(29) + f(28)] + [f(27) + f(26)] + [f(26) + f(24) + f(23)]
= [f(29) + f(28)] + [f(27) + 602070] + [602070 + 229970 + 142129]
= [f(29) + f(28)] + [974169 + 602070] + 974169
= [f(29) + 1576239] + 1576239 + 974169
= [[f(28) + f(26) + f(25)] + 1576239] + 1576239 + 974169
= [[1576239 + 602070 + 372100] + 1576239] + 1576239 + 974169
= 6677056
Hence, f(31) = 6677056. That'll be $10. Cheers and thanks.
![[Image: 8Yoto.png]](https://i.imgur.com/8Yoto.png)





![[Image: x4h-RUeb.png]](https://i.postimg.cc/8Pcz45DN/x4h-RUeb.png)