[algogeeks] Re: Fwd: [algogeeks] algorithm brute-forcing

2007-04-07 Thread Dennis Yurichev
On 8 апр, 03:03, "Pradeep Muthukrishnan" <[EMAIL PROTECTED]> wrote: > I dont completely get the question...Is the set of possible inputs bounded? > If yes, then why cant we generate all possible inputs and feed it to the > black box? hope u can clarify it more? I'm sorry, more on that is there: h

[algogeeks] Fwd: [algogeeks] algorithm brute-forcing

2007-04-07 Thread Pradeep Muthukrishnan
I dont completely get the question...Is the set of possible inputs bounded? If yes, then why cant we generate all possible inputs and feed it to the black box? hope u can clarify it more? Forwarded message -- From: Dennis Yurichev <[EMAIL PROTECTED]> Date: Apr 7, 2007 8:36 AM Subj

[algogeeks] Re: all simple paths in a graph

2007-04-07 Thread Daniel Bastidas
Hey ipsita check it out this code, is in java, mat is the adjacency matrix, it has -1 for a node that can be connected directly. public void paths(int sou,int dest,int mat[][],Vector stack) { boolean band = true; if(sou == dest) { //path it is inside of stack, and dest }

[algogeeks] algorithm brute-forcing

2007-04-07 Thread Dennis Yurichev
Hi. What we have: we have a black box with some unknown crypto algorithm inside. We can test it as many times as we want, placing input data and key at input and see output. We know that black box is just one something like LFSR implementation (Linear feedback shift register), modified somehow, bu