Get an update on changes of the IACR web-page here. For questions, contact newsletter (at) iacr.org. You can also receive updates via:
To receive your credentials via mail again, please click here.
You can also access the full news archive.
If you have a passion for excellence and a drive to achieve, you belong at AMD. Our employees work hard, have fun, and thrive on success. We meet the challenges of an evolving marketplace by staying true to our corporate values, including an unwavering respect for individuals and a focus on retaining superior employees.
AMD is currently seeking a Senior Cryptographer for a mission-critical technical leadership position.
The Protection Team within the Multimedia Drivers Department provides ownership of the environment used to enable Premium Video Content Playback and Platform Security. The team delivers components to support various standards in Content Protection and System Security.
- University Degree in Computer Science, Engineering, Mathematics, Physics, etc.
- Optional: Post Graduate Degree in Computer Science, Engineering, Mathematics, Physics, etc.
The ideal candidate will fill a leadership role while providing ownership for specific components and projects. Pre-existing familiarity with applied cryptography and security protocols will be essential to ongoing assignments:
- Design and implement security solutions
- Assist in resolution of customer, quality and certification issues
- Actively participate in design reviews and discussions
REQUIRED SKILLS AND EXPEREINCE:
- Familiarity with system security and cryptographic algorithms (like AES,
Applicants are expect to have a PhD degree in Mathematics/Computer Science/Engineering and a strong background and experience in one or two of the following areas : stream ciphers, pseudorandom number generator, public-key cryptography.
Preferred candidates are expected to be proficient in C/C++ language, a team worker and able to conduct independent research.
Review of applications will start immediately and continue until positions are filled.
For application information, please visit http://www.temasek-lab.nus.edu.sg/career/career.php. Interested candidates can contact Dr Tan Chik How tsltch (at) nus.edu.sg.
The candidate needs to have obtained a masters degree in Computer Science or Applied Mathematics with outstanding grades. Knowledge on provable security and public-key cryptography is an advantage.
The PhD thesis needs to be written in English and will be awarded by the University of Luxembourg.
Please apply via the link provided below.
\r\nModern communications heavily rely on cryptography to ensure data integrity and privacy. Over the past two decades, very efficient, secure, and featureful cryptographic schemes have been built on top of abelian varieties defined over finite fields. This thesis contributes to several computational aspects of ordinary abelian varieties related to their endomorphism ring structure.\r\n\r\nThis structure plays a crucial role in the construction of abelian varieties with desirable properties. For instance, pairings have recently enabled many advanced cryptographic primitives; generating abelian varieties endowed with efficient pairings requires selecting suitable endomorphism rings, and we show that more such rings can be used than expected.\r\n\r\nWe also address the inverse problem, that of computing the endomorphism ring of a prescribed abelian variety, which has several applications of its own. Prior state-of-the-art methods could only solve this problem in exponential time, and we design several algorithms of subexponential complexity for solving it in the ordinary case.\r\n\r\nFor elliptic curves, our algorithms are very effective and we demonstrate their practicality by solving large problems that were previously intractable. Additionally, we rigorously bound the complexity of our main algorithm assuming solely the extended Riemann hypothesis. As an alternative to one of our subroutines, we also consider a generalization of the subset sum problem in finite groups, and show how it can be solved using little memory.\r\n\r\nFinally, we generalize our method to higher-dimensional abelian varieties, for which we rely on further heuristic assumptions. Practically speaking, we develop a library enabling the computation of isogenies between abelian varieties; using this important building block in our main algorithm, we apply our generalized method to compute several illustrative and record examples.[...]