@Arohn nvm got it (:

@Carl Love Okay, now I get at least a List of numbers again. But my decryption doesn't work...

Gives now:

That's not what it should be :D

As above it should be:

[676, 645, 144, 3]

Do you see my fault in the code? :/

@Carl Love Thanks :)

@Carl Love 

Hey,  sry for not answering yet.

I thought i tested it, anyhow it's kinda solved, I dunno why it didnt worked :D

My Numbergeneration can be found here:

http://www.mapleprimes.com/questions/203622-Programmin-WuSuns-Schema-A-With-Maple-

Last post.

and added:

m:=(p-1)(q-1);
d:=1/e mod m;

in the proc. It didnt work.

When i seperated the number generaten from the proc itself, it worked...

@Carl Love 

I have build an algorithm offering both keys. As b is converted from a string into a integer, its secure that b < N.

One Example:

(e,N)=

(936958546052546720994676035027866908506937381799387375976406394241729909875321375527532529689307978715802054823455718287890664258063218947803100282581988647210706687303059,

1244988400326321282453693968180866035177110154862761249189675590486051705243749319046979171936555478223218017959195420768620699997027566533232650440982711067109811193829887368799167910034625358460851767374577540944789613555386666000727959152251118531670996763065052321705131835555659951209739725987891938870531)

(d,p,q)=

(1480921939698819445352199294240127867658493424057,

45476932108826038899311113424202997589763158292696151647962658962196195702553791359691537532113299203154465029751974517227794859596984994419853250566230713,

27376261823182600540561938066006871336192772114515116133942251294714334449671835264782468057545169957740457604726745885619774962640202550861523544664434587)

or with pictures:

(e,N)=

(d,p,q)=

As a test i just tried it with b=5. But it didnt work:

c := `mod`(`&^`(5, e), N)=
6213307404240764999451814886228523351248153574462473008126622053\
  53797753596754919066981898398910246624142671745010125532503714\
  84952148289854776350416229243490759948060645547014766496072115\
  91004669555276636916526063970062829427755607094950842278735432\
  9130717289544862064078455320049178579741727888754886522968

`mod`(`&^`(c, d), N);
1615444487482772582125417127933815170624914652085919169850570507\
  25074065888287426029594846010517919325952332111005643909712485\
  38254567599528306135658215579132038195361193629824334924236279\
  32351501830232749492820582782364325039314460213101988946290686\
  40733814762562314501018228983045021213777209291822266598751

and the last number obviously isn't 5 :(

@Kitonum 

Thanks, but thats the way I already do it :D

I thought theres a function doing this like the time()-Function (:

@Carl Love 

Actually i kinda finished it with the help of my professor. The actual Algorithm looks like this:

Sry for the German Comments in The code :)

It works and is pretty fast, but thanks for ur help!