I had the opportunity to take several projects in the field of computer security during undergraduate studies at Technion.
ECC is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields.
We chose to focus on a memory efficient algorithm variant of Satoh's algorithm, extending it to characteristic two, for counting the number of points on a given curve in order to to check whether it is divisible by a large prime number q, find a point p s.t. ord(p) is q, and then use the cyclic subgroup defined by <p>, the generating group of p, which is cryptographically strong due to the algebraic properties its elements acquire.
Pairing-based public key cryptography; in the words of the our mentor, Barukh Ziv:
"This is a fascinating new topic, which allows building unique PK systems, like Identity-Based Encryption. View pairing as a special map from 2 points on Elliptic Curve to multiplicative group of integers modulo big prime. Pairings were originally used for attacks on 'weak' Elliptic Curves. In 2000-s,constructive development of Cryptographic Schemes previously unknown or impractical: Short Digital Signatures, 1-Pass Three Person Key Exchange, Identity-Based Encryption. 'Communicating one bit of data uses significantly more power than executing one 32-bit instruction', Barr and Asanovich 2003".
On October 2005, Dean Sysman and I won 1st place at the International Robot Oplympiad (IROC) at the most interesting category - creativity, which involved four stages: theoretical physics exams, building a robot and software in 4 hours according to the 2005's goal theme - assistance for the handicapped, presentation and operation, and design of unknown concept beforehand.
The cost-efficient robot and software were designed and developed by us at Technion, under the supervision of Evgeny Korchnoy of the Technion I.I.T.
The robot was built to enable shaving by using voice commands to control the automated process.