IACR - PDFSEARCH.IO - Document Search Engine

IACR
Results: 2241

#	Item
981	Simplified Settings for Discrete Logarithms in Small Characteristic Finite Fields Antoine Joux CryptoExperts, Fondation UPMC, LIP6, INRIA/Ouragan Joint work with Cécile Pierrot Add to Reading List Source URL: www.iacr.org Language: English - Date: 2015-03-30 09:17:58 Logarithms Computational hardness assumptions Finite fields Modular arithmetic Discrete logarithm Index calculus algorithm Hyperelliptic curve Elliptic curve Pohlig–Hellman algorithm Abstract algebra Mathematics Group theory
982	Cryptanalysis of a fair anonymity for the tor network Amadou Moctar Kane KSecurity, BP 47136, Dakar, Senegal. Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-16 17:40:02 Cryptographic software Tor Internet Onion routing Blind signature Group signature Computing Internet privacy Cryptography Software
983	Composition Does Not Imply Adaptive Security Krzysztof Pietrzak ETH Z¨urich atalk Add to Reading List Source URL: www.iacr.org Language: English - Date: 2005-08-31 11:29:14 Route distinguisher Adaptive behavior
984	A New Distinguisher on Grain v1 for 106 rounds Santanu Sarkar Department of Mathematics, Indian Institute of Technology, Sardar Patel Road, Chennai, India. Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-15 10:23:44 Cube attack Tiny Encryption Algorithm Correlation attack Linear feedback shift register Trivium Key schedule ICE Differential cryptanalysis NLFSR Cryptography Stream ciphers Grain
985	Benes and Butterfly schemes revisited Jacques Patarin, Audrey Montreuil Universit´e de Versailles 45 avenue des Etats-UnisVersailles Cedex - France Abstract Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2005-01-07 07:53:45
986	Arithmetic Cryptography∗ Benny Applebaum† Jonathan Avron∗ Christina Brzuska‡ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-14 07:10:50 Secure multi-party computation Standard model Homomorphic encryption Pseudorandom generator Cryptographic primitive Commitment scheme Information-theoretic security Goldwasser–Micali cryptosystem Secret sharing Cryptography Cryptographic protocols Electronic commerce
987	A Polynomial-Time Key-Recovery Attack on MQQ Cryptosystems Jean-Charles Faugère, Danilo Gligoroski, Ludovic Perret, Simona Samardjiska, Enrico Thomae PKC 2015, March 30 - April 1, Maryland, USA Add to Reading List Source URL: www.iacr.org Language: English - Date: 2015-03-29 21:02:40 Mathematical sciences Polynomial QUAD Time complexity Cryptanalysis Multivariate cryptography Cryptography Applied mathematics Computational complexity theory
988	What is Black Box Secret Sharing? Using Algebraic Number Fields New Approach: Primitive Sets Add to Reading List Source URL: www.iacr.org Language: English - Date: 2005-08-31 11:28:38 Algebraic structures Algebraic number theory Scheme theory Secret sharing Algebraic number field Group Finite field Field Abelian group Abstract algebra Algebra Field theory
989	Cryptography from Post-Quantum Assumptions Raza Ali Kazmi Doctor of Philosophy Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-18 18:23:29 Homomorphic encryption Post-quantum cryptography Learning with errors Quantum computer Zero-knowledge proof Public-key cryptography RSA Random self-reducibility Oblivious transfer Cryptography Lattice-based cryptography Lattice problem
990	Sponge based CCA2 secure asymmetric encryption for arbitrary length message Tarun Kumar Bansal Donghoon Chang Somitra Kumar Sanadhya Indraprastha Institute of Information Technology, Delhi (IIIT-D), India Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-19 14:57:29 One-way function Padding Random oracle Key encapsulation Malleability Feistel cipher Chosen-ciphertext attack Mihir Bellare RSA Cryptography Optimal asymmetric encryption padding Adaptive chosen-ciphertext attack

UPDATE