Expert: Sherman D. - 11/12/2005

Question
Mr Sherman ,
I have come to know that all mordern encryption algorithms deal with mathematical area known as "complexity theory".Reportedly used first by telecommunications engineers in analysing telepone switching networks .
                   please tell me precisely what  
is the mathematical framework of this theory.
Awaiting an early reply.
thank you for rewiewing this question.

Answer
The aim of algorithm design and complexity theory in parallel/distributed computing is to study efficient algorithms for (and limitations on the complexity of) problems, taking into account such parallel complexity measures as number of processing nodes or amount of communication in addition to classical measures such as time and space. Research areas such as development of efficient parallel algorithms on realistic parallel computation models, communication complexity, parallel complexity classes, and lower bounds for specific problems have received a lot of attention in recent years, but many important problems remain open. We invite papers concerning investigations in these areas.

Found at

http://europar.man.ac.uk/topics/06.html

This site may also be of some help.

http://www.protego.se/hcia.htm

By the way, i was watching a series called Numb3rs just last night, which talked about using algorithms to find cell phone signals.