On Fri, Feb 07, 2014 at 06:44:32PM -0500, Andrew Pennebaker wrote:
> If we met users half way, presenting .deb's, .rpm's, maybe a ppa repo, that
> would be a great start.
As a first step, I recommend using https://build.opensuse.org/
It is slightly openSUSE centered, but makes it easy to check th
On Wed, Aug 28, 2013 at 05:55:17PM +0200, Björn Lindqvist wrote:
> Interesting! I thought putting binaries outside of bin directories were
> heavily discouraged. Which is why I choose to rename it. Do you have an
> example of a package that follows the approach you are suggesting? Then
> I could
On Tue, Jun 18, 2013 at 11:20:41AM -0700, Doug Coleman wrote:
> In your home directory, do:
> git clone g...@github.com:slavapestov/factor.git
> cd factor
> ./build-support/factor.sh update
>
> It will probably solve problems 1, 2, 4.
If I remember correctly, I experienced problems 1 and 4 as wel
On Thu, Jun 06, 2013 at 07:11:13PM +0100, Gabriel Kerneis wrote:
> And also, destructive operations are dangerous: I got them wrong on first
> try!
Definitely not worth the risk: I just discovered another bug messing up with
the key, which prevents from reusing it from one block to th
Hi Alex,
Baseline:
average benchmark over ten runsenc: 7948, dec: 5368 (blk/s)
> Another curiosity: I wonder if some `inline` declarations would help
> tighten up the compiled code. Most of the word definitions are pretty
> short, and are involved in a lot of loops.
inline GF(2^8) arithmet
On Thu, Jun 06, 2013 at 06:58:53AM -0700, Doug Coleman wrote:
> Nice job! The ``inv-sbox`` problem is that ``sbox`` is not compiled yet.
Oh, I didn't expect CONSTANT: to need a compilation, but it makes sense in
hindsight.
Thanks,
--
Gabriel
-
On Thu, Jun 06, 2013 at 11:46:12AM +0100, Gabriel Kerneis wrote:
> An AES block is 16 bytes, so the current implementation encrypts at
> ~124kB/s, and decrypts at ~84kB/s.
I just pushed bindings to OpenSSL and ran the same benchmark: ~9.5 MB/s.
Hi,
I have applied most advice I got here and pushed a new version of crypto.aes:
https://github.com/kerneis/factor/commits/aes
(beware if you pulled the previous one, the branch has been rebased).
I have an issue when I USE: the vocabulary: it fails because I use `>byte-array`
in `CONSTANT: in
Thank you so much for your insightful review, Alex.
I’ll try and improve upon your comments in a future revision. Just one point:
> 5) Am I missing something, or is `xtime` using 0x1b where it should be
> using 0x11b?
I kept the implementation provided by crypto.aes for this one. I too
wondere
On Mon, May 27, 2013 at 09:51:04AM -0700, John Benediktsson wrote:
> Nice! Have you had a chance to look at performance?
Not yet, but this is on my TODO list. I'm working on ECB and CBC modes, so it's
probably worth finishing that first and then test with large files.
Is there any recommanded w
On Sun, May 26, 2013 at 07:42:45PM +0100, Gabriel Kerneis wrote:
> (the crypto.aes library has never been finished)
I've cleaned my code and made it available in the "aes" branch of
the following repository:
https://github.com/kerneis/factor/commits/aes
I'm not sure t
Hi John,
On Sun, May 26, 2013 at 11:52:50PM +0200, Jon Harper wrote:
> - [ [ xtime ] times 0 ? ] with map-index -> you are doing the computation
> and thowing the result away for unset bits. did you intend to do it to
> simplify the stack shuffling ?
Yes. I have to rewrite that one to use expone
ps197/fips-197.pdf>.
Many thanks,
Gabriel
! Copyright (C) 2013 Gabriel Kerneis
! See http://factorcode.org/license.txt for BSD license.
USING: kernel sequences grouping math math.order math.parser math.bitwise
math.bits strings locals arrays make crypto.aes tools.test ;
IN: fips197
! Words are
13 matches
Mail list logo
