Paul Crowley <paul@ciphergoth.org> [Sun, 28 Dec 2008 13:09:37 +0000] rev 132
Save on reallocations
Paul Crowley <paul@ciphergoth.org> [Sat, 27 Dec 2008 14:19:59 +0000] rev 131
Simpler way to add an eleent not already present
Paul Crowley <paul@ciphergoth.org> [Sat, 27 Dec 2008 14:17:58 +0000] rev 130
Move search into its own function
Paul Crowley <paul@ciphergoth.org> [Sat, 27 Dec 2008 14:12:02 +0000] rev 129
Ignore memo databases
Paul Crowley <paul@ciphergoth.org> [Sat, 27 Dec 2008 14:11:19 +0000] rev 128
Don't try and remove an index if there aren't any
Paul Crowley <paul@ciphergoth.org> [Sat, 27 Dec 2008 14:11:04 +0000] rev 127
Memoize bit pattern generation
Paul Crowley <paul@ciphergoth.org> [Sat, 27 Dec 2008 01:09:23 +0000] rev 126
record the maxterms we find
Paul Crowley <paul@ciphergoth.org> [Sat, 27 Dec 2008 00:58:01 +0000] rev 125
Constant isn't good enough
Paul Crowley <paul@ciphergoth.org> [Sat, 27 Dec 2008 00:48:08 +0000] rev 124
Actually search for maxterms
Paul Crowley <paul@ciphergoth.org> [Sat, 27 Dec 2008 00:47:44 +0000] rev 123
Remove debugging prints
Paul Crowley <paul@ciphergoth.org> [Sat, 27 Dec 2008 00:37:46 +0000] rev 122
Allow cube parity code to use fewer than nine indices
Paul Crowley <paul@ciphergoth.org> [Sat, 27 Dec 2008 00:13:57 +0000] rev 121
Reorganise documentation
Paul Crowley <paul@ciphergoth.org> [Sat, 27 Dec 2008 00:13:39 +0000] rev 120
no longer used
Paul Crowley <paul@ciphergoth.org> [Fri, 26 Dec 2008 23:53:54 +0000] rev 119
Separate out memoization,and use it to support multiple output bit queries in one run
Paul Crowley <paul@ciphergoth.org> [Fri, 26 Dec 2008 23:37:16 +0000] rev 118
Give cubeattack.py more meaningful name
Paul Crowley <paul@ciphergoth.org> [Fri, 26 Dec 2008 23:21:58 +0000] rev 117
Make memoize sync the deatabase on every write
Paul Crowley <paul@ciphergoth.org> [Fri, 26 Dec 2008 16:57:18 +0000] rev 116
Make cache object directly accessible.
Paul Crowley <paul@ciphergoth.org> [Fri, 26 Dec 2008 15:24:12 +0000] rev 115
Memoize cube parities
Paul Crowley <paul@ciphergoth.org> [Fri, 26 Dec 2008 15:21:38 +0000] rev 114
break cube attack into own module
Paul Crowley <paul@ciphergoth.org> [Fri, 26 Dec 2008 15:18:06 +0000] rev 113
Add disk-based memoizer
Paul Crowley <paul@ciphergoth.org> [Wed, 24 Dec 2008 13:18:43 +0000] rev 112
update is your friend :-)
Paul Crowley <paul@ciphergoth.org> [Tue, 23 Dec 2008 18:04:44 +0000] rev 111
Latest maxterms from Itai
Paul Crowley <paul@ciphergoth.org> [Tue, 23 Dec 2008 18:01:23 +0000] rev 110
Add memoizer
Paul Crowley <paul@ciphergoth.org> [Mon, 22 Dec 2008 13:14:38 +0000] rev 109
Fixes to linearity tests
Paul Crowley <paul@ciphergoth.org> [Sun, 21 Dec 2008 11:13:27 +0000] rev 108
use new framework for writing results
Paul Crowley <paul@ciphergoth.org> [Sun, 21 Dec 2008 11:08:17 +0000] rev 107
break out the work of reading and writing item files into a separate
module
Paul Crowley <paul@ciphergoth.org> [Sun, 21 Dec 2008 09:59:30 +0000] rev 106
Test a binary function for linearity
Paul Crowley <paul@lshift.net> [Fri, 19 Dec 2008 17:56:04 +0000] rev 105
separate out linearity test from key bit finding
Paul Crowley <paul@lshift.net> [Fri, 19 Dec 2008 17:35:22 +0000] rev 104
add file containing only the maxterms we believe to be good
Paul Crowley <paul@lshift.net> [Fri, 19 Dec 2008 16:49:13 +0000] rev 103
Fix a maxterm based on my own tests
Paul Crowley <paul@lshift.net> [Fri, 19 Dec 2008 16:47:16 +0000] rev 102
Make linearity test find out what kbits should be
Paul Crowley <paul@lshift.net> [Fri, 19 Dec 2008 16:01:47 +0000] rev 101
Remove the ones now known to be good after fixes
Paul Crowley <paul@lshift.net> [Fri, 19 Dec 2008 16:01:14 +0000] rev 100
Add the maxterms I sent to Dinur as a separate file
Paul Crowley <paul@lshift.net> [Fri, 19 Dec 2008 16:00:43 +0000] rev 99
Fix and allow maxterms file to come from command line
Paul Crowley <paul@lshift.net> [Fri, 19 Dec 2008 15:48:25 +0000] rev 98
Corrections received by email from Itai Dinur
Paul Crowley <paul@ciphergoth.org> [Fri, 19 Dec 2008 09:14:32 +0000] rev 97
Convert to using dict-orinted format most places
Paul Crowley <paul@ciphergoth.org> [Fri, 19 Dec 2008 09:14:04 +0000] rev 96
Bring README up to date with repo
Paul Crowley <paul@ciphergoth.org> [Fri, 19 Dec 2008 09:04:27 +0000] rev 95
Use new interface for benchmark
Paul Crowley <paul@lshift.net> [Thu, 18 Dec 2008 17:00:50 +0000] rev 94
Sort bits first
Paul Crowley <paul@lshift.net> [Thu, 18 Dec 2008 16:42:41 +0000] rev 93
Move towards new way of listing maxterms
Paul Crowley <paul@lshift.net> [Thu, 18 Dec 2008 15:23:09 +0000] rev 92
Modify linearity test to look for key bits
Paul Crowley <paul@lshift.net> [Thu, 18 Dec 2008 13:13:05 +0000] rev 91
Changes Itai Dinur recommends by email
Paul Crowley <paul@ciphergoth.org> [Thu, 18 Dec 2008 09:40:49 +0000] rev 90
add linearity tester
Paul Crowley <paul@lshift.net> [Wed, 17 Dec 2008 23:36:51 +0000] rev 89
Improve the way we present results
Paul Crowley <paul@ciphergoth.org> [Wed, 17 Dec 2008 09:28:08 +0000] rev 88
make bit reversal part of maxterm object, and separate out parser so results parser can use it
Paul Crowley <paul@lshift.net> [Wed, 17 Dec 2008 09:03:40 +0000] rev 87
Only list non-working maxterms
Paul Crowley <paul@ciphergoth.org> [Wed, 17 Dec 2008 08:25:12 +0000] rev 86
Simple results parser
Paul Crowley <paul@ciphergoth.org> [Wed, 17 Dec 2008 00:30:08 +0000] rev 85
Loop forever logging results
Paul Crowley <paul@ciphergoth.org> [Wed, 17 Dec 2008 00:23:23 +0000] rev 84
Update README for current state
Paul Crowley <paul@ciphergoth.org> [Wed, 17 Dec 2008 00:22:32 +0000] rev 83
Do away with _getSize, use TD not _TapDescriptor
Paul Crowley <paul@ciphergoth.org> [Wed, 17 Dec 2008 00:21:41 +0000] rev 82
Simplify indexing
Paul Crowley <paul@ciphergoth.org> [Wed, 17 Dec 2008 00:21:19 +0000] rev 81
Move key generation out of test_maxterm
Paul Crowley <paul@ciphergoth.org> [Wed, 17 Dec 2008 00:20:55 +0000] rev 80
list does this more neatly
Paul Crowley <paul@lshift.net> [Tue, 16 Dec 2008 18:33:33 +0000] rev 79
Repeatedly run maxterm tests
Paul Crowley <paul@lshift.net> [Tue, 16 Dec 2008 18:27:21 +0000] rev 78
use maxterm list
Paul Crowley <paul@lshift.net> [Tue, 16 Dec 2008 18:27:14 +0000] rev 77
Handle smaller cubes
Paul Crowley <paul@lshift.net> [Tue, 16 Dec 2008 16:53:44 +0000] rev 76
Let's copy-paste all maxterms from paper
Paul Crowley <paul@lshift.net> [Tue, 16 Dec 2008 16:23:25 +0000] rev 75
Working cube attack with most of stuff in assembly
Paul Crowley <paul@ciphergoth.org> [Tue, 16 Dec 2008 11:24:39 +0000] rev 74
Partway through cube attack implementation
Paul Crowley <paul@ciphergoth.org> [Tue, 16 Dec 2008 10:36:15 +0000] rev 73
no need for exception handler in context manager
Paul Crowley <paul@ciphergoth.org> [Tue, 16 Dec 2008 10:07:47 +0000] rev 72
Use a context manager to manage loops
Paul Crowley <paul@ciphergoth.org> [Tue, 16 Dec 2008 09:38:34 +0000] rev 71
Simplify address calculations
Paul Crowley <paul@ciphergoth.org> [Tue, 16 Dec 2008 09:34:42 +0000] rev 70
add address calculations
Paul Crowley <paul@ciphergoth.org> [Tue, 16 Dec 2008 00:32:48 +0000] rev 69
Use array adapters to simplify parallel trivium
Paul Crowley <paul@ciphergoth.org> [Tue, 16 Dec 2008 00:02:13 +0000] rev 68
add little endian adapter
Paul Crowley <paul@ciphergoth.org> [Mon, 15 Dec 2008 23:57:53 +0000] rev 67
Add commented-out check on zip - can't do it that way
Paul Crowley <paul@ciphergoth.org> [Mon, 15 Dec 2008 23:41:06 +0000] rev 66
Add transforming adapter
Paul Crowley <paul@ciphergoth.org> [Mon, 15 Dec 2008 23:29:00 +0000] rev 65
Generalize ArrayAdapter
Paul Crowley <paul@ciphergoth.org> [Mon, 15 Dec 2008 23:15:53 +0000] rev 64
Rename to slice adaptor, generalize and add group adapter
Paul Crowley <paul@ciphergoth.org> [Mon, 15 Dec 2008 22:56:16 +0000] rev 63
Support slices
Paul Crowley <paul@ciphergoth.org> [Mon, 15 Dec 2008 21:27:21 +0000] rev 62
Array adapter works
Paul Crowley <paul@lshift.net> [Thu, 11 Dec 2008 17:10:33 +0000] rev 61
Move some stuff into a buffer object
Paul Crowley <paul@lshift.net> [Thu, 11 Dec 2008 16:47:07 +0000] rev 60
Neater way to generate code
Paul Crowley <paul@lshift.net> [Thu, 11 Dec 2008 16:44:03 +0000] rev 59
Separate out Trivium from copy
Paul Crowley <paul@lshift.net> [Thu, 11 Dec 2008 16:41:36 +0000] rev 58
doGetParam
Paul Crowley <paul@lshift.net> [Thu, 11 Dec 2008 16:36:22 +0000] rev 57
move copy into its own thing
Paul Crowley <paul@lshift.net> [Thu, 11 Dec 2008 16:26:25 +0000] rev 56
ParallelTrivium asks for size
Paul Crowley <paul@lshift.net> [Thu, 11 Dec 2008 16:24:21 +0000] rev 55
Move Trivium code generation into Scode subclass
Paul Crowley <paul@ciphergoth.org> [Thu, 11 Dec 2008 09:58:47 +0000] rev 54
Try getting the output as ulongs - doesn't work
Paul Crowley <paul@ciphergoth.org> [Thu, 11 Dec 2008 09:58:09 +0000] rev 53
Time call overhead
Paul Crowley <paul@ciphergoth.org> [Thu, 11 Dec 2008 00:02:13 +0000] rev 52
faster without extarray
Paul Crowley <paul@ciphergoth.org> [Thu, 11 Dec 2008 00:01:11 +0000] rev 51
more tests
Paul Crowley <paul@ciphergoth.org> [Wed, 10 Dec 2008 23:37:20 +0000] rev 50
There's the problem...
Paul Crowley <paul@lshift.net> [Wed, 10 Dec 2008 15:38:45 +0000] rev 49
Merge
Paul Crowley <paul@lshift.net> [Wed, 10 Dec 2008 15:23:57 +0000] rev 48
Starting on work to make it faster
Paul Crowley <paul@ciphergoth.org> [Wed, 10 Dec 2008 09:03:58 +0000] rev 47
Add comment warning about Python overhead
Paul Crowley <paul@ciphergoth.org> [Wed, 10 Dec 2008 09:03:46 +0000] rev 46
Code has moved - fix printcode
Paul Crowley <paul@ciphergoth.org> [Tue, 09 Dec 2008 23:45:40 +0000] rev 45
cut out repetition from benchmark
Paul Crowley <paul@ciphergoth.org> [Tue, 09 Dec 2008 23:37:47 +0000] rev 44
Correctly handle variable length key/IVs
Paul Crowley <paul@lshift.net> [Tue, 09 Dec 2008 18:12:13 +0000] rev 43
code generation not properly part of tap description, move it out
Paul Crowley <paul@lshift.net> [Tue, 09 Dec 2008 18:02:32 +0000] rev 42
Use _TapDescriptor more consistently
Paul Crowley <paul@lshift.net> [Tue, 09 Dec 2008 17:59:07 +0000] rev 41
minor tweaks to code generation
Paul Crowley <paul@lshift.net> [Tue, 09 Dec 2008 16:56:49 +0000] rev 40
Fix line wrapping; remove half-begun sentence fragment
Paul Crowley <paul@lshift.net> [Tue, 09 Dec 2008 15:23:06 +0000] rev 39
Link to blog post in README
Paul Crowley <paul@lshift.net> [Tue, 09 Dec 2008 15:15:24 +0000] rev 38
Add my email and a link to the code
Paul Crowley <paul@lshift.net> [Tue, 09 Dec 2008 14:06:37 +0000] rev 37
reduce repetition in copy code
Paul Crowley <paul@lshift.net> [Tue, 09 Dec 2008 13:56:08 +0000] rev 36
line wrap README
Paul Crowley <paul@lshift.net> [Tue, 09 Dec 2008 13:49:34 +0000] rev 35
simplify parity sum
Paul Crowley <paul@lshift.net> [Tue, 09 Dec 2008 13:48:25 +0000] rev 34
Add a README and LICENCE file
Paul Crowley <paul@lshift.net> [Tue, 09 Dec 2008 13:26:03 +0000] rev 33
Switch back to faster maxterm for testing
Paul Crowley <paul@lshift.net> [Tue, 09 Dec 2008 13:01:56 +0000] rev 32
make key bits a variable
Paul Crowley <paul@lshift.net> [Tue, 09 Dec 2008 12:54:44 +0000] rev 31
Remove now unnecessary exercising of corepy functions
Paul Crowley <paul@lshift.net> [Tue, 09 Dec 2008 12:32:19 +0000] rev 30
Move looping into code generation
Paul Crowley <paul@lshift.net> [Tue, 09 Dec 2008 12:28:10 +0000] rev 29
Add code generation helper object
Paul Crowley <paul@lshift.net> [Tue, 09 Dec 2008 12:12:15 +0000] rev 28
add total_len to all offsets
Paul Crowley <paul@lshift.net> [Tue, 09 Dec 2008 12:07:06 +0000] rev 27
Create a 'tap descriptor'
Paul Crowley <paul@lshift.net> [Tue, 09 Dec 2008 11:58:59 +0000] rev 26
add a benchmark
Paul Crowley <paul@lshift.net> [Tue, 09 Dec 2008 11:13:55 +0000] rev 25
Simplify interface to ParallelTrivium object
Paul Crowley <paul@ciphergoth.org> [Tue, 09 Dec 2008 09:24:57 +0000] rev 24
do test differently
Paul Crowley <paul@ciphergoth.org> [Tue, 09 Dec 2008 09:21:27 +0000] rev 23
Paper numbers bits backwards
Paul Crowley <paul@ciphergoth.org> [Tue, 09 Dec 2008 09:21:14 +0000] rev 22
Change the way we calculate parity
Paul Crowley <paul@ciphergoth.org> [Tue, 09 Dec 2008 09:11:11 +0000] rev 21
No IV to iterate over
Paul Crowley <paul@ciphergoth.org> [Tue, 09 Dec 2008 00:24:14 +0000] rev 20
Test that it really does do 128 at once
Paul Crowley <paul@ciphergoth.org> [Mon, 08 Dec 2008 23:37:38 +0000] rev 19
start work on testing cube attack. Doesn't work yet...
Paul Crowley <paul@ciphergoth.org> [Mon, 08 Dec 2008 23:04:22 +0000] rev 18
Test using random numbers
Paul Crowley <paul@ciphergoth.org> [Mon, 08 Dec 2008 23:00:12 +0000] rev 17
Add stuff for directly setting state words
Paul Crowley <paul@ciphergoth.org> [Mon, 08 Dec 2008 22:37:07 +0000] rev 16
make array longs not chars
Paul Crowley <paul@ciphergoth.org> [Mon, 08 Dec 2008 22:33:48 +0000] rev 15
Redesign for multi-shot use
Paul Crowley <paul@ciphergoth.org> [Mon, 08 Dec 2008 21:59:43 +0000] rev 14
Fiddle with instruction order
Paul Crowley <paul@ciphergoth.org> [Mon, 08 Dec 2008 21:58:41 +0000] rev 13
Print out assembly
Paul Crowley <paul@ciphergoth.org> [Mon, 08 Dec 2008 21:54:18 +0000] rev 12
Make parallel implementation object-oriented
Paul Crowley <paul@ciphergoth.org> [Mon, 08 Dec 2008 21:44:44 +0000] rev 11
rename misnamed variable
Paul Crowley <paul@ciphergoth.org> [Mon, 08 Dec 2008 21:43:14 +0000] rev 10
Loop inside assembly - still works
Paul Crowley <paul@ciphergoth.org> [Mon, 08 Dec 2008 21:29:52 +0000] rev 9
Start preparing to loop inside
Paul Crowley <paul@ciphergoth.org> [Mon, 08 Dec 2008 21:26:56 +0000] rev 8
add a .hgignore
Paul Crowley <paul@ciphergoth.org> [Mon, 08 Dec 2008 21:26:11 +0000] rev 7
Move parallel implementation into own module
Paul Crowley <paul@ciphergoth.org> [Mon, 08 Dec 2008 21:10:37 +0000] rev 6
It can't just be working can it?
Paul Crowley <paul@ciphergoth.org> [Mon, 08 Dec 2008 20:48:42 +0000] rev 5
corepy-impl proof of concept works
Paul Crowley <paul@lshift.net> [Mon, 08 Dec 2008 19:19:46 +0000] rev 4
make existing impl into a module
Paul Crowley <paul@lshift.net> [Mon, 08 Dec 2008 19:04:33 +0000] rev 3
Start on Trivium
Paul Crowley <paul@lshift.net> [Mon, 08 Dec 2008 19:04:22 +0000] rev 2
Remove unused stuff
Paul Crowley <paul@lshift.net> [Mon, 08 Dec 2008 18:04:01 +0000] rev 1
OK, it loops now - we're practically done :-)
Paul Crowley <paul@lshift.net> [Mon, 08 Dec 2008 16:43:58 +0000] rev 0
it works, rah!