flat assembler
Message board for the users of flat assembler.
![]() Goto page 1, 2 Next |
Author |
|
revolution 11 Apr 2008, 22:17
Have you seen the RSA macros?
|
|||
![]() |
|
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
![]() 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 ![]() 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 ![]() |
|||
![]() |
|
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! |
|||
![]() |
|
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
![]() Thanks, and I will definitely look into interpreted ![]() BTW: I've seen RSA in Java, it's TINYYYY and soo slowwww.... I love how simple it is though ![]() 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. |
|||
![]() |
|
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. ![]() |
|||
![]() |
|
AlexP 12 Apr 2008, 01:03
![]() 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 |
|||
![]() |
|
bitRAKE 12 Apr 2008, 03:47
Have you seen this compression?
http://cs.fit.edu/~mmahoney/compression/ |
|||
![]() |
|
AlexP 12 Apr 2008, 04:42
![]() http://www.fadden.com/techmisc/hdc/ |
|||
![]() |
|
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. |
|||
![]() |
|
AlexP 12 Apr 2008, 15:39
Thanks, interesting that there are awards for compression
|
|||
![]() |
|
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).
|
|||
![]() |
|
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
![]() |
|||
![]() |
|
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..... |
|||
![]() |
|
bitRAKE 04 May 2008, 23:35
penang wrote: The software is apophysis. New version of it is called flam3 |
|||
![]() |
|
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. ![]() |
|||
![]() |
|
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 !! |
|||
![]() |
|
Madis731 05 May 2008, 09:49
All I can say is optimize THAT
![]() |
|||
![]() |
|
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. :) |
|||
![]() |
|
rugxulo 05 May 2008, 18:17
http://schnaader.info/precomp.html
precomp (good with UHarc) / lprepaq (very good) / prepaq (slow!!) |
|||
![]() |
|
Goto page 1, 2 Next < Last Thread | Next Thread > |
Forum Rules:
|
Copyright © 1999-2025, Tomasz Grysztar. Also on GitHub, YouTube.
Website powered by rwasa.