Sandi Feistel (Indonesian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Sandi Feistel" in Indonesian language version.

refsWebsite

Global rank Indonesian rank

2^nd place

4^th place

6^th place

2^nd place

5^th place

7^th place

5,032^nd place

5,326^th place

8,888^th place

low place

1,873^rd place

2,118^th place

archive.org

Menezes, Alfred J.; Oorschot, Paul C. van; Vanstone, Scott A. (2001). Handbook of Applied Cryptography (edisi ke-5). hlm. 251. ISBN 978-0-8493-8523-0.
Stinson, Douglas R. (1995). Cryptography: Theory and Practice. Boca Raton: CRC Press. ISBN 0-8493-8521-0.

Luby, Michael; Rackoff, Charles (April 1988). "How to Construct Pseudorandom Permutations from Pseudorandom Functions". SIAM Journal on Computing. 17 (2): 373–386. doi:10.1137/0217022. ISSN 0097-5397.
Patarin, Jacques (Oktober 2003). Boneh, Dan, ed. Luby–Rackoff: 7 Rounds Are Enough for 2n(1−ε) Security (PDF). Advances in Cryptology—CRYPTO 2003. Lecture Notes in Computer Science. 2729. hlm. 513–529. doi:10.1007/b11817. ISBN 978-3-5404-0674-7. Diakses tanggal 27 Juli 2009.
Zheng, Yuliang; Matsumoto, Tsutomu; Imai, Hideki (20 Agustus 1989). "On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses". Advances in Cryptology — CRYPTO' 89 Proceedings. Lecture Notes in Computer Science (dalam bahasa Inggris). 435: 461–480. doi:10.1007/0-387-34805-0_42. ISBN 978-0-3879-7317-3.
Schneier, Bruce; Kelsey, John (21 Februari 1996). Unbalanced Feistel networks and block cipher design. Fast Software Encryption. Lecture Notes in Computer Science (dalam bahasa Inggris). 1039. hlm. 121–144. doi:10.1007/3-540-60865-6_49. ISBN 978-3-5406-0865-3. Diakses tanggal 21 November 2017.
Morris, Ben; Rogaway, Phillip; Stegers, Till (2009). How to Encipher Messages on a Small Domain (PDF). Advances in Cryptology - CRYPTO 2009. Lecture Notes in Computer Science (dalam bahasa Inggris). 5677. hlm. 286–302. doi:10.1007/978-3-642-03356-8_17. ISBN 978-3-642-03355-1. Diakses tanggal 21 November 2017.

Patarin, Jacques (Oktober 2003). Boneh, Dan, ed. Luby–Rackoff: 7 Rounds Are Enough for 2n(1−ε) Security (PDF). Advances in Cryptology—CRYPTO 2003. Lecture Notes in Computer Science. 2729. hlm. 513–529. doi:10.1007/b11817. ISBN 978-3-5404-0674-7. Diakses tanggal 27 Juli 2009.

Schneier, Bruce; Kelsey, John (21 Februari 1996). Unbalanced Feistel networks and block cipher design. Fast Software Encryption. Lecture Notes in Computer Science (dalam bahasa Inggris). 1039. hlm. 121–144. doi:10.1007/3-540-60865-6_49. ISBN 978-3-5406-0865-3. Diakses tanggal 21 November 2017.

Morris, Ben; Rogaway, Phillip; Stegers, Till (2009). How to Encipher Messages on a Small Domain (PDF). Advances in Cryptology - CRYPTO 2009. Lecture Notes in Computer Science (dalam bahasa Inggris). 5677. hlm. 286–302. doi:10.1007/978-3-642-03356-8_17. ISBN 978-3-642-03355-1. Diakses tanggal 21 November 2017.

Luby, Michael; Rackoff, Charles (April 1988). "How to Construct Pseudorandom Permutations from Pseudorandom Functions". SIAM Journal on Computing. 17 (2): 373–386. doi:10.1137/0217022. ISSN 0097-5397.