>>122
No, you cannot do an exhaustive search in under a day. What are you talking about? Even using the fastest implementation I know of, JTR's, I only get about ~5 million trips a second on an i3. Even with a recent, top-line CPU, and an optimized AVX algorithm, you'd get 50 million at best.
Even with the MTI GPU bruteforcer, it would take about a month with 2,000 dollars worth of GPUs.
I don't exactly have access to a supercomputing cluster.
Anyway, there's a chance it
exists, but the ratio of fixed points over the space is
absurdly low.
Cycles are easier to find since the probability of stumbling upon one randomly adds up the more rounds you do.
Doing some analysis to pick a ``better'' starting points would help. Even if it doesn't pan out, it's a reason to explore DES.
I'd check your numbers, as well.