Click here to Skip to main content
15,886,104 members
Please Sign up or sign in to vote.
2.00/5 (1 vote)
I was making some research on cryptography for a class when i got to this article talking about how the meet in the middle algorithm process can boost the processing time (computational time) of some math problems in python I.E Large Numbers. But surprisingly, I can't find a proper in Depth explanation of this mathematical trick to curb the processing time of large numbers; not even an example (I love examples because it actually makes me understand questions more). I actually found this article while looking but it isn't still clear enough. https://www.geeksforgeeks.org/discrete-logarithm-find-integer-k-ak-congruent-modulo-b/. Can i please have a proper explanation of the 'Meet in the middle' mathematical algorithm? and can i please have some examples at least? Thanks a lot in advance.

What I have tried:

I actually tried looking for an in depth explanation online only not to find one
Posted
Updated 19-Sep-20 14:10pm

1 solution

Quote:
Can i please have a proper explanation of the 'Meet in the middle' mathematical algorithm?

In the article you provided, "meet in the middle trick" is itself a link to an explanation (thus the green color) with example.
Meet in the middle - GeeksforGeeks[^]
Did you read it ?
 
Share this answer
 
Comments
Dave Kent 305 23-Sep-20 22:02pm    
i actually did but i don't know what the "I" and "J" represents in the algorithm itself... and there's no actual examples with real life numbers

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900