Cryptographically relevant contributions to combinational complexity theory

Cryptographically relevant contributions to combinational complexity theory

by Alain P. L. Hiltgen

Book 3 of v.

1994
Join Readfeed freeFind clubs reading this
Rate this book:

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
"The provability of certain cryptographic assumptions and, more generally, the existence of provable practical security is investigated. It is argued why combinatorial complexity is the complexity measure that is most suited if the security of practical crytographic applications is to be proved."--p. iii.

Discuss Cryptographically relevant contributions to combinational complexity theory with other readers

Join or start a book club for Cryptographically relevant contributions to combinational complexity theory on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Sign up freeBrowse book clubs

Frequently asked questions

How do I join a book club for Cryptographically relevant contributions to combinational complexity theory?

Sign up free on Readfeed, then browse public clubs or start your own club with Cryptographically relevant contributions to combinational complexity theory as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Cryptographically relevant contributions to combinational complexity theory with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Cryptographically relevant contributions to combinational complexity theory with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.