Techniques for solving graph problems in parallel environments

Peter H. Hochschilld,Ernst W. Mayr,Alan R. Siegel

Tucson, AZ, USA（1983）

引用 18|浏览1

暂无评分

摘要

We define the class of trapdoor pseudo-random number generators, and introduce a new technique for using these in cryptography. As an application for this technique, we present a provably secure protocol for One-Bit Disclosures i.e. for giving a one-bit ...

查看译文

关键词

one-bit disclosures,parallel environment,trapdoor pseudo-random number generator,graph problem,provably secure protocol,new technique,very large scale integration,mathematical logic,computer architecture,algorithm design and analysis,schedules,graphs,lead,force,resource management,concurrent computing,parallel algorithms,registers,filtration,integrated circuit,algorithms,circuits,connected component,parallel processing,finite impulse response filter,switches,integrated circuits,electronic circuits,binary trees,filtering,pipelines

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要