找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Black-Box Models of Computation in Cryptology; Tibor Jager Book 2012 Springer Spektrum | Springer Fachmedien Wiesbaden 2012 Black-Box Mode

[复制链接]
查看: 36534|回复: 35
发表于 2025-3-21 19:56:32 | 显示全部楼层 |阅读模式
期刊全称Black-Box Models of Computation in Cryptology
影响因子2023Tibor Jager
视频video
发行地址Black-Box Models of Computation
图书封面Titlebook: Black-Box Models of Computation in Cryptology;  Tibor Jager Book 2012 Springer Spektrum | Springer Fachmedien Wiesbaden 2012 Black-Box Mode
影响因子.Generic group algorithms solve computational problems defined over algebraic groups without exploiting properties of a particular representation of group elements. This is modeled by treating the group as a black-box. The fact that a computational problem cannot be solved by a reasonably restricted class of algorithms may be seen as support towards the conjecture that the problem is also hard in the classical Turing machine model. Moreover, a lower complexity bound for certain algorithms is a helpful insight for the search for cryptanalytic algorithms.. .Tibor Jager addresses several fundamental questions concerning algebraic black-box models of computation: Are the generic group model and its variants a reasonable abstraction? What are the limitations of these models? Can we relax these models to bring them closer to the reality?.
Pindex Book 2012
The information of publication is updating

书目名称Black-Box Models of Computation in Cryptology影响因子(影响力)




书目名称Black-Box Models of Computation in Cryptology影响因子(影响力)学科排名




书目名称Black-Box Models of Computation in Cryptology网络公开度




书目名称Black-Box Models of Computation in Cryptology网络公开度学科排名




书目名称Black-Box Models of Computation in Cryptology被引频次




书目名称Black-Box Models of Computation in Cryptology被引频次学科排名




书目名称Black-Box Models of Computation in Cryptology年度引用




书目名称Black-Box Models of Computation in Cryptology年度引用学科排名




书目名称Black-Box Models of Computation in Cryptology读者反馈




书目名称Black-Box Models of Computation in Cryptology读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:24:41 | 显示全部楼层
发表于 2025-3-22 02:38:42 | 显示全部楼层
发表于 2025-3-22 04:55:21 | 显示全部楼层
发表于 2025-3-22 10:01:29 | 显示全部楼层
. .Tibor Jager addresses several fundamental questions concerning algebraic black-box models of computation: Are the generic group model and its variants a reasonable abstraction? What are the limitations of these models? Can we relax these models to bring them closer to the reality?.978-3-8348-1989-5978-3-8348-1990-1
发表于 2025-3-22 14:46:14 | 显示全部楼层
发表于 2025-3-22 17:59:51 | 显示全部楼层
发表于 2025-3-22 23:43:15 | 显示全部楼层
发表于 2025-3-23 04:25:06 | 显示全部楼层
Introduction,Therefore it is important to study the validity of these assumptions. Ideally, we would like to show that these assumptions hold in a standard model of computation, e.g. where algorithms intending to solve a computational problem are modeled as Turing machines with reasonably restricted running time
发表于 2025-3-23 06:15:02 | 显示全部楼层
Black-Box Models of Computation,, Sho97, Mau05]. The black-box model we are going to describe in the sequel is a generalization of the model introduced by Maurer in [Mau05], which in turn can be seen as a generalization of the model of [Sho97]. While Maurer‘s model captures only the case where a generic algorithm operates on eleme
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-18 05:55
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表