From: roob noob Date: 2012-07-26T06:21:33+09:00 Subject: Re: modular exponentation with multiple exponents? Jan E. wrote in post #1070171: > Sorry, but this simply makes no sense. A professional certainly would > write the code himself rather than try to make something out of yours > (no offense, but this is not high school math). > > So if this is a serious project, hire someone to do it. Otherwise you > obviously don't need it. > > Half baked security is probably even worse than no security at all, > because it provides you with a false feeling of safety. If I follow a specification and do plenty of research, I don't see why it will be less safe to use it after cryptographers confirm it is properly implemented, than if they write it themselves and claim it is properly implemented. I am not interested in hiring someone to do it and I have plenty contacts who know crypto well and who will look over code I write for me and tell me where my mistakes are, but who are not interested in writing entire algorithms for me (and equally I am not interested in asking them to do such a thing). I found the answer to my question, it is asking for ((((a ^ b) mod f) ^ c) mod f)) ^ d) mod f) etc (something I thought may be the case, although I was by no means sure) which is equal to a^b*c*d*etc mod f (which is probably how I should have read it in the first place, doh) anyway I apologize for a question that had only a minor relation to Ruby, however I do think you are wrong to think that a well researched project implemented from a spec and reviewed by professionals will certainly end up being worse than a project made by someone who has already done the research to become a professional. The only difference I see is that they would not need to do as much research as I do , due to already having done it. -- Posted via http://www.ruby-forum.com/.