Forums

Big-Endian & Little-Endian.

General discussion about Cobra. Releases and general news will also be posted here.
Feel free to ask questions or just say "Hello".

Big-Endian & Little-Endian.

Postby mydia » Sat May 28, 2016 2:18 am

So I've been working on trying to figure out why a 180 angle is a straight line.

I found many expressions from this. This is what I found...can Cobra language do this?

this is the data it was formed by: http://mydiaxd.wix.com/corrora#!cairo/dkcm4


BIG-ENDIAN = PIE/PIC
0A0B0C0D = 32 bit
a: 0A
a + 1: 0B
a + 2: 0C
a + 3: 0D

0A0B0C0D = 32 bit
A: a + 3 = 0A;
B: a + 2 = 0B;
C: a + 1 = 0C;
D: a = 0D;

16 x 2 = 32 bit;
+, -, /, *, % = /> 8;
index = %;
im = *;
rel = +;
defin = var % = x
reg = -;

ref - 1 = counter; dll.exe = /0;
Vista + 1 = ref - 1 = counter; dll.dll = /0;

dll.exe = dll.dll = y; "OS/2";
0x = PIE /= PIC;
x = PIE;
"return-to-libc" attack: [big endian] = 0x00;
0x01010100 = double negative; strcpy(); /= 0/
16MB < 0; = death; return-to-plt; Procedure Linking Table; system@plt, execve@plt, sprintf@plt, strcpy@plt,

"Address space layout randomization: (ASLR); S = log(2)2^N = N = 2; (entropy: information theory);
I(p) ≥ 0 – information is a non-negative quantity
I(1) = 0 – events that always occur do not communicate information
I(p1 p2) = I(p1) + I(p2) – information due to independent events is additive
derivitive: {I}(p) = log(1/p)

ASLR <= 64bit;
ASLR <= 32; death;

Stack Buffer Overflow:
structure; void; buffer <= 32;
(C, strcpy(); #include <string.h>

void foo (char *bar)
{
char c[12];

strcpy(c, bar); // no bounds checking
}

int main (int argc, char **argv)
{
foo(argv[1]);
})

Big Endian: https://www.cs.umd.edu/class/sum2003/cm ... ndian.html
Address :: 90; (right triangle)
1001 :: AB;
1002 :: 12; 36x / 12 / 12;
1003 :: CD;

In little endian, you store the least significant byte in the smallest address. Here's how it would look:

1000 :: CD;
1001 :: 12; 36x / 12 / 12
1002 :: AB;
1003 :: 90 *right tringle pointer; (C language only strcpy() kthx; c++ is "=" doesn't work;

Little Endian is counter because :: it reads the buffer of a youtube video first, and uses much less memory the trick is to read little memory then use BIG-ENDIAN to build the data via HASH; MD5; LITTLE-ENDIAN;

register = '+', char = string = + operator; < 32 bit;

a + 1; a + 2; a + 3 .. =; (b)31; .. (b)0 = /0 = null;

endianess = a + 1 = a + 3 .. consecutively;

C-Style Strings:

byte = e.g. b31- 24 = 30 - 6; storing in last of 6; 31 = 30 from 0; 24 = 23 from 0; array starts from 0 not 1;

&& array[i] < & array[i + 1]; notible;
when writing to file and reading hash :: BIG-ENDIAN;
cat = 1000;
'a' = char; character !string; strcat(); store as int or long for embedded variable within string; not char;

write() to file: little-endian = counter = buffer = file to read hash from;
https://www.cs.umd.edu/class/sum2003/cm ... ndian.html


therefore ::: math string >> matrices >> hash >> random-num-generator >> SHA - 1, SHA - 2; SHA -256++; >> BIG-ENDIAN >> MD5 (as HASH-creator) >> programming-string = "any log that is inverse or is a variable within a programming string which is a math string that talks to a program in hash that gives the ability of set-instructions from a pointer that reads memory -> address -> value; to memory-address in SHA; then to counter = little - endian algorithm >> then output >> write(file, x, y, z = var_1(append:: read_buffer) = matrices of hash. reading the matrices of HASH and outputing the equivalent in hash which is above. you need to read as computer language.
mydia
 
Posts: 1

Return to Discussion

Who is online

Users browsing this forum: No registered users and 6 guests