Theory and application of trapdoor functions

A. Yao
{"title":"Theory and application of trapdoor functions","authors":"A. Yao","doi":"10.1109/SFCS.1982.95","DOIUrl":null,"url":null,"abstract":"The purpose of this paper is to introduce a new information theory and explore its appplications. Using modern computational complexity, we study the notion of information that can be accessed through a feasible computation. In Part 1 of this paper, we lay the foundation of the theory and set up a framework for cryptography and pseudorandom number generation. In Part 2, we study the concept of trapdoor functions and examine applications of such functions in cryptography, pseudorandom number generation, and abstract complexity theory.","PeriodicalId":127919,"journal":{"name":"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1982-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1084","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1982.95","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1084

Abstract

The purpose of this paper is to introduce a new information theory and explore its appplications. Using modern computational complexity, we study the notion of information that can be accessed through a feasible computation. In Part 1 of this paper, we lay the foundation of the theory and set up a framework for cryptography and pseudorandom number generation. In Part 2, we study the concept of trapdoor functions and examine applications of such functions in cryptography, pseudorandom number generation, and abstract complexity theory.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
活板门函数的理论与应用
本文的目的是介绍一种新的信息理论并探讨其应用。利用现代计算复杂性,我们研究了可通过可行计算访问的信息的概念。在本文的第一部分中,我们奠定了理论基础,并建立了密码学和伪随机数生成的框架。在第2部分中,我们研究了陷阱门函数的概念,并研究了这些函数在密码学、伪随机数生成和抽象复杂性理论中的应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An application of higher reciprocity to computational number theory Inferring a sequence generated by a linear congruence On driving many long lines in a VLSI layout Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is S2p-complete An efficient approximation scheme for the one-dimensional bin-packing problem
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1