NSF-CGP-Fellowship: Concrete Complexity of Number-TheoreticProblems of Importance to Cryptography

NSF-CGP 奖学金：对密码学重要的数论问题的具体复杂性

• 批准号: 9729662
• 负责人: Rene Peralta
• 金额: $ 2.9万
• 依托单位: University of Wisconsin-Milwaukee
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1998
• 资助国家: 美国
• 起止时间: 1998-07-01 至 2000-05-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9729662&HistoricalAwards=false
• 关键词: NSF; CGP; Fellowship; Concrete; Complexity

9729662 Peralta This award provides funds to support two three-month research visits by Dr. Rene C. Peralta, Center for Cryptography, Computer and Network Security (CCCNS), University of Wisconsin-Milwaukee, for collaboration with Dr. Eiji Okamoto, School of Information Science, Japan Advanced Institute of Science and Technology (JAIST), Ishikawa, Japan. Their research is concerned with the design and implementation of algorithms which solve, for as large a size as possible, those number-theoretic problems which are the pillars of modern cryptography. Determining what "small-size" is too small to be secure is the main focus of this research project. The project will consider a host of problems such as primality testing, fast arithmetic with large numbers, diophantine approximation, rapid factorization of small numbers, factorization of random numbers, and other problems that may arise as the research progresses. The project will benefit from access to the massive computational resources, five supercomputers, available at the host institution. Collaboration with JAIST also will provide access to untranslated Japanese literature and access to symposia where Japanese research results can be received without the usual delay in availability to the West. The project is mutually beneficial as it will provide ready access by the Japanese collaborators to research results at CCCNS. This project is supported under the Science Fellowship Program between the National Science Foundation and the Japan Foundation Center for Global Partnership. ***

小行星9729662 该奖项提供资金，以支持两个为期三个月的研究访问博士。Peralta，密码学，计算机和网络安全中心（CCCNS），威斯康星大学密尔沃基分校，与博士Eiji冈本，信息科学学院，日本科学技术高级研究所（JAIST），石川，日本。 他们的研究关注的是设计和实现的算法，解决尽可能大的规模，这些数论问题是现代密码学的支柱。 确定什么是“小尺寸”太小而不安全是这个研究项目的主要重点。 该项目将考虑许多问题，例如素性测试、大数快速算术、丢番图逼近、小数的快速因式分解、随机数的因式分解以及随着研究进展可能出现的其他问题。该项目将受益于利用东道机构现有的五台超级计算机这一庞大的计算资源。 与JAIST的合作还将提供未翻译的日本文献和研讨会的机会，在这些研讨会上，日本的研究成果可以在没有通常的延迟的情况下被西方接受。 该项目是互惠互利的，因为它将使日本合作者能够随时获得CCCNS的研究成果。 该项目得到了国家科学基金会和日本基金会全球伙伴关系中心之间的科学奖学金计划的支持。 ***