课题基金 / 基金详情

Number-theoretic cryptography

Number-theoretic cryptography
数论密码学
批准号:
238473-2006
负责人:
Teske, Edlyn
金额:
$1.02万
依托单位:
依托单位国家:
加拿大
项目类别:
Discovery Grants Program - Individual
财政年份:
2007
资助国家:
加拿大
项目状态:
已结题
起止时间:
2007-01-01 至 2008-12-31

项目摘要

项目成果

Teske, Edlyn的其他基金

相似基金

相关文献

中文摘要
翻译
公钥密码系统是私人、商业和政府用户广泛采用的一项关键技术,用于确保电子数据通信中的隐私和真实性。大多数公钥密码系统的安全性都是基于某个数论问题的难度。这些问题被认为是困难的,但没有得到证实。最常见的例子是整数因式分解问题,它构成了Rivest-Shamir-Adleman(RSA)密码系统的基础。与这一建议相关的例子是椭圆曲线上点组中的离散对数问题(ECDLP)和有限域上多元二次(MQ)方程组的求解问题。本研究旨在进一步探讨所选公钥密码体制的数论和代数性质。这既包括与安全有关的方面,也包括效率方面。具体地说,我们预计将确定更多可能不太安全的ECDLP实例。鉴于基于椭圆曲线的密码系统在智能卡等受限计算环境中代表了最有效的安全增强解决方案,这些结果引起了研究人员和实践者的极大兴趣。我们还期望使用双线性对生成用于高安全性密码系统应用的最优系统参数。双线性对在密码学中的使用导致了令人兴奋的新应用,例如第一个可行的和可证明安全的基于身份的加密方案。此外,我们期望对基于MQ方程的密码系统的安全性有更好的理解。这样的密码系统还有一个额外的优势,那就是它们不容易受到量子计算机的攻击。在我们的研究中,我们将使用计算数论和代数几何的工具,结合实验工作和理论研究。
英文摘要
Public-key cryptosystems are a key technology widely deployed by private, commercial and governmental users to ensure privacy and authenticity in electronic data communications. The security of most public-key cryptographic systems is based on the difficulty of a certain number-theoretic problem. These problems are believed, but not proven, to be hard. The most popular example is the integer factorization problem, which forms the basis for the Rivest-Shamir-Adleman (RSA) cryptosystem. Examples relevant for this proposal are the discrete logarithm problem in the group of points on an elliptic curve (ECDLP) and the problem of finding solutions to systems of multivariate quadratic (MQ) equations over finite fields. The proposed research is to further explore the number-theoretic and algebraic properties of selected public-key cryptosystems. This includes both security-related aspects and aspects of efficiency.   Specifically, we expect to identify further possibly less secure instances of the ECDLP. Such results are of extreme interest to both researchers and practitioners, given that elliptic curve-based cryptosystems represent the most efficient security-enhancing solution in constrained computing environments such as smart cards. We further expect to generate optimal system parameters for high-security applications of cryptosystems using bilinear pairings. The use of bilinear pairings in cryptography has led to exciting novel applications such as the first workable and provably secure identity-based encryption scheme. Moreover, we expect to achieve a better understanding of the security of cryptosystems based on MQ equations. Such cryptosystems have the added advantage that they are not vulnerable to attacks performed by quantum computers. In our research, we will be using tools from computational number theory and algebraic geometry, combining experimental work and theoretical investigation.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Number-theoretic cryptography
  • 批准号:
    238473-2006
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.02万
  • 财政年份:
    2014
  • 负责人:
    Teske, Edlyn
  • 依托单位:
Number-theoretic cryptography
  • 批准号:
    238473-2006
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.02万
  • 财政年份:
    2013
  • 负责人:
    Teske, Edlyn
  • 依托单位:
Number-theoretic cryptography
  • 批准号:
    238473-2006
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.02万
  • 财政年份:
    2012
  • 负责人:
    Teske, Edlyn
  • 依托单位:
Number-theoretic cryptography
  • 批准号:
    238473-2006
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.02万
  • 财政年份:
    2009
  • 负责人:
    Teske, Edlyn
  • 依托单位:
海外基金