exa/codecrypt
1
0
Fork 0
Code Issues Pull requests Actions Packages Projects Releases Wiki Activity

remove some uninteresting comments

Browse source
This commit is contained in:
Mirek Kratochvil 2013-04-15 15:59:45 +02:00
parent b3403d5c41
commit 5d4879a760
2 changed files with 1 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
src/fmtseq.cpp
View file

@ -314,7 +314,6 @@ int fmtseq::generate (pubkey&pub, privkey&priv,
* - h*l hashes of verification chain, from bottom to top, h*l times hash size * - h*l hashes of verification chain, from bottom to top, h*l times hash size
* - i (so that we can guess left/right concatenation before hashing) stored as * - i (so that we can guess left/right concatenation before hashing) stored as
* H-bit number in little endian. * H-bit number in little endian.
* TODO Why cannot the tree be just XORed together? would be WAY simpler!
* *
* summed up: * summed up:
* *

2
src/matrix.cpp
View file

@ -63,7 +63,7 @@ void matrix::compute_transpose (matrix&r)
void matrix::mult (const matrix&right) void matrix::mult (const matrix&right)
{ {
//trivial multiply. TODO strassen algo for larger matrices. //trivial multiply
matrix leftT; matrix leftT;
compute_transpose (leftT); compute_transpose (leftT);
uint w = right.width(), h = leftT.width(), i, j; uint w = right.width(), h = leftT.width(), i, j;