Practical Identity-Based Cryptography: Efficient and Secure Elliptic Curve Pairings. Bilinear pairings on elliptic curves are a new cryptographic tool and allow novel and improved applications in information security. For example, they have been proposed as a substitute of existing public key infrastructures, an essential element in electronic commerce and a secure Internet. The research will lead to an increase in fundamental knowledge in the area of practical implementation and secure applic ....Practical Identity-Based Cryptography: Efficient and Secure Elliptic Curve Pairings. Bilinear pairings on elliptic curves are a new cryptographic tool and allow novel and improved applications in information security. For example, they have been proposed as a substitute of existing public key infrastructures, an essential element in electronic commerce and a secure Internet. The research will lead to an increase in fundamental knowledge in the area of practical implementation and secure applications of pairings. The results will benefit all users of electronic communications who require security for their information. This includes the financial industries, government, commerce and domestic users. It will also support many new product opportunities aligned with Motorola's business markets.Read moreRead less
Exploring the Frontiers of Feasible Computation. The project aims to delineate the boundary between feasible and infeasible computational problems. A problem is considered feasible if there is an algorithm to solve it in worst-case time bounded by a polynomial in the input size. This is probably impossible for the important class of NP-complete problems. However, typical examples of NP-complete problems can often be solved in polynomial time, because worst-case problems are rare. The project is ....Exploring the Frontiers of Feasible Computation. The project aims to delineate the boundary between feasible and infeasible computational problems. A problem is considered feasible if there is an algorithm to solve it in worst-case time bounded by a polynomial in the input size. This is probably impossible for the important class of NP-complete problems. However, typical examples of NP-complete problems can often be solved in polynomial time, because worst-case problems are rare. The project is relevant to public-key cryptography, where breaking an encryption scheme should be infeasible, and to many real-life situations where NP-complete problems need to be solved, either exactly or approximately.Read moreRead less