leaked Magnitude exploitkit ???


SUBMITTED BY: phroyd

DATE: June 30, 2016, 7:12 p.m.

UPDATED: June 30, 2016, 7:14 p.m.

FORMAT: Text only

SIZE: 1.6 kB

HITS: 2928

  1. I´m really about to buy that thing, i just wanted to know some opinions!
  2. Code:
  3. MagniDude EK (05/16) [Magnitude EK rip off / clone]
  4. - complete infrastructure - get subscribers or deliver your own message
  5. - latest exploits (including adobe CVE-2016-1019) available
  6. - integrated access to certain tested ad-networks / traffic exchanges
  7. - includes ransomwares (CERBER and CHIMERA)
  8. - both can be distributed through available exploits
  9. - some SSI sources included
  10. - ENGLISH TRANSLATION :)
  11. IF YOU DONT KNOW WHAT THIS IS AND WHAT TO DO WITH IT,
  12. THIS IS NOT FOR YOU - DO NOT DOWNLOAD!
  13. If you do, use it wisely! ;)
  14. haha
  15. vL4|>
  16. promote this 1337 item and get 50% commission!
  17. https://satoshibox.com/wigjtfkdcggzs2g53py3ap4b/partner
  18. link: Magnitude EK
  19. (yes i used the affiliate link :P - cant complain bout 50% product price... )
  20. --------------------------------------------------------------
  21. algorithm ford-fulkerson is
  22. input: Graph G with flow capacity c,
  23. source node s,
  24. sink node t
  25. output: Flow f such that f is maximal from s to t
  26. (Note that f(u,v) is the flow from node u to node v, and c(u,v) is the flow capacity from node u to node v)
  27. for each s6edge (u, v) in GE do
  28. f(u, v) ← 0
  29. f(v, u) ← 0
  30. while there exists a path p from s to t in the residual network Gf do
  31. let cf be the flow capacity of the residual network Gf
  32. cf(p) ← min{cf(u, v) | (u, v) in p}
  33. for each edge (u, v) in p do
  34. f(u, v) ← f(u, v) + cf(p)
  35. f(v, u) ← −f(u, v)
  36. return f

comments powered by Disqus