Primality Testing and Integer Factorization in Public-Key Cryptography

计算机系统结构

原   价:
1657.5
售   价:
1326.00
优惠
平台大促 低至8折优惠
作      者
出  版 社
出版时间
2010年11月29日
装      帧
平装
ISBN
9781441945860
复制
页      码
374
语      种
英语
版      次
2
综合评分
暂无评分
我 要 买
- +
库存 30 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介

The Primality Testing Problem (PTP) has now proved to be solvable in deterministic polynomial-time (P) by the AKS (Agrawal-Kayal-Saxena) algorithm, whereas the Integer Factorization Problem (IFP) still remains unsolvable in (P). There is still no polynomial-time algorithm for IFP. Many practical public-key cryptosystems and protocols such as RSA (Rivest-Shamir-Adleman) rely their security on computational intractability of IFP.

Primality Testing and Integer Factorization in Public Key Cryptography, Second Edition, provides a

本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个