You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I would like to suggest a feature: a lot of times the user have have ate least one file unencrypted that are encrypted inside the encrypted zip file. The biggest problem is find the correct software (windup / winder / etc) + version of the software + compression level used (fast, normal, etc).
We know that the encrypted compressed file should have 12 bytes more than the unencrypted file compressed with the same software + version + compression level.
Is it possible to create a function or utility where the user enters the unencrypted file and multiple libraries are used to try to find a match?
Thank you very much for your amazing job. :)
The text was updated successfully, but these errors were encountered:
You can crack password without knowing software version. You can use first byte archive signature, datestamp and byte at the end of archive. Post link for archive
Hello, this is a good idea.
It is for sure possible to automate guessing the compression parameters. Thank you for the suggestion.
I already opened an issue about this idea (#84) so I will close this one.
Feel free to open other issues if you have other ideas. Feedback is appreciated.
Hello, kimci86. How are you?
I would like to suggest a feature: a lot of times the user have have ate least one file unencrypted that are encrypted inside the encrypted zip file. The biggest problem is find the correct software (windup / winder / etc) + version of the software + compression level used (fast, normal, etc).
We know that the encrypted compressed file should have 12 bytes more than the unencrypted file compressed with the same software + version + compression level.
Is it possible to create a function or utility where the user enters the unencrypted file and multiple libraries are used to try to find a match?
Thank you very much for your amazing job. :)
The text was updated successfully, but these errors were encountered: