Lower Bounds on Black-Box Ring Extraction Tibor Jager and Andy Rupp , Horst G¨ ortz Institute for IT Security Ruhr-University Bochum, Germany

First Page		Document Content
Date: 2008-11-30 10:17:55 Ring theory Finite fields Theoretical computer science Diffie–Hellman problem XTR Polynomial ring Algorithm Ring Naor-Reingold Pseudorandom Function Abstract algebra Algebra Mathematics		Lower Bounds on Black-Box Ring Extraction Tibor Jager and Andy Rupp , Horst G¨ ortz Institute for IT Security Ruhr-University Bochum, Germany Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 201,21 KB Share Document on Facebook

	On the Ring-LWE and Polynomial-LWE Problems Miruna Rosca1,2 , Damien Stehlé1 , and Alexandre Wallet1 1 ENS de Lyon, Laboratoire LIP (U. Lyon, CNRS, ENSL, INRIA, UCBL), France DocID: 1xVxG - View Document
	Wheel + Ring = Reel: the Impact of Route Filtering on the Stability of Policy Routing Luca Cittadini Giuseppe Di Battista DocID: 1xVsm - View Document
	Order-LWE and the Hardness of Ring-LWE with Entropic Secrets Zvika Brakerski Renen Perlman Weizmann Institute of Science∗ Abstract DocID: 1xUGh - View Document
	Obfuscating Conjunctions under Entropic Ring LWE∗ Zvika Brakerski† Weizmann Vinod Vaikuntanathan‡ MIT DocID: 1xUpK - View Document
	Short Accountable Ring Signatures Based on DDH Jonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Essam Ghadafi, Jens Groth, and Christophe Petit DocID: 1xU3N - View Document