Mohsen Keikhaie

Mohsen Keikhaie
Iran University of Science and Technology · School of Mathematics

PhD Student

About

Introduction
I was born in Afous (the most western point of Isfahan province). My favorite field, is combinatorics and graph theory and cryptography. I am also working in the context of elliptic curves.

Questions

Questions (15)
Question
Hi.
Please change the picture of header site. That is "2th International Conference on Combinatorics, Cryptography and Computation".
Thank you.
Question
I have a html landing page. I want to redirect some visitors to different links with same domain . maybe I have not list of this links , because those are update every days. How I can do it with scripts and javascripts ?
I searched it, but didn't find anything. Please note that country, IP, login or logged out and anything else do not matter. Just redirecting some visitors(about 50%) to different affiliate links with same domain disregarding where they are coming from or via which country or device nor any such conditions... No conditions.. I found some scripts which redirect specific country or device visitors, but I am not looking for this. Hope, I explained properly. Or, please ask me if I failed to explain...
Thank you All .
Question
I have a string : "hello" and how to can I compile this string with rule Compile with no error by mathematica software ?
For example : Compile[{{}},...]["hello"]  .
Is this possible with C or C++ or Java ...?
Question
I have a set A={1,2,3,4,5,6};
and Deffined compiler c like as : 
c=Compile[{{y, _Integer}}, ToString[y], RuntimeAttributes -> {Listable},
Parallelization -> True, CompilationTarget -> "C"];
When I run c[A] , an error is sow that output is a string and is not machine-size integer .
Now , Is there any rule or a technique in mathematica software that can be use in rule Compile within input integer size and create output from form string?
Thank you all .
Question
 In Mathematica Software I have a set of numbers and I want past them together and produce a bigger number . For example I have S={102,3,1569,54} , I want create bigger number 1023156954 that I to can compute 2016*1023156954/2050+2017-2020 and do any computing actions ... . In fact I want create bigger number that I can compute next computations with bigger number . Can I do this work in any other software or program language like as Java or C or C++ and so on ?
In Mathematica Software or any other software or Language Programing How to create a bigger number with a set of small numbers ? 
Question
Please introduce a way to computed reminder of large numbers divisions with compiled processing . For example if ab are tow 160 bits numbers , we need to [a/b] and a mod b such that this computations compiled using machine .  Thank you all .
Question
I have a program that write with parallel programming in mathematica software on one CPU, this program run good & excellent . If I have several computers(CPUs) that are network together, how to run this program in this case? I want my run time for this program in new conditions, divides to number of CPUs, is this possible?
Thank you all .
Question
If A1,...,An be users in a network , and they want to use El-Gamal cryptosystem for their cryptography . I want to know what amount of memory used for the job better for every one of A1 , ... , An. for example n=2^10 . In fact in this example how many initial points is better to use ??
For example If I use about 100 initial point in my program and If keys sizes are 512 bits , 2*100*2^10*512 bits memory need for every users . 2^20*100 bits = 12.5 MB !!!  Is it colophon & reasonable ?
Thank you all .

Projects

Projects (2)
Project
In greedy algorithm, we try to find optimized of one function F on one problem . In fact , function F operate on only one condition of problem in every step . For example , we have one number n , and try to write n to form of sum of several terms 2^a_{i} ... (binary method) and a_{i+1}<=a_{i}. We find near term 2^a_{i} to n and let n=|n-2^a_{i}| and continue this step while n>0. If our terms was to form (3^a_{i})*(5^b_{i}) and we try to write n= Sum(3^a_{i} * 5^b_{i}) , i=1,...,(While n>0) , a_{i+1}<=a_{i} , b_{i+1}<=b_{i} . Can greedy algorithm find fact minimum of those terms ? or we need to other algorithm ... ? I have try to find good and effective algorithm to solve twice problem . Controled Greedy Algorithm is name of my trying to solve this problem . I hope you help to me in this project .
Project
So far, only an algorithm for calculating the number of non-isomorphism trees without labeling on n vertices is provided. That presentations by N.J.A.Sloane . But, So far using two basic principles in the Combinatorics, not presentation formulas . Maybe beauty of two basic principles in math and Combinatorics is one of the reason for this problem. In fact history of mathematics are indebted to these two principles . I have provided a formula for counting non-isomorphism trees on n vertices with recurrence relation and based on this tow principles . For examples the number of trees with 7 vertexes is 11 or number of trees with 8 vertexes is 23 and ... . Maybe this counting by these two basic principles presentation one way to control complexity of trees and trees labeling and especially graceful tree conjecture.