теперь уже в рамках полученного в.п.с. большого гранта, имеем две позиции для аспирантов:
вот формальное объявление:
At Nanyang Technological University (NTU) in Singapore, we (me, and
Profs. Sinai Robins and Le Hai Khoi) received a substantial (~500K$)
grant for a project on the border of polyhedral computation, including
lattice points in polytopes, multi-dimensional moment problem (moments
meant as moments of measures), C-convexity, and numerical computing.
A part of the mathematics involved can be seen in http://arxiv.org/abs/1106.5723
We have funding for two (or more) PhD students (4-year fully funded
positions with a stipend --- 2000$ per month in the 1st 1 or 1.5 year,
then 2500$ per month),
a postdoc (for up to 3 years, minimum duration of 3 months---i.e. if you can only come for such a relatively
short period, this is still possible to arrange), and a research
associate (for up to 3 years, minimum degree required is a BSc or
equivalent), as well as funding for more senior short-term visitors.
Funding starts in November 2011.
Successful applicants ideally should have background in at least one
of topics mentioned above, and have interest and experience in
developing software packages related to these topics (preferably using
open-source systems, and ideally Python and Sage).
PhD applications will go through a usual NTU admission procedure.http://admissions.ntu.edu.sg/graduate/R ... fault.aspx
In case you are US-based, and (or) will attend the SIAG/SIAM meeting
in Raleigh (http://www.siam.org/meetings/ag11/
in October, I will be there (and my talk with be on a topic within the project).
Otherwise, I am happy to answer your emails, etc.
Please distribute this among potentially interested people, and
re-post to relevant lists.
Research Assistant/Research Associate in Cryptography (two posts) (ref. 16651)
Department of Computer Science
Contract: Fixed Term Contract (3 - 4 years)
Salary: £29,972 - £37,990
Grade: Level a - Level b in Pathway 2
Closing date for applications: 9:00am 01 Nov 2011
Based in the Cryptography group within the Department of Computer Science, you will work on one of the the areas of cryptography detailed below.
You will have a background in either lattice based cryptography or computational number theory. The project is to examine various aspects of lattices related to Fully Homomorphic Encryption schemes. We would be interested in applicants who can contribute on the mathematical analysis of the underlying hard lattice problems (either theoretically or experimentally), or in applicants who can contribute on the cryptographic side by developing new schemes and protocols.
You will have a background in formal security protocol analysis. The project is to examine how “cryptographic proofs” can be automated by using techniques from formal methods, allied with tools and techniques from programming language theory. Experience with using a tool such as ProVerif, CryptoVerif, Isabelle, FDR would be an advantage, but not required. Applicants who are interested in applying these techniques to real world protocols are encouraged to apply.
Applicants with a strong theoretical or practical understanding in other aspects of modern cryptography are also encouraged to apply, if they feel they could contribute to the projects detailed above.
The posts are funded by an ERC Advanced Grant awarded to Professor Nigel Smart and you will work closely with members of the Cryptography research group; in particular Professor Nigel Smart, and Dr Bogdan Warinschi.
The expected starting date will be as soon as possible depending on your circumstances.Salary dependent on experience and qualifications. Please indicate whether you wish to apply for position 1, 2 or both on your application form.