Irreducibility to the One-More Evaluation Problems: More May Be Less Daniel R. L. Brown∗ June 9, 2010 Abstract - Random self-reducibility - Document - PDFSEARCH.IO

First Page	Meta Content
	Irreducibility to the One-More Evaluation Problems: More May Be Less Daniel R. L. Brown∗ June 9, 2010 Abstract Add to Reading List Document Date: 2010-06-09 14:57:08 Open Document File Size: 238,02 KB Share Result on Facebook Company Oracle / GE / / Facility University of Waterloo / / IndustryTerm reduction algorithm / deterministic algorithms / irreduction algorithm / direct reduction algorithm / / Organization University of Waterloo / / Person Daniel R. L. Brown∗ June / Jean Monnerat / Alfred Menezes / / Position rt / editor / / Product reduction R / / PublishedMedium Journal of Cryptology / / Technology encryption / SDH / simulation / html / irreduction algorithm / 7 3 Conclusion An irreduction algorithm / reduction algorithm / problem S. Algorithm / direct reduction algorithm / / URL http / SocialTag Finite fields Computability theory Cryptographic protocols Computational complexity theory Diffie–Hellman problem XTR Random self-reducibility Oracle machine Reduction Theoretical computer science

Irreducibility to the One-More Evaluation Problems: More May Be Less Daniel R. L. Brown∗ June 9, 2010 AbstractAdd to Reading List