Computing in Permutation Groups Without Memory

First Page		Document Content
Date: 2014-11-02 21:03:56 Permutations Group theory Symmetry Combinatorics Symmetric group Parity of a permutation Group action NC XTR Abstract algebra Algebra Mathematics		Computing in Permutation Groups Without Memory Add to Reading List Source URL: cjtcs.cs.uchicago.edu Download Document from Source Website File Size: 257,21 KB Share Document on Facebook

	Certifying RSA Saqib A. Kakvi, Eike Kiltz, and Alexander May Faculty of Mathematics Horst G¨ ortz Institute for IT-Security Ruhr University Bochum, Germany DocID: 1qO3E - View Document
	An earlier version of this paper appeared in EurocryptSecurity/Eﬃciency Tradeoﬀs for Permutation-Based Hashing Phillip Rogaway1 and John Steinberger2 1 DocID: 1q3qz - View Document
	A preliminary version of this paper appears in Fast Software Encryption - FSE 2007, Lecture Notes in Computer Science Vol. ???, pp. ?-?, ??? eds., Springer-Verlag, 2007. This is the full version. How to Enrich the Messag DocID: 1pgef - View Document
	Applications of Pairing Inversion The Pairing Zoo Miller Inversion Pairing Inversion Aspects of Pairing Inversion DocID: 1oeRJ - View Document
	Which Kind of Module Should I Extract?? Ulrike Sattler1 , Thomas Schneider1 , and Michael Zakharyaschev2 1 University of Manchester, UK, {sattler,schneider}@cs.man.ac.uk 2 DocID: 1mtCQ - View Document