1![Efficient String-Commitment from Weak Bit-Commitment Kai-Min Chung1, , Feng-Hao Liu2, , Chi-Jen Lu3 , and Bo-Yin Yang3 1 2 Efficient String-Commitment from Weak Bit-Commitment Kai-Min Chung1, , Feng-Hao Liu2, , Chi-Jen Lu3 , and Bo-Yin Yang3 1 2](https://www.pdfsearch.io/img/29db3d039ab7de227c45a6d3ff27ed2b.jpg) | Add to Reading ListSource URL: precision.moscito.orgLanguage: English - Date: 2011-03-20 04:03:37
|
---|
2![A Bit-fixing PRF with O(1) Collusion-Resistance from LWE Alex Davidson1,? and Ryo Nishimaki2 1 2 A Bit-fixing PRF with O(1) Collusion-Resistance from LWE Alex Davidson1,? and Ryo Nishimaki2 1 2](https://www.pdfsearch.io/img/45102166fe66bc300aba1485cc9cc616.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2018-10-18 18:40:38
|
---|
3![Location map Eichenweg 1, Zollikofen Federal Office of Information Technology, Systems and Telecommunication FOITT Arrival by public transportation Location map Eichenweg 1, Zollikofen Federal Office of Information Technology, Systems and Telecommunication FOITT Arrival by public transportation](https://www.pdfsearch.io/img/6f41408045d3c607ede19c7a57aa0f93.jpg) | Add to Reading ListSource URL: www.bit.admin.ch |
---|
4![Lecture 3, Tues Jan 24: Basic Rules of QM Tensor products are a way of building bigger vectors out of smaller ones. Let’s apply a NOT operation to the first bit, and do nothing to the second bit. That’s really the sa Lecture 3, Tues Jan 24: Basic Rules of QM Tensor products are a way of building bigger vectors out of smaller ones. Let’s apply a NOT operation to the first bit, and do nothing to the second bit. That’s really the sa](https://www.pdfsearch.io/img/62f16b091010cc368f6cf591e405dfec.jpg) | Add to Reading ListSource URL: www.scottaaronson.comLanguage: English - Date: 2018-08-29 13:55:03
|
---|
5![Cryptographic Function Detection in Obfuscated Binaries via Bit-precise Symbolic Loop Mapping Dongpeng Xu The Pennsylvania State University University Park, USA Email: Cryptographic Function Detection in Obfuscated Binaries via Bit-precise Symbolic Loop Mapping Dongpeng Xu The Pennsylvania State University University Park, USA Email:](https://www.pdfsearch.io/img/76e3eb90ffe192d36ac5f67e87169330.jpg) | Add to Reading ListSource URL: www.ieee-security.orgLanguage: English - Date: 2017-04-03 15:56:44
|
---|
6![Security Bounds for the NIST Codebook-based Deterministic Random Bit Generator Matthew J. Campagna Secure Systems Pitney Bowes Inc. Security Bounds for the NIST Codebook-based Deterministic Random Bit Generator Matthew J. Campagna Secure Systems Pitney Bowes Inc.](https://www.pdfsearch.io/img/7c427e0d7489bf59b0219090bad84c3e.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2006-11-01 07:43:52
|
---|
7![GreenArrays ® AN007 A Bit-Banged 10baseT NIC GreenArrays ® AN007 A Bit-Banged 10baseT NIC](https://www.pdfsearch.io/img/4d1c4361cbb5b57c92960202c1a960d2.jpg) | Add to Reading ListSource URL: www.greenarraychips.comLanguage: English - Date: 2014-11-12 12:21:11
|
---|
8![Location map Monbijoustrasse 74, Bern Federal Office of Information Technology, Systems and Telecommunication FOITT Arrival by public transportation Location map Monbijoustrasse 74, Bern Federal Office of Information Technology, Systems and Telecommunication FOITT Arrival by public transportation](https://www.pdfsearch.io/img/23b6e9a2dd075133673c3a4871b0adbd.jpg) | Add to Reading ListSource URL: www.bit.admin.ch |
---|
9![An MCSAT treatment of Bit-Vectors (preliminary report) St´ephane Graham-Lengrand1,2 and Dejan Jovanovi´c1 1 2 An MCSAT treatment of Bit-Vectors (preliminary report) St´ephane Graham-Lengrand1,2 and Dejan Jovanovi´c1 1 2](https://www.pdfsearch.io/img/01974e4a4cf5b7b477481bd89b346c12.jpg) | Add to Reading ListSource URL: smt-workshop.cs.uiowa.eduLanguage: English - Date: 2017-09-02 14:08:49
|
---|
10![Cofactorisation strategies for the number field sieve and an estimate for the sieving step for factoring 1024-bit integers Thorsten Kleinjung University of Bonn, Department of Mathematics, Beringstraße 1, DBonn, Cofactorisation strategies for the number field sieve and an estimate for the sieving step for factoring 1024-bit integers Thorsten Kleinjung University of Bonn, Department of Mathematics, Beringstraße 1, DBonn,](https://www.pdfsearch.io/img/6927c34a84f6c9bced20b149413ece97.jpg) | Add to Reading ListSource URL: www.hyperelliptic.orgLanguage: English - Date: 2006-03-21 11:54:50
|
---|