home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!portal!lll-winken!iggy.GW.Vitalink.COM!cs.widener.edu!hela.iti.org!usc!news.service.uci.edu!beckman.com!dn66!a_rubin
- From: a_rubin@dsg4.dse.beckman.com (Arthur Rubin)
- Newsgroups: sci.crypt
- Subject: Re: DES generates A_(2^64)?
- Message-ID: <a_rubin.719249642@dn66>
- Date: 16 Oct 92 15:34:02 GMT
- References: <1992Oct13.174505.24230@b11.b11.ingr.com> <1992Oct15.125830.25539@bnr.ca>
- <unruh.719169829@unixg.ubc.ca> <1992Oct15.211300.27098@bnr.ca>
- <PHR.92Oct15174530@napa.telebit.com> <unruh.719212856@physics.ubc.ca>
- Organization: Beckman Instruments, Inc.
- Lines: 23
- Nntp-Posting-Host: dn66.dse.beckman.com
-
- In <unruh.719212856@physics.ubc.ca> unruh@unixg.ubc.ca (Bill Unruh) writes:
-
- >phr@telebit.com (Paul Rubin) writes:
-
- >>I heard that someone in Eastern Germany recently proved a stronger
- >>result, that DES generates the alternating group on 2^64 letters.
-
- >What is the "alternating group"? Does this mean that for any two 64 bit
- >words, x and y, there exists some sequence of DES transformations that
- >take x into y?, or that for any 1-1 onto mapping from the set of all {x}
- >to itself, there exists a sequence of DES which generates that mapping
- >(ie, that the DES group contains 2^(2^64) elements)?
-
- It's larger than 2^(2^64); it's (2^64)!/2. The result is saying that half
- of all possible permutations of the word-space (2^64) are attainable by
- some combination of DES transformations.
-
-
- --
- Arthur L. Rubin: a_rubin@dsg4.dse.beckman.com (work) Beckman Instruments/Brea
- 216-5888@mcimail.com 70707.453@compuserve.com arthur@pnet01.cts.com (personal)
- My opinions are my own, and do not represent those of my employer.
- My interaction with our news system is unstable; please mail anything important.
-