Use stack size when finding decryption routine and seed#2
Open
PeterGabaldon wants to merge 1 commit intorandorisec:mainfrom
Open
Use stack size when finding decryption routine and seed#2PeterGabaldon wants to merge 1 commit intorandorisec:mainfrom
PeterGabaldon wants to merge 1 commit intorandorisec:mainfrom
Conversation
Author
|
Also, I tested it in 7.4.6 and can confirm that works well |
PeterGabaldon
changed the title
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Hello,
This is related to the issue I posted some hours ago #1.
Instead of relaying in the symbol rsa_parse_pub_key the scripts now looks for the stack size of the decryption routine. Using that the address of that function is found and then the SEED and so on can be calculated.
Again, thank you for you amazing work researching the new encryption method of FortiOS in later versions of 7.4.3.