January 22nd, 2019, 02:53 PM  #31 
Newbie Joined: Jan 2019 From: Germany Posts: 13 Thanks: 2  
January 23rd, 2019, 06:01 AM  #32 
Newbie Joined: Jan 2019 From: Australia Posts: 7 Thanks: 0  
January 27th, 2019, 05:18 PM  #33 
Newbie Joined: Jan 2019 From: Germany Posts: 13 Thanks: 2  
February 5th, 2019, 08:52 PM  #34 
Newbie Joined: Jan 2019 From: Australia Posts: 7 Thanks: 0  Perelman spent most of his life on solving mathematical problems, theorems and hypotheses and eventually succeeding in his work, he refused a million US dollars with a smile on his face !!!!!!!! It is unlikely that Grigory Perelman is interested in $ 5,000,000 What are some ways you can solve the math task Messrs. Scientists, wunderkinds of mathematics? Last edited by skipjack; March 31st, 2019 at 10:48 AM. 
February 8th, 2019, 05:07 PM  #35 
Newbie Joined: Jan 2019 From: Germany Posts: 13 Thanks: 2 
It seems like, they say, it works relatively well in the "usual" RSA neurocryptanalysis (neural networks with backpropagation  at least, the number of options per search will decrease by orders of magnitude) https://en.wikipedia.org/wiki/Backpropagation https://github.com/search?q=Backpropagation 
February 24th, 2019, 07:22 AM  #36 
Newbie Joined: Jan 2019 From: Australia Posts: 7 Thanks: 0  https://www.youtube.com/watch?v=QaZjcjkdmbA Shamir’s Trick With this method computing the sum of two point multiplications is faster than to compute them separately. So basically we want the result of kP +sQ. If we rearrange the two scalars in w bit chunks and interleave those chunks we get a new scalar of double the size and 2w bit window chunks. Next we can precompute all 22w combinations of iP+jQ with i = 0...2 w−1 and j = 0...2 w − 1. Finally we run a normal window method. Hence the number of additions doubles, but the number of doubles stays the same. This trick can be applied in various forms. The most trivial application is for the ECDSA signature verification where exactly an expression like above appears. But also normal scalar multiplications can be brought in such a form. If we for instance know the base point in advance and the scalar has 192 bit, we can precompute 296P and then split the scalar to compute k96(296P)+k0P. However, even if the base point is not known in advance, there exist efficiently computable endomorphisms for some curves which still allow to gain speed by applying this method 
March 31st, 2019, 08:37 AM  #37 
Newbie Joined: Jan 2019 From: Australia Posts: 7 Thanks: 0  The DoubleBase Number System in Elliptic Curve Cryptograhy http://www.lirmm.fr/~imbert/talks/la...silomar_08.pdf 

Tags 
big, math, money, pay, task 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Rook chess math task  proofwriting  calculatormathematical  Math  2  September 11th, 2018 03:55 PM 
help with RV task  mysteryplanet  Advanced Statistics  1  October 8th, 2012 10:50 PM 
Need help to solve one math task  tiigrike  Algebra  1  October 31st, 2011 08:11 PM 