Name: Anonymous 2017-07-29 17:56
https://pastebin.com/qprgVAmc
(couldn't post it here)
(couldn't post it here)
Nice line feed, nerd.printf("Hello World");
~ $ gcc nigger.c
nigger.c:1:1: warning: return type defaults to ‘int’ [-Wimplicit-int]
main(){write(1,"Hello world\n",12);}
^~~~
nigger.c: In function ‘main’:
nigger.c:1:8: warning: implicit declaration of function ‘write’ [-Wimplicit-function-declaration]
main(){write(1,"Hello world\n",12);}
^~~~~
~ $ nig() { ./a.out; echo "Exit code: $?" }
~ $ nig
Hello world
Exit code: 0
~ $ tcc nigger.c
nigger.c:1: warning: implicit declaration of function 'write'
~ $ nig
Hello world
Exit code: 12
~ $ clang nigger.c
nigger.c:1:1: warning: type specifier missing, defaults to 'int'
[-Wimplicit-int]
main(){write(1,"Hello world\n",12);}
^
nigger.c:1:8: warning: implicit declaration of function 'write' is invalid in
C99 [-Wimplicit-function-declaration]
main(){write(1,"Hello world\n",12);}
^
2 warnings generated.
~ $ nig
Hello world
Exit code: 0 #include"void2/boilerpl
at e.h"
# includ
e " void2/
t y p edefs.
h " #in c lude" void2/ti
m in g . h"/ /t sc()#inc
l u de "v o id2/ra nd o m.h"//ts
# i nc l ude"vo id2 /macro.h"
/ / t#i n clude<std lib. h>#include
< stdi o. h >#defineR N AME _MAX253#
d ef i ne is vo wel(x)((x == 'a')||(x=='e'
) || ( x== 'i' ) ||(x=='o') ||( x=='u'))#def
in er nd num 1() ( {u64timesee d=t s c();tim
e se ed =rhas h(( u 8*)×eed,8);timeseed;})
#d e f inerndco n()c ons[ rndnum1()%2 1]#defi nerndvo
w( ) vo w s[ rndnum 1()%5]STDS T ARTsize_tna melen ,i=0;con
st c 8 alp[]="abcdefghijklmno pqrstuvwxyz" ;//2 6constc8co
n s [ ] ="bcdfghjklmnpqrstvwxyz";//21constc 8vo ws[]= "ae
io u " ; //5if(argc>1){namelen =(size_t)strtoull(ar gv[1],
NULL, 1 0 ) ;if(namelen >RNAME_MAX| |namelen<1)g otoerr n a m
elen ;} e l se{errnamelen:;puts("Syn tax:namegenlength length:fr
om0t o" s tr ingify(RNAME_MAX));e xit(1);};c8res[RN AM E_M AX+1]=
{0}; w hil e(i<na mel en){size_ tr emain=(namele n-i );bo olla
stvo w= 0 ; if(i>1){l ast vow=isv o wel(res[i-1]);}if (remain==
1){re s [ i++ ]=last vo w?rndco n():rndvow();continue;}if(
remai n= =2){ res[i ++]= lastvo w?r ndcon(): r nd vow( );
res[i++ ]= last vow? rn dvow () : rndcon();continue;
}if(rema i n= =3 ){ / / vcv /c v cres[i++]=lastvow?r
ndcon():rn dv ow ();res [i + +]=lastvow?rndvow():rndco
n();res[ i++]=lastvow?rndco n ():rndvow();continue;}//vc,cv
,vcc,cvc,v cv,vvc,ccvswitch( tsc()&7){cas e0://vcr es[i++]
=rndvow(); r es[i++]= rndcon(); break;case1:/
/cvres[i++ ] =rndcon() ;res[i++]=r ndvow ();brea
k;case2://vcc re s[i++] = rndvow ();res[i++]=
rndcon() ;r es[ i + + ]= rndc on();b
reak;case3 : // ccv res [i++]=rndco
n(); r es[i ++] =rndcon ();
res[i ++]=r nd vow();break;
case4 ://v c vres[ i++]=rndvow(
);res[i ++] =rn dcon();res[i
++]=rndvow ( ) ;break;case5:
//vvcr es[i ++]=rndvow();r
es[i ++ ]=r n dvow();res[i+
+]=rndcon() ; break;case6://
cvc de fault ://cvcres[i ++]=r
ndcon();res[i+ +]= r ndvow();res[i++]=rn
dcon();}}puts(re s);STDEND#inc lude"v
oid2/boilerplate.h"# i nclude"void2/typedefs.h"
#inc lude"void2/timing. h"//tsc()#include"vo id2/ra
ndom.h"//ts#include"void2/m acr o.h"//t#include<stdlib.h>#incl
ude<stdio.h>#defineRNAME_MAX253#def ineisvowel(x)((x=='a')||(x
=='e' ) ||(x=='i')|| ( x=='o')||(x=='u'))#defi
nerndnum1()({u64ti meseed= ts c ();times eed=rhash((u8*)×ee
d,8);timeseed;})#d e f i nerndcon()cons[rndnum1(
)%21]#defi nerndvow () v o ws[rndnum1()%5]STDSTART
size_tnamelen,i=0;c o n s t c8 alp[]="ab cdefghijklmno
pqrstuvwxyz"; //26 c o n s t c8con s[] ="bcdfghjklmnpq
rstvwxyz";//21 c o nstc 8 v o ws []= "aeiou";//5if(argc>1
){namelen=(size_t) strtoul l(argv[1],NUL L,10 );if(namelen>R N
AME_MAX||namelen<1) g otoerrnamelen;}els e{errna me len:;puts
("Sy ntax:n ame genlengthlength :from0to"s tr ingif
y( RN AME_MAX ) ) ; exit(1);};c 8res
[ RNAME_M AX+1]={0};while(i<namelen){siz e_tr
e main=( namelen-i);boollastvow=0; if(i > 1 ) { l
as tvow=i svowel(res[i-1]);}if(rema in==1){ r e s[i++
]= lastvow ?rndcon():rndvow();continue;}if(rem a in==2
){ res[i ++]=lastvow?rndcon():rndvow() ;res [ i++] =
las tvow? rndvow():rndcon();continue;}if(re ma in==3){/
/ v cv/cvc res[i++]=lastvow?rndcon():rndvow ( );res[i
++]= lastvo w?rndvow():rndcon();res[i++]=l astvow?r
ndcon ( ):rndvo w();contin u e;}//vc,cv, vcc , cvc,vcv,vv
c,ccvs witch(ts c()&7){ca s e0: //vcres[i++] =rndvow();
res[i++ ] =rndcon() ;br eak ;case1://cvres[ i ++]=rndcon(
);r es[i + +]= rndvow();br eak ; case2://vccre s [i++]=rndvow(
);res[i++] = rnd c on (); r e s [i+ + ]= rndc on();break;case
3://ccvres [ i++] =r ndc o n ( );re s [i+ + ]=rndcon();res[i+
+]= rndvow ( );break;case4://vcvres[i++]=rndv ow();res[i++]=rnd
con();res[i+ + ]=rndvow();break;case5://vvcre s[i++]=rndvow();res
[i++]=rndvow() ; res [i+ +] =rndcon();break;case
6://cvcdefault:/ / c vcres[i++]=rndcon();r
es[i++]=rndvow(); re s [ i++]=rndcon();}}puts(re
s);STDEND#include"v o i d 2/boilerplate.h"#include
"v oid2/typedefs.h"#i n c lude"void2/timing.h"//tsc()
# include"void2/random. h " // ts#include"void2/macro.h
"//t#include<stdlib.h>#i n clude< stdio.h>#defineRNAME_MAX253#d
efineisvowel(x)((x=='a')|| ( x== 'e' )||(x=='i')||(x=='o')||(x=='u'))
#definerndnum1()({u64timese ed=tsc();ti meseed=rhash( (u8*)×eed,8);timeseed;})#defi
nerndcon()cons[rnd num1()%21] #def iner nd vow( )vow s[r ndnum1()%5]STDSTARTsize_tnamelen,i=
0;constc8alp[]="abcdefghijklmn opq rstu vwxy z"; //26constc8 cons[]="bcdfgh jklm npqr st vwxyz ";/
/21constc8vows[]="aeiou";//5if(ar gc>1){ nam elen=(size_t)strtoull(argv[1],NULL,10);
if(namelen> RNAME_MAX||namelen<1)go toe r rnamelen;}else{errnamelen:;puts("Syntax :
namegenlengthlength:from0to"stringify( RNA M E_MAX));exit(1);};c8res[RNAME_MAX+1] ={0}; I'm reminded of Mentifex as well when I see these kinds of projects. I'm positive they're all very right wingSeems like you don't really know Mentifex then.
Democracy? Hillary Won the Popular Votementifex cracks me up
Trump for Registered Sex Offender
4.bitArray is mutated and encrypted.what does it mean? how is it encrypted?
No. The difficulty is that Input doesn't result in same output and output is 90% random garbage filler data.so it's a probabilistic cipher? that's not enough for it to be secure.
if you encrypt the array with AESCrypteria11 doesn't depend on anything but standard headers.
#pragmaonce //Cr
yp teria12stegocipherhe a d e rb yFr
o ze nVoidlicensedunderhttps://www.g n u.org/lice
ns e s/agpl.html/*Generalencrypti onp rocess1.passwo r
disconv ertedtosecretkey(withconstsal t)2.anarray64tim
eslarge r thaninputisseededwithrandomdata3 .inputbitsareset t
oarraybits,withgapsbetweeninputbitsderivedfrom 1+xorshift()&63[1-64
gaplength]4.arrayisrotatedas64bitints,usingrota tedatafromxorshift()&
635.3passesofdifferentlyseededxorshift()areappliedtoresultwithxor,add,sub
stractasreversibleoperations.6.D ecryptionrunsthe2-5stagesin reverse.note:t h
ealgorithmisnamedaf terKr ypteria(thesymphonicmetalband)no tCrypteria(me
ta lba nd).*/#include<stdint.h>//intsizes#include<stdlib.h >//malloc#i
nclude< stdio.h>//fopen,fread,fwrite,sprintf,perror#include< string.h>/
/strle n#include<x86intrin.h>//__rdtsc()#include<inttypes. h>staticuin
t64_txorseed[2];staticconstuint64_tsalt=0x1234567887654321UL L ;//e achimplemen
t ationcanuseauniquesalt(changesalgo)//PartialDecryptionSTREN GTH(changesalgo:f
orm1<<N)#defineCRYPTERIA_PD_STRENGTH(1<<12)//amountofprecomputedxorshiftsstaticuin
t64_trhash(uint8_t*input,size_tlen){uint64_tseed[2]={0x1234567887654321ULL,0x23456
78876543211ULL};uint64_trnds1,rnds0,result=0;uint64_t*data=(uint64_t*)input;for(siz
e _ti=0;i<(len/8);i++){rnds0=seed[0]^data[i];rnds1=seed[1];result=rnds0+rnds1;rnds1^
=rnds0;//rotl(rnds0,55)see d[0]=((rnds 0<<55)| (rnds0>>(64-55)))^rnds1^(rnds1<<14);/
/rotl(rnds1,36)seed[1]=((rn ds1<<36)|(r nds1>>( 64-36)));}for(size_ti=(len/8)<<3;i<
len;i++){rnds0=seed[0]^(( uint64_t)i np ut[i ]<<(8*(i&7)));rnds1=seed[1];result
=rnds0+rnds1;rnds1^=rnds0;//r otl(rnds0, 55)seed[0]=((rnds0<<55)|(rnds0>>(64-55)))^rnd
s1^(rnds1<<14);//rotl(rnds 1,36)seed[ 1] =((rnds 1<<36)|(rnds1>>(64-36)));}constc
harrsalt[]="Crypteriaisas tro n gstego-ci p h erbase donclassicideasofConfusionandDi
ffusionbyClaudeShannon";uint64 _ t*salt8=(u i nt64_t*) &rsalt;for(size_ti=0;i<(sizeof(
rsalt)/8);i++){rnds0=seed[0]^ salt8 [i];rnds1 =seed[1] ; result=rnds0+rnds1;rnds1^=rnd
s0;seed[0]=((rnds0<<55)|(rnd s0> >(64-55 ) ))^rnds 1 ^(rnds1<<14);seed[1]=((rnds1<<
36)|(rnds1>>(64-36)));}result =see d[0] +s eed[1 ];returnresult;}staticuint64_
trhash64(uint64_txseed){uint6 4_ tt=x s ee d; r e turnrhash(( uint8_t*)&t,8);}s
taticinlineuint6 4_trotl(con st u i n t64_tx,i ntk){return(x<< k)
|(x>>(64-k));}st aticinline vo ids etxorsee d(uint64_ta,uint64
_tb){xorseed[0]= rhash64(rhash 6 4 ( a ));xor seed[1]=rhash64(r
hash64(b));}sta ticinlineuint6 4_txoro s hiro128plus(void
){//Source:xorosh iro.di.unimi.i t /xo roshiro 128plus.cconstu
int64_ts0=xorsee d[0];uint64_ts1 =xorseed [1] ;constuint64_tre
sult=s0+s1;s1^=s0 ;xorseed[0]=rot l( s 0 ,5 5)^s1^(s1<<14);
xorseed[1]=rotl (s1,36);returnres ul t ;}//sec retkeyfrompassw
ord(maxusefulchars:16)typedefun i o n Pwse ed{ uint64_ts[2];ch
artext[16];}pw seed;staticpws eeds e cr et;stat ic in lineuint64_
tclearbit(uint6 4_tv,uint8_t loc ) { retu rn v&(~(1ULL<<l o
c));}staticinlin euint64_tset b it(u int64 _ tv,u int8_tloc ,
uint64_tbit){r eturnv|((bit <<loc) );}st a t i cin lineuin
t64_tgetbit6 4(uint64_tv, uint8_tl o c){r et u rn(v&((1
ULL<<loc )))>>loc;}stat icin line u in t6 4 _tgetbit
8(uint8_t v, uint8_tloc){ ret u rn( v&(( 1 < <loc)))>>loc;}staticin
linevoidse tsecre t(pws e ed* ssecret,c ha r*p ass,uin t
6 4_t pwlen ){ss ecr e t-> s[ 0] = rhash 6
4(r hash64(sa lt+ rha sh((uint8_t*)pass,pwl e n ) ))
; ss e cret - >s[1 ]=rhash 6 4 ( sa
lt^(~ rhas h64(s secret-> s[ 0 ] ))) ; } //== ===
= = ==== = = ===+++++ENC RY P T ++ + +=== = = === ====== =/* en
cry pt I nput :data ,pa s sword ,d ata length,pas swo rd len gth Outp ut:
re turn edencryptedarray, re sul t size ispas sed to data _ l enpo int e r .* ///
xorvec to rfo r d i f fused bit l oca tio nsstaticu i nt8 _ t xo r dat
a[CRY P TE RIA _PD_ST RE NGTH ];/ /xo rv e ct orf orr eversi bl
etransfo rms sta t ic ui nt 64 _txorda t a2[CRY PTE RIA_ PD _ST
RE NGTH ] ;// = = = == = === = === SE TXO
R S HIFT ARR A YS s t a t icin li ne
v oid s etx ordat a( v oi d) {f o r( siz e_ ti= 0;i <C
RY P T E R IA_PD_S TRE NG T H;i+ +){ x o rda ta [
CR Y P TER I A_ P D_S TRENGT H- i- 1] =1 +(( xo ros
hi ro1 2 8 plus( ) >> 3)&6 3);}} st at ici n
li nevo idse tx ordata 2 (vo id) { / / f orcedr a ndo
ms k ips iz e_tskip=(s ecr e t. s [ 0] &(C R Y
P TE RI A _ PD_ S T RENGTH- 1 )) ^ ((
se c r et.s [ 1] >> 16 ) &(C RYP TERIA _P D_ S T
REN G TH- 1) ) ;for ( si z e_ ti= 0 ;i
<s ki p;i++){x or o sh iro12 8
pl us(); }for ( size _ti =0 ;i <CRY PT E
RIA _PD_STRENGTH ;i + + ){ xor data 2[CR Y PTERI A _
PD_ STR EN GT H-i- 1] = x or o sh i ro 128 p
lu s (); }}// de pend s onCR Y PT ER IA
_PD_ST RE NG T H b e i ng1< < nst a t
icinli ne uin t 8_ tg e t ga pv al (s
ize_ tdistan ce ) {s ize_t ga p
=( d i sta nce& (C RYP T ER I A_PD_ST RE NGT
H- 1));if(gap ==0) {se tx o rda ta ( );} ;r
e tu r nx or da t a[gap];}st a
ti cinli neu i nt 6 4 _tgetxo r v a
l( s ize _t d i s tance){si z e_t
p la c e =( d i s tance& (CRYP
TER I A_PD_S TR E N GT H - 1 )
) ;if (pl a ce= =0
) { set x o r
da ta 2 (); } ; re
tur nx o r d at
a 2[p l a ce
] ;} // = ==
=== === == = = =++
#!/usr/bin/env python3
import sys
from pathlib import Path
if len(sys.argv) < 3:
sys.exit("Usage: anus.py SHAPE TEXT")
row = []
shape = [row]
for c in Path(sys.argv[1]).read_text():
if c == '\n':
row = []
shape.append(row)
else:
row.append(c != ' ')
stack = list(Path(sys.argv[2]).read_text()[::-1])
def fuck():
c = '='
while len(stack) > 0:
tmp = stack.pop()
if not tmp.isspace():
c = tmp
break
return c
for row in shape:
ln = []
for v in row:
ln.append(fuck() if v else ' ')
print(''.join(ln))
GNU GENERAL PUBLIC LICENSEBut what if I wanted to add this code to my ENTERPRISE app?
range in py3 is the same as xrange in py2. py3 removed the eager version and removed the lazy one:
In [1]: r = range(0,10)
In [2]: r
Out[2]: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
In [3]: x = xrange(0,10)
In [4]: x
Out[4]: xrange(10)
In [5]: list(x)
Out[5]: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
[1]: r = range(10)
In [2]: r
Out[2]: range(0, 10)
In [3]: list(r)
Out[3]: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
py3 removed the eager version and renamed the lazy one:if that's the case, then executing the following:
for i in range(0,100000000000):
continue;
for i in xrange(0,100000000000):
continue;
range object is possible, just like creating an xrange in py2 and unlike range in py2:In [1]: range(0,100000000000)
---------------------------------------------------------------------------
MemoryError Traceback (most recent call last)
<ipython-input-1-ea3b586c469a> in <module>()
----> 1 range(0,100000000000)
MemoryError:
In [2]: xrange(0,100000000000)
Out[2]: xrange(100000000000)
In [1]: range(0,100000000000)
Out[1]: range(0, 100000000000)
I never actually cryptoanalyzed it, i'm not into that.Then you'd know you shouldn't roll your own crypto.