Igor Shparlinski
Number Theoretic Methods in Cryptography: Complexity lower bounds - Progress in Computer Science and Applied Logic Igor Shparlinski Softcover reprint of the original 1st ed. 1999 edition

Name: Number Theoretic Methods in Cryptography: Complexity lower bounds - Progress in Computer Science and Applied Logic
Price: 377 CNY
Availability: OutOfStock
Author: Igor Shparlinski

价格

元 377

不含税

远程仓调货

预计送达时间年7月6日 - 年7月16日

顾客评价：

Top-vurdering på Google Reviews, baseret på tusinder af anmeldelser.

根据欧洲消费者保护法享受14天退换货政策

Trustpilot平台高分认证

添加至iMusic心愿单

其他版本：

Hardcover Book

1999 edition

(1999) 元 448

Number Theoretic Methods in Cryptography: Complexity lower bounds - Progress in Computer Science and Applied Logic

Igor Shparlinski

Softcover reprint of the original 1st ed. 1999 edition

The book introduces new techniques which imply rigorous lower bounds on the complexity of some number theoretic and cryptographic problems. These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1.

189 pages, 2 black & white illustrations

介质类型	图书 Paperback Book (平装胶订图书)
已发行	2012年10月8日
原始发行日期	1999
ISBN13	9783034897235
出版商	Springer Basel
页数	182
商品尺寸	155 × 235 × 10 mm · 285 g
语言	英语