Comments for Eric Hohenstein
https://erichohenstein.com
Wed, 28 Mar 2018 17:09:30 +0000
hourly
1 https://wordpress.org/?v=5.2.2
Comment on Semi-prime modular square root of 1 revisited by Eric Hohenstein
https://erichohenstein.com/2018/01/semi-prime-modular-square-root-of-1-revisited/#comment-449
Wed, 28 Mar 2018 17:09:30 +0000https://erichohenstein.com/?p=1048#comment-449If the factorization of m is known then the matrix can be obtained with O(log(n)) complexity using the algorithm described in the wikipedia article about the tree of Pythagorean triples: https://en.wikipedia.org/wiki/Tree_of_primitive_Pythagorean_triples. As I mentioned in my previous post about this subject, this is not necessarily the best way of finding the modular square root of 1, mod m, when the factorization of m is known. My objective was only to illustrate an interesting relationship between the tree of Pythagorean triples and modular square roots.
]]>
Comment on Semi-prime modular square root of 1 revisited by Nikhilesh Chamarthi
https://erichohenstein.com/2018/01/semi-prime-modular-square-root-of-1-revisited/#comment-448
Wed, 28 Mar 2018 08:03:25 +0000https://erichohenstein.com/?p=1048#comment-448We can solve the problem without explicitly obtaining that matrix. We can just use the Properties of the matrix you have proved and solve the problem with Extended Euclidean Algorithm. As you told we can obtain answer in O(1) once we have the corresponding matrix. But I don’t think complexity of obtaining that matrix is O(1) because right inverse doesn’t exist for 2 x 1 matrix. Correct me if I am wrong. What is the complexity of obtaining that matrix according to you?
]]>
Comment on Semi-prime modular square root of 1 revisited by Eric Hohenstein
https://erichohenstein.com/2018/01/semi-prime-modular-square-root-of-1-revisited/#comment-438
Wed, 14 Mar 2018 18:50:43 +0000https://erichohenstein.com/?p=1048#comment-438I’m not quite sure what you mean. Having the matrix corresponding to m, the modular square root of m can be calculated in O(1) since it is just sqrt((m(a^2 – c^2)) + 1). Can you explain more?
]]>
Comment on Semi-prime modular square root of 1 revisited by Nikhilesh Chamarthi
https://erichohenstein.com/2018/01/semi-prime-modular-square-root-of-1-revisited/#comment-437
Wed, 14 Mar 2018 07:36:03 +0000https://erichohenstein.com/?p=1048#comment-437This is a great idea. I have an optimisation for your approach that can solve the problem in O(ln(max (p, q)) . I want to discuss it with you personally. Can u respond to my E-Mail for the same. Thank u.
]]>
Comment on Some surprising Erlang behavior by Eric
https://erichohenstein.com/2015/08/some-surprising-erlang-behavior/#comment-241
Tue, 28 Feb 2017 08:44:41 +0000https://erichohenstein.com/?p=8#comment-241The strategy of using send/3 with nosuspend/noconnect was intended to solve a specific problem when one host in an erlang cluster temporarily (or permanently) goes network silent. I have tested this method thoroughly using several different versions of erlang including R15B01, R16, and R18 and found it to effectively mitigate this problem. If you are not having luck with this it may be that the problem you are experiencing is actually a different one.
]]>
Comment on Some surprising Erlang behavior by P S
https://erichohenstein.com/2015/08/some-surprising-erlang-behavior/#comment-220
Thu, 02 Feb 2017 22:52:49 +0000https://erichohenstein.com/?p=8#comment-220Hey Eric-

I’m having this very problem with a highly distributed media server right now. Have you thought any more about this issue? I tried what you suggested with nosuspend/noconnect, but the blocking persists.