1. Bogdanov, A., Knudsen, L. R., Leander, G., Standaert, F. X., Steinberger, J., & Tischhauser, E. (2012). Key-alternating ciphers in a provable setting: Encryption using a small number of public permutations. In D. Pointcheval & T. Johansson (Eds.), Annual international conference on the theory and applications of cryptographic techniques (Vol. 7237, pp. 45–62). Berlin, Heidelberg: Springer.
2. Libert, B., Peters, T., Joye, M., & Yung, M. (2015). Linearly homomorphic structure-preserving signatures and their applications. Designs, Codes and Cryptography, 77(2–3), 441–477.
3. Zadeh, L. A. (2012). Computing with words: Principal concepts and ideas (Vol. 277). Berlin: Springer.
4. Lin, F.-T., & Kao, C.-Y. (1995). A genetic algorithm for ciphertext-only attack in cryptanalysis. In Systems, man and cybernetics, 1995. Intelligent systems for the 21st century, IEEE international conference on (Vol. 1, pp. 650–654). IEEE.
5. Faugère, J.-C., Perret, L., Petit, C., & Renault, G. (2012). Improving the complexity of index calculus algorithms in elliptic curves over binary fields. In D. Pointcheval & T. Johansson (Eds.), Annual international conference on the theory and applications of cryptographic techniques (Vol. 7237, pp. 27–44). Berlin, Heidelberg: Springer.