关于proofs of ownership的结构的一个伪代码，求大神讲解！

iris0708 2015-01-28 04:13:52

这是一个基于流协议的文件所有权证明的架构伪代码，没太看懂，里面用到了循环移位、异或之类的知识点，本人代码比较烂，求大神给我讲讲呗~

...全文

466 回复打赏收藏转发到动态举报

写回复

回复

切换为时间正序

请发表友善的回复…

发表回复

孪生素数猜想与弱波林那克猜想的证明，徐万东，，本文提出了一种用数学黑度覆盖素数相碰对的方法, 对奇数堆垒中的素数进行覆盖, 证明了若孪生素数猜想和弱波林那克猜想不成立, 则在

Proofs from THE BOOK is a book of mathematical proofs by Martin Aigner and Günter M. Ziegler. The book is dedicated to the mathematician Paul Erdős, who often referred to "The Book" in which God keeps all of the most elegant proofs of mathematical theorems. During a lecture in 1985, Erdős said, "You don't have to believe in God, but you should believe in The Book." Proofs from THE BOOK contains 32 different sections, each devoted to one theorem but often containing multiple proofs and related results. It spans a broad range of mathematical fields: number theory, geometry, analysis, combinatorics and graph theory. Erdős himself made many suggestions for the book, but died before its publication. The book is illustrated by Karl Heinrich Hofmann. It has gone through three editions in English, and has also been translated into Persian, French, German, Hungarian, Italian, Japanese, Chinese, Polish, Portuguese, Russian and Spanish. Additional translations into Korean and Turkish are in preparation. The proofs include: * Proof of Bertrand's postulate * Proof that e is irrational (also showing the irrationality of certain related numbers) * Five proofs of the infinitude of the primes, including Euclid's and Furstenberg's.

能用这一工具来证明在密码学中某些安全性问题。

This text makes a great supplement and provides a systematic approach for teaching undergraduate and graduate students how to read, understand, think about, and do proofs. The approach is to categorize, identify, and explain (at the student's level) the various techniques that are used repeatedly in all proofs, regardless of the subject in which the proofs arise. How to Read and Do Proofs also explains when each technique is likely to be used, based on certain key words that appear in the problem under consideration. Doing so enables students to choose a technique consciously, based on the form of the problem.

It is well known that all the known black-box zero-knowledge proofs of knowledge for NP are non-constant-round. Whether there exit constant-round black-box zero-knowledge proofs of knowledge for all NP languages under certain standard assumptions is an open problem. This paper focuses on the problem and gives a positive answer by presenting two constructions of constant-round (black-box) zero-knowledge proofs of knowledge for the HC (hamiltonian cycle) problem. By the recent result of Katz, our

202

社区成员

447

社区内容

发帖

与我相关

我的任务

数据库数据库架构数据库开发技术论坛（原bbs）

社区管理员

加入社区

近7日
近30日
至今

加载中

查看更多榜单

社区公告

暂无公告

试试用AI创作助手写篇文章吧

+ 用AI写文章