flat assembler
Message board for the users of flat assembler.

Index > Projects and Ideas > I need a project to do...

Goto page 1, 2  Next
Author
Thread Post new topic Reply to topic
AlexP



Joined: 14 Nov 2007
Posts: 561
Location: Out the window. Yes, that one.
AlexP 11 Apr 2008, 21:02
Hey, I'm looking for a new project to do, any ideas? I just finished (testing now) my AES code, in the 'main' section of forum, and I need something to do... Here were my ideas, could someone please give me more?

1) Other algo's, like a fast RC6 or something as large as RSA.

2) A .asm file compressor, I was going to start researching on that, here is what it would actually do:

- Uses 8-bit as it's internal language, gives 255 dictionary possibilities and one escape code

- Layer 1 compresses common instructions like mov/add, statistics gained from a collection of hte largest FASM projects I could get my hands on

- Layer 2 compresses common english words like 'the', 'of', among many others. Statistics also gained the same way.

- Layer 3 compresses common english letters, maybe even the whole ASCII possibilities. (they wouldn't really be compressed due to the 8-bit internal size, but the 8-bit escape code followed by an 8-bit character was just too much)

As you can see, I was leaning towards my second idea for something to work on. Does anyone need help on anything at all? Or maybe you would like something done? (Please say it's another crypto algo!)

For now I'll go back to reading my RSA book... I did many little factoring and fun stuff, one day I hope to have an RSA code running Smile. Either that or a fast GNFS system that will run on multiple Win32 computers! Yeah, so any help or projects needed?!
Post 11 Apr 2008, 21:02
View user's profile Send private message Visit poster's website Reply with quote
revolution
When all else fails, read the source


Joined: 24 Aug 2004
Posts: 20363
Location: In your JS exploiting you and your system
revolution 11 Apr 2008, 22:17
Have you seen the RSA macros?
Post 11 Apr 2008, 22:17
View user's profile Send private message Visit poster's website Reply with quote
AlexP



Joined: 14 Nov 2007
Posts: 561
Location: Out the window. Yes, that one.
AlexP 11 Apr 2008, 23:00
I am not interested in the pre-processing code, I have had those for a while now, and love the way you did it Smile. My idea is for learning RSA, not as much as making a good implementation. I will study it (RSA and NT books, ect.) until I feel I am ready to start trying out primality techniques, powmod, mul, and others...

There are so many ways of approaching the cipher, so many trade-offs between code size, speed, specific processor optimizations, and soo many different algorithms to get the job done.. I will study it for as long as I can hold back and then I will jump in (starting with the most basic, slow method I can code, you know which one Smile.)

Unless someone else has a project they need help with, I'm going back to my math. I lost so much sleep over the AES code (the workings I posted were such a small fraction of the different implementations I made), my math teacher (idol of my life almost) has disliked my seemingly lazy-ass state of mind (actually, on the contrary of lazy...). I'll take a few months off and get back into math... It's amazing how hard it is to switch between real and abstract Smile. All for now, I'll make myself a little lesson plan for this project like always.
Post 11 Apr 2008, 23:00
View user's profile Send private message Visit poster's website Reply with quote
Remy Vincent



Joined: 16 Sep 2005
Posts: 155
Location: France
Remy Vincent 11 Apr 2008, 23:12
The main problem is that RSA and RC6 algorithm are so hard to debug that they are impossible to achieve in assembler with THE STEPS : compiling/running debugger , compiling/running debugger , compiling/running debugger , compiling/running debugger

what you need is an interpretor for RSA & RC6 algorithm.

The main problem is that if you use a USUAL INTERPRETED language, you are not programming in assembler and this is wierd...

that's why I am working programming an ASM INTERPRETOR. it is only 16BIT nowadays, but I keep trying to inprove it... thank you for your patience!
Post 11 Apr 2008, 23:12
View user's profile Send private message Visit poster's website Reply with quote
AlexP



Joined: 14 Nov 2007
Posts: 561
Location: Out the window. Yes, that one.
AlexP 12 Apr 2008, 00:01
Well, thanks for suggestions, but I will go along with RSA in x86. (would it be considered x87 because of SSE?). I usually need to learn what to do through experience, I always have crazy ideas that flop in the end Smile.

Thanks, and I will definitely look into interpreted Confused...

BTW: I've seen RSA in Java, it's TINYYYY and soo slowwww.... I love how simple it is though Smile. Here it is:

http://pajhome.org.uk/crypt/rsa/implementation.html

[edit] WHat do you think about what this guy said here:
Quote:
For example, you could time the gap between key strokes, in microseconds, and then take the lowest bit of this number. Techniques like this are random enough for cryptographic purposes.
Post 12 Apr 2008, 00:01
View user's profile Send private message Visit poster's website Reply with quote
bitRAKE



Joined: 21 Jul 2003
Posts: 4050
Location: vpcmpistri
bitRAKE 12 Apr 2008, 00:51
AlexP wrote:
Unless someone else has a project they need help with, I'm going back to my math.
Math? Very Happy I like to code solutions to http://projecteuler.net/ problems in x86 - it's great fun if you like math.

_________________
¯\(°_o)/¯ “languages are not safe - uses can be” Bjarne Stroustrup
Post 12 Apr 2008, 00:51
View user's profile Send private message Visit poster's website Reply with quote
AlexP



Joined: 14 Nov 2007
Posts: 561
Location: Out the window. Yes, that one.
AlexP 12 Apr 2008, 01:03
Smile #182 is RSA

I've seen those, I do love math, but I would like to do something a little more constuctive. I already have a nice little folder with a bunch of those in it...

[edit]: lol! "Quantum" performed more than a double-post in a nearby thread, he did a 9-post! Just a little thing I saw, that's funny
Post 12 Apr 2008, 01:03
View user's profile Send private message Visit poster's website Reply with quote
bitRAKE



Joined: 21 Jul 2003
Posts: 4050
Location: vpcmpistri
bitRAKE 12 Apr 2008, 03:47
Have you seen this compression?
http://cs.fit.edu/~mmahoney/compression/

_________________
¯\(°_o)/¯ “languages are not safe - uses can be” Bjarne Stroustrup
Post 12 Apr 2008, 03:47
View user's profile Send private message Visit poster's website Reply with quote
AlexP



Joined: 14 Nov 2007
Posts: 561
Location: Out the window. Yes, that one.
AlexP 12 Apr 2008, 04:42
Smile Thanks bitRAKE, if I do choose to do compression (I found a very nice site that lookes like that, here it is below:), I will definitely look at those sources. I have never done parsing before, but I think I'll stay on the crypto path at least a little longer.

http://www.fadden.com/techmisc/hdc/
Post 12 Apr 2008, 04:42
View user's profile Send private message Visit poster's website Reply with quote
bitRAKE



Joined: 21 Jul 2003
Posts: 4050
Location: vpcmpistri
bitRAKE 12 Apr 2008, 15:09
That link seems like a good intro to compression - the Apply IIgs was an awesome machine at the time (although I only programmed in BASIC and Logo on it).

Wiki explains much of PAQ.

_________________
¯\(°_o)/¯ “languages are not safe - uses can be” Bjarne Stroustrup
Post 12 Apr 2008, 15:09
View user's profile Send private message Visit poster's website Reply with quote
AlexP



Joined: 14 Nov 2007
Posts: 561
Location: Out the window. Yes, that one.
AlexP 12 Apr 2008, 15:39
Thanks, interesting that there are awards for compression
Post 12 Apr 2008, 15:39
View user's profile Send private message Visit poster's website Reply with quote
bitRAKE



Joined: 21 Jul 2003
Posts: 4050
Location: vpcmpistri
bitRAKE 12 Apr 2008, 15:56
The most important question (maybe the only question) of information theory is how much information is present in a communication, and compression tries to provide an actual answer (verses theoretical answers: entropy).

_________________
¯\(°_o)/¯ “languages are not safe - uses can be” Bjarne Stroustrup
Post 12 Apr 2008, 15:56
View user's profile Send private message Visit poster's website Reply with quote
AlexP



Joined: 14 Nov 2007
Posts: 561
Location: Out the window. Yes, that one.
AlexP 12 Apr 2008, 15:58
I've been reading some articles about the AI side of compression, that's some interesting stuff... I'm almost thinking about considering compresssion as my next project Smile
Post 12 Apr 2008, 15:58
View user's profile Send private message Visit poster's website Reply with quote
penang



Joined: 01 Oct 2004
Posts: 59
penang 04 May 2008, 10:55
This ain't compression or anything ... but about Fractals. Lots and lots and LOTS of repetitions, suitable for fasm.

The software is apophysis. New version of it is called flam3

It's open-source

The other day I was playing with it the renderer ate up all the 4GB of my RAM and crashed my system.

So I was going to look into the code, trying to find the thing that ate up humongous amount of RAM, and in the meantime, perhaps speed up the thing a bit with fasm.

Perhaps you may want to take a look into this ... for I don't have a lot of free time myself.

Just a suggestion.....
Post 04 May 2008, 10:55
View user's profile Send private message Reply with quote
bitRAKE



Joined: 21 Jul 2003
Posts: 4050
Location: vpcmpistri
bitRAKE 04 May 2008, 23:35
penang wrote:
The software is apophysis. New version of it is called flam3
At the forum there is a GPU accelerated version - which is perfect for this type of thing. Thanks for the eye candy - really cool stuff.

_________________
¯\(°_o)/¯ “languages are not safe - uses can be” Bjarne Stroustrup
Post 04 May 2008, 23:35
View user's profile Send private message Visit poster's website Reply with quote
penang



Joined: 01 Oct 2004
Posts: 59
penang 05 May 2008, 05:29
That GPU accelerated version is called flam4, yep, it ought to be exciting !

Unfortunately, I don't have Vista, so can't even test it out. Sad
Post 05 May 2008, 05:29
View user's profile Send private message Reply with quote
penang



Joined: 01 Oct 2004
Posts: 59
penang 05 May 2008, 05:33
Oh yes, before I forget, they do have a "paper" describing all the aspects of Apophysis, flam3 and flam4.

The document is in pdf, it's 22.5MB in size. It's available from http://flam3.com/flame_draves.pdf

Hope this helps !!
Post 05 May 2008, 05:33
View user's profile Send private message Reply with quote
Madis731



Joined: 25 Sep 2003
Posts: 2139
Location: Estonia
Madis731 05 May 2008, 09:49
All I can say is optimize THAT Very Happy

_________________
My updated idol Very Happy http://www.agner.org/optimize/
Post 05 May 2008, 09:49
View user's profile Send private message Visit poster's website Yahoo Messenger MSN Messenger Reply with quote
penang



Joined: 01 Oct 2004
Posts: 59
penang 05 May 2008, 14:28
As you wish .... squeezing from 22.5mb to a little less than 6mb, while still preserving the vibrant colors of the embedded photos.

Get it at www.PenangA1.com/flam/flam3.pdf

I know 6mb is still quite large, unless someone can come up with a much better pdf compressor. :)
Post 05 May 2008, 14:28
View user's profile Send private message Reply with quote
rugxulo



Joined: 09 Aug 2005
Posts: 2341
Location: Usono (aka, USA)
rugxulo 05 May 2008, 18:17
http://schnaader.info/precomp.html

precomp (good with UHarc) / lprepaq (very good) / prepaq (slow!!)
Post 05 May 2008, 18:17
View user's profile Send private message Visit poster's website Reply with quote
Display posts from previous:
Post new topic Reply to topic

Jump to:  
Goto page 1, 2  Next

< Last Thread | Next Thread >
Forum Rules:
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum
You cannot attach files in this forum
You can download files in this forum


Copyright © 1999-2024, Tomasz Grysztar. Also on GitHub, YouTube.

Website powered by rwasa.