Other Directory Sites: SeekWonder | Directory Owners Forum
The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:10:59
Mok-Kong Shen (mok-kong.shen@stud.uni-muenchen.de)
Fri, 21 Aug 1998 12:11:04 +0100
steven.soroka@mts.mb.ca wrote:
>
> As the subject suggests, does anyone have any cryptographically secure code
> for creating random numbers in ASM?
> this should be something worthy of generating at least a 128-bit key or one
> time pad..
> (of course since you can use asm calls in any language, this would be a
> huge help for me, along with speed.)
I don't see why you need ASM. Subroutines in any high-level language,
if the interface is properly designed, can be called from programs
written in any other language, including ASM. The compilers are
nowadays so good that is difficult to outperform them with hand-crafted
assembler code, not to mention the ease of discovering possibilities
of global (as against local) optimizations and the ease of later
modifications and debugging and last not least the time of
implementation.
> another dumb question from a beginner.. . I wrote something to create 2M of
> pseudo-random characters, and when
> I compressed it using -ex (extra compression) with pkzip, it got larger by
> 114 bytes, does this neccesarily mean that it's
> safe to use for a one-time pad and secure from cryptanalysis?
To the best of my knowledge there is no way at all to make such a
deduction in logic.
M. K. Shen
------------------------------------------------------
M. K. Shen, Postfach 340238, D-80099 Muenchen, Germany
+49 (89) 831939 (6:00 GMT)
mok-kong.shen@stud.uni-muenchen.de
http://www.stud.uni-muenchen.de/~mok-kong.shen/
(last updated: 11th August 98. origin site of WEAK1, WEAK2 and WEAK3.)
(containing 2 mathematical problems with rewards totalling US$500)
The following archive was created by hippie-mail 7.98617-22 on Sat Apr 10 1999 - 01:10:59