- cypherpunks-legacy@lists.ogf.org

crypto bibliography
by Fen Labalme 07 Oct '92

07 Oct '92

Subject: crypto bibliography By anonymous ftp from rsa.com: Fen ~~~ @inproceedings{agnew, author = "Agnew, G.B. and Mullin, R.C. and Vanstone, S.A.", year = 1988, title = "A secure public key protocol based on discrete exponentiation", booktitle = "Advances in Cryptology --- Eurocrypt '88", publisher = "Springer-Verlag", address = "Berlin"} @book{bamford, author = "Bamford, J.", year = 1982, title = "The Puzzle Palace", publisher = "Houghton Mifflin", address = "Boston"} @article{barlow, author = "Barlow, J.P.", year = 1992, month = "July", title = "Decrypting the puzzle palace", journal = "Communications of the ACM", volume = 35, number = 7, pages = "25--31"} @article{beauchemin, author = "Beauchemin, P. and Brassard, G. and Crepeau, C. and Goutier, C. and Pomerance, C.", year = 1988, title = "The generation of random numbers that are probably prime", journal = "J. of Cryptology", volume = 1, pages = "53--64"} @inproceedings{berson, author = "Berson, T.A.", year = 1992, title = "Differential cryptanalysis mod $2^{32}$ with applications to {MD5}", booktitle = "Advances in Cryptology --- Eurocrypt '92", publisher = "Springer-Verlag", address = "Berlin", note = "To appear"} @inproceedings{biham-feal, author = "Biham, E. and Shamir, A.", year = 1991, title = "Differential cryptanalysis of {F}eal and {N}-hash", booktitle = "Advances in Cryptology --- Eurocrypt '91", publisher = "Springer-Verlag", address = "Berlin"} @inproceedings{biham-full-des, author = "Biham, E. and Shamir, A.", year = 1993, title = "Differential cryptanalysis of the full 16-round {DES}", booktitle = "Advances in Cryptology --- Crypto '92", publisher = "Springer-Verlag", address = "New York", note = "To appear"} @article{bishop, author = "Bishop, M.", year = 1991, title = "Privacy-enhanced electronic mail", journal = "Internetworking: Research and Experience", volume = 2, pages = "199--233"} @inproceedings{blum-g, author = "Blum, M. and Goldwasser, S.", year = 1985, title = "An efficient probabilistic public-key encryption scheme which hides all partial information", booktitle = "Advances in Cryptology --- Crypto '84", pages = "289--299", publisher = "Springer-Verlag", address = "New York"} @inproceedings{brandt, author = "Brandt, J. and Damgard, I.", year = 1993, title = "On generation of probable primes by incremental search", booktitle = "Advances in Cryptology --- Crypto '92", publisher = "Springer-Verlag", address = "New York", note = "To appear"} @book{brassard, author = "Brassard, G.", year = 1988, title = "Modern Cryptology", publisher = "Springer-Verlag"} @book{bressoud, author = "Bressoud, D.M.", year = 1989, title = "Factorization and Primality Testing", publisher = "Springer-Verlag", address = "New York"} @article{brickell-survey, author = "Brickell, E.F. and Odlyzko, A.M.", year = 1988, title = "Cryptanalysis: {A} survey of recent results", journal = "Proceedings of the IEEE", volume = 76, pages = "578--593"} @inproceedings{brickell-rsa-hardware, author = "Brickell, E.F.", year = 1989, title = "A survey of hardware implementations of {RSA}", booktitle = "Advances in Cryptology --- Crypto '89", publisher = "Springer-Verlag", address = "New York", pages = "368--370"} @unpublished{buhler, author = "Buhler, J.P. and Lenstra, H.W. and Pomerance, C.", year = 1992, title = "Factoring integers with the number field sieve", note = "To appear"} @article{burmester, author = "Burmester, M.V.D. and Desmedt, Y.G. and Beth, T.", year = 1992, title = "Efficient zero-knowledge identification schemes for smart cards", journal = "Computer Journal", volume = 35, pages = "21--29"} @inproceedings{campbell, author = "Campbell, K.W. and Wiener, M.J.", year = 1993, title = "Proof that {DES} is not a group", booktitle = "Advances in Cryptology --- Crypto '92", publisher = "Springer-Verlag", address = "New York", note = "To appear"} @article{canfield, author = {Canfield, E.R. and Erd\"{o}s, P. and Pomerance, C.}, year = 1983, title = "On a problem of Oppenheim concerning `Factorisatio Numerorum'", journal = "J. Number Theory", volume = 17, pages = "1--28"} @manual{X.509, author = "{CCITT (Consultative Committee in International Telegraphy and Telephony)}", year = 1988, title = "Recommendation X.509: The Directory---Authentication Framework"} @manual{etebac, author = "{Comit\'{e} Fran\c{c}ais d'Organisation et de Normalisation Bancaire}", year = 1989, title = "Echanges T\'{e}l\'ematiques entre les Banques et leurs Clients, Standard ETEBAC 5, v1.1", address = "Paris"} @manual{gao-edi, author = "{Comptroller General of the United States}", year = 1991, month = "December 13,", title = "Matter of {National Institute of Standards and Technology} --- {Use} of Electronic Data Interchange Technology to Create Valid Obligations", note = "File B-245714"} @article{coppersmith-o-s, author = "Coppersmith, D. and Odlyzko, A.M. and Schroeppel, R.", year = 1986, title = "Discrete logarithms in {GF(p)}", journal = "Algorithmica", volume = 1, pages = "1--15"} @article{coppersmith, author = "Coppersmith, D.", year = 1987, title = "Cryptography", journal = "IBM J. Res. Develop.", volume = 31, number = 2, month = "March", pages = "244--248"} @techreport{improving-security-UNIX, author = "Curry, David A.", year = 1990, title = "Improving the Security of Your {UNIX} System", institution = "{SRI} International", number = "ITSTD-721-FR-90-21", address = "Menlo Park, CA", month = "April"} @techreport{davida, author = "Davida, G.", year = 1982, title = "Chosen signature cryptanalysis of the RSA public key cryptosystem", number = "TR-CS-82-2", institution = "Dept of EECS, University of Wisconsin, Milwaukee"} @book{davies-and-price, author = "Davies, D.W. and W.L. Price", year = 1984, title = "Security for Computer Networks: {An} Introduction to Data Security in Teleprocessing and Electronic Funds Transfer", publisher = "John Wiley \& Sons", address = "New York"} @manual{green-book, author = "{Department of Defense}", title = "{CSC-STD-002-85}: Department of Defense ({DoD}) Password Management Guidelines", year = 1985} @manual{orange-book, author = "{Department of Defense}", title = "{DoD 5200.28-STD}: Department of Defense ({DoD}) Trusted Computer System Evaluation Criteria ({TCSEC})", year = 1985} @article{diffie-hellman, author = "Diffie, W. and Hellman, M.E.", year = 1976, title = "New directions in cryptography", journal = "IEEE Transactions on Information Theory", volume = "IT-22", pages = "644--654"} @article{diffie-hellman-des, author = "Diffie, W. and Hellman, M.E.", year = 1977, title = "Exhaustive cryptanalysis of the {NBS Data Encryption Standard}", journal = "Computer", volume = 10, pages = "74--84"} @article{Diffie-Hellman-Intro, author = "Diffie, W. and M.E. Hellman", year = 1979, month = "March", title = "Privacy and authentication: {An} introduction to cryptography", journal = "Proceedings of the IEEE", volume = 67, number = 3, pages = "397--427"} @article{diffie-10yrs, author = "Diffie, W.", year = 1988, title = "The first ten years of public-key cryptography", journal = "Proceedings of the IEEE", volume = 76, pages = "560--577"} @article{elgamal, author = "ElGamal, T.", year = 1985, title = "A public-key cryptosystem and a signature scheme based on discrete logarithms", journal = "IEEE Transactions on Information Theory", volume = "IT-31", pages = "469--472"} @inproceedings{fiat, author = "Fiat, A. and Shamir, A.", year = 1987, title = "How to prove yourself: {Practical} solutions to identification and signature problems", booktitle = "Advances in Cryptology --- Crypto '86", pages = "186--194", publisher = "Springer-Verlag", address = "New York"} @article{goldwasser, author = "Goldwasser, S. and Micali, S.", year = 1984, title = "Probabilistic encryption", journal = "J. of Computer and System Sciences", volume = 28, pages = "270--299"} @inproceedings{gordon, author = "Gordon, D.M. and McCurley, K.S.", year = 1993, title = "Massively parallel computation of discrete logarithms", booktitle = "Advances in Cryptology --- Crypto '92", publisher = "Springer-Verlag", address = "New York", note = "To appear"} @inproceedings{haber, author = "Haber, S. and Stornetta, W.S.", year = 1991, title = "How to time-stamp a digital document", booktitle = "Advances in Cryptology --- Crypto '90", publisher = "Springer-Verlag", address = "New York", pages = "437--455"} @article{hastad, author = "Hastad, J.", year = 1988, title = "Solving simultaneous modular equations of low degree", journal = "SIAM J. Computing", volume = 17, pages = "336--241"} @article{hellman, author = "Hellman, M.E.", year = 1980, title = "A cryptanalytic time-memory trade off", journal = "IEEE Transactions on Information Theory", volume = "IT-26", pages = "401--406"} @manual{iso9796, author = "{International Standards Organization}", title = "IS 9796: Information technology, security techniques: digital signature scheme giving message recovery", address = "Geneva, Switzerland"} @book{kahn, author = "Kahn, D.", year = 1967, title = "The Codebreakers", publisher = "Macmillan Co.", address = "New York"} @article{kaliski, author = "Kaliski Jr., B.S. and Rivest, R.L. and Sherman, A.T.", year = 1988, title = "Is the Data Encryption Standard a group?", journal = "J. of Cryptology", volume = 1, pages = "3--36"} @article{Kaliski-one-way-permutations, author = "{Kaliski Jr.}, Burton S.", year = 1991, title = "One-Way Permutations on Elliptic Curves", journal = "Journal of Cryptology", volume = 3, pages = "187--199"} @manual{MD2, author = "Kaliski, B.", year = 1992, month = "April", title = "RFC 1319: The {MD2 Message-Digest Algorithm}", organization = "Internet Activities Board"} @manual{rfc1114, author = "Kent, S. and J. Linn", year = 1989, month = "August", title = "RFC 1114: Privacy Enhancement for Internet Electronic Mail: Part {II} -- Certificate-Based Key Management", organization = "Internet Activities Board"} @book{knuth, author = "Knuth, D.E.", year = 1981, title = "The Art of Computer Programming", edition = "2nd", volume = 2, publisher = "Addison-Wesley", address = "Reading, Mass."} @article{koblitz-ecc, author = "Koblitz, N.", year = 1987, title = "Elliptic curve cryptosystems", journal = "Mathematics of Computation", volume = 48, pages = "203--209"} @book{koblitz, author = "Koblitz, N.", year = 1987, title = "A Course in Number Theory and Cryptography", publisher = "Springer-Verlag", address = "New York"} @inproceedings{lai, author = "Lai, X. and Massey, J.L.", year = 1991, title = "A proposal for a new block encryption standard", booktitle = "Advances in Cryptology --- Eurocrypt '90", pages = "389--404", publisher = "Springer-Verlag", address = "Berlin"} @article{lamacchia, author = "LaMacchia, B.A. and Odlyzko, A.M.", year = 1991, title = "Computation of discrete logarithms in prime fields", journal = "Designs, Codes and Cryptography", volume = 1, pages = "47--62"} @article{landau, author = "Landau, S.", year = 1988, title = "Zero knowledge and the {Department of Defense}", journal = "Notices of the American Mathematical Society", volume = 35, pages = "5--12"} @article{lenstra-ecm, author = "Lenstra Jr., H.W.", year = 1987, title = "Factoring integers with elliptic curves", journal = "Ann. of Math.", volume = 126, pages = "649--673"} @incollection{lenstra-survey, author = "Lenstra, A.K. and Lenstra Jr., H.W.", year = 1990, title = "Algorithms in number theory", editor = "van Leeuwen, J.", booktitle = "Handbook of Theoretical Computer Science", volume = "A", publisher = "MIT Press/Elsevier", address = "Amsterdam"} @inproceedings{lenstra-nsf, author = "Lenstra, A.K. and Lenstra Jr., H.W. and Mannasse, M.S. and Pollard, J.M.", year = 1990, title = "The number field sieve", booktitle = "Proc. of the 22nd Annual ACM Symposium on the Theory of Computing", publisher = "ACM Press"} @inproceedings{lenstra-ppmpqs, author = "Lenstra, A.K. and Manasse, M.S.", year = 1991, title = "Factoring with two large primes", booktitle = "Advances in Cryptology --- Eurocrypt '90", pages = "72--82", publisher = "Springer-Verlag", address = "Berlin"} @manual{RFC-1113, author = "Linn, J.", year = 1989, month = "August", title = "RFC 1113: Privacy Enhancement for Internet Electronic Mail: Part {I} -- Message Encipherment and Authentication Procedures", organization = "Internet Activities Board"} @manual{RFC-1115, author = "Linn, J.", year = 1989, month = "August", title = "RFC 1115: Privacy Enhancement for Internet Electronic Mail: Part {III} -- Algorithms, Modes and Identifiers", organization = "Internet Activities Board"} @article{merkle-hellman, author = "Merkle, R.C. and Hellman, M.E.", year = 1978, title = "Hiding information and signatures in trapdoor knapsacks", journal = "IEEE Transactions on Information Theory", volume = "IT-24", pages = "525--530"} @article{merkle-hellman-multiple, author = "Merkle, R.C. and Hellman, M.E.", year = 1981, title = "On the security of multiple encryption", journal = "Communications of the ACM", volume = 24, pages = "465--467", month = "July"} @article{messmer, author = "Messmer, E.", year = 1992, title = "{NIST} stumbles on proposal for public-key encryption", journal = "Network World", volume = 9, number = 30, month = "July 27,"} @inproceedings{miller, author = "Miller, V.S.", year = 1986, title = "Use of elliptic curves in cryptography", booktitle = "Advances in Cryptology --- Crypto '85", pages = "417--426", publisher = "Springer-Verlag", address = "New York"} @manual{des-77, author = "{National Bureau of Standards}", year = 1977, month = "January", title = "FIPS Publication 46: Announcing the Data Encryption Standard"} @manual{des-modes, author = "{National Bureau of Standards}", year = 1980, title = "FIPS Publication 81: {DES} Modes of Operation", month = "December"} @manual{des-88, author = "{National Bureau of Standards}", year = 1988, month = "January", title = "FIPS Publication 46-1: Data Encryption Standard"} @manual{nist-dss, author = "{National Institute of Standards and Technology (NIST)}", year = 1992, title = "Publication {XX}: Announcement and Specifications for a Digital Signature Standard (DSS)", month = "August 19,"} @manual{nist-shs, author = "{National Institute of Standards and Technology (NIST)}", year = 1992, title = "Publication {YY}: Announcement and Specifications for a {Secure Hash Standard} (SHS)", month = "January 22,"} @article{dss-discuss, author = "{National Institute of Standards and Technology (NIST)}", year = 1992, title = "The {Digital Signature Standard}, proposal and discussion", journal = "Communications of the ACM", volume = 35, number = 7, pages = "36--54", month = "July"} @book{computers-at-risk, author = "National Research Council, System Security Study Committee and others", year = 1991, title = "Computers at Risk: {Safe} Computing in the Electronic Age", publisher = "National Academy Press", address = "Washington, DC"} @inproceedings{odlyzko, author = "Odlyzko, A.M.", year = 1984, title = "Discrete logarithms in finite fields and their cryptographic significance", booktitle = "Advances in Cryptology --- Eurocrypt '84", pages = "224--314", publisher = "Springer-Verlag", address = "Berlin"} @manual{oiw, author = "{OSI Implementors' Workshop}", year = 1992, title = "Draft Working Implementation Agreements For Open Systems Interconnection Protocols", publisher = "NIST", address = "Gaithersburg, Maryland", month = "June"} @article{pohlig-hellman-dlog, author = "Pohlig, S.C. and Hellman, M.E.", year = 1978, title = "An improved algorithm for computing logarithms over $GF(p)$ and its cryptographic significance", journal = "IEEE Transactions on Information Theory", volume = "IT-24", pages = "106--110"} @article{pollard1, author = "Pollard, J.", year = 1974, title = "Theorems of factorization and primality testing", journal = "Proc. Cambridge Philos. Soc.", volume = 76, pages = "521--528"} @article{pollard2, author = "Pollard, J.", year = 1975, title = "{Monte Carlo} method for factorization", journal = "BIT", volume = 15, pages = "331--334"} @techreport{rabin, author = "Rabin, M.O.", year = 1979, title = "Digitalized signatures as intractable as factorization", institution = "MIT", number = "MIT/LCS/TR-212"} @article{rsa, author = "Rivest, R.L. and A. Shamir and L. Adleman", year = 1978, month = "February", title = "A method for obtaining digital signatures and public-key cryptosystems", journal = "Communications of the ACM", volume = 21, number = 2, pages = "120--126"} @inproceedings{rivest-md4, author = "Rivest, R.L", year = 1991, title = "The {MD4} message digest algorithm", booktitle = "Advances in Cryptology --- Crypto '90", pages = "303--311", publisher = "Springer-Verlag", address = "New York"} @inproceedings{rivest-prob-prime, author = "Rivest, R.L.", year = 1990, title = "Finding four million random primes", booktitle = "Advances in Cryptology --- Crypto '90", pages = "625--626", publisher = "Springer-Verlag", address = "New York"} @incollection{rivest-survey, author = "Rivest, R.L.", year = 1990, title = "Cryptography", editor = "van Leeuwen, J.", booktitle = "Handbook of Theoretical Computer Science", volume = "A", publisher = "MIT Press/Elsevier", address = "Amsterdam"} @manual{rfc-md5, author = "Rivest, R.L.", year = 1992, title = "{RFC} 1321: The {MD5 Message-Digest Algorithm}", month = "April", organization = "Internet Activities Board"} @article{rivest-dss-response, author = "Rivest, R.L.", year = 1992, title = "Response to {NIST}'s Proposal", journal = "Communications of the ACM", volume = 35, pages = "41--47", month = "July"} @manual{PKCS-5, author = "{RSA Data Security, Inc.}", year = 1991, month = "June", title = "PKCS \#5: Password-Based Encryption Standard", note = "Version 1.4"} @book{computer-security-basics, author = "Russell, Deborah and G.T. Gangemi Sr.", year = 1991, title = "Computer Security Basics", publisher = "O'Reilly and Associates", address = "Sebastopol, CA"} @inproceedings{schnorr, author = "Schnorr, C.P.", year = 1990, title = "Efficient identification and signatures for smart cards", booktitle = "Advances in Cryptology --- Crypto '89", pages = "239--251", publisher = "Springer-Verlag", address = "New York"} @book{protecting-information, author = "Schweitzer, James A.", year = 1983, title = "Protection Information in the Electronic Workplace: A Guide for Managers", publisher = "Prentice-Hall", address = "Reston, VA"} @article{silverman, author = "Silverman, R.D.", year = 1987, title = "The multiple polynomial quadratic sieve", journal = "Math. Comp.", volume = 48, pages = "329--339"} @article{smid-des, author = "Smid, M.E. and Branstad, D.K.", year = 1988, title = "The {Data Encryption Standard}: {Past} and future", journal = "Proceedings of the IEEE", volume = 76, pages = "550--559"} @inproceedings{smid, author = "Smid, M.E. and Branstad, D.K.", year = 1993, title = "Response to comments on the {NIST} proposed {Digital Signature Standard}", booktitle = "Advances in Cryptology --- Crypto '92", publisher = "Springer-Verlag", note = "To appear"} @manual{australia, author = "{Standards Australia}", year = 1990, title = "AS 2805.6.5.3: Electronic Funds Transfer --- Key Management"} @book{cuckoo's-egg, author = "Stoll, Cliff", year = 1989, title = "The Cuckoo's Egg: Tracing a Spy Through the Maze of Computer Espionage", publisher = "Doubleday", address = "New York"} @article{wiener, author = "Wiener, M.J.", year = 1990, title = "Cryptanalysis of short {RSA} secret exponents", journal = "IEEE Trans. Information Theory", volume = 36, pages = "553--558"}

1 0

List
by Secret_Squirrel＠Treehouse.COM 06 Oct '92

06 Oct '92

comp-privacy(a)pica.army.mil I am the moderator of the Computer Privacy Digest. The computer Privacy Digest is an Internet mailing list that is dedicated to the discussion of how technology impacts privacy. This list is gatewayed into the moderated USENET newsgroup comp.society.privacy. In lot of ways it is a subsection on the risks digest but it concentrates on the risks of technology on privacy. The charter is: comp.society.privacy Effects of technology on privacy (Moderated) This newsgroup is to provide a forum for discussion on the effect of technology on privacy. All too often technology is way ahead of the law and society as it presents us with new devices and applications. Technology can enhance and detract from privacy. This newsgroup will be gatewayed to an internet mailing list. Submissions go to: comp-privacy(a)pica.army.mil and administrative requests go to comp-privacy-request(a)pica.army.mil. Moderator: Dennis G. Rears MILNET: drears(a)pica.army.mil UUCP: ...!uunet!cor5.pica.army.mil!drears INTERNET: drears(a)pilot.njin.net USPS: Box 210, Wharton, NJ 07885 Phone(home): 201.927.8757 Phone(work): 201.724.2683/(DSN) 880.2683 USPS: SMCAR-FSS-E, Bldg 94, Picatinny Ars, NJ 07806 ----------------------[ Cut Here ]------------------ I , Secret Squirrel, am merely cross-posting the above. I have nothing to do with it, and am in now xxx no way connected with comp-privacy. Just thought it might interest someone here. Quakka!

1 0

SEIZING THE MEDIA
by Fen Labalme 05 Oct '92

05 Oct '92

Subject: SEIZING THE MEDIA [ this is a resend I originally sent this to cypherpunks(a)toad.com on 28 Sep, but I haven't seen it yet, so apologies up front if you see it twice... Fen ~~~ ] FYI... from PeaceNet ACTIV-L: Date: Sat, 26 Sep 1992 23:33:10 CDT Sender: Activists Mailing List <ACTIV-L%MIZZOU1.BITNET(a)pucc.Princeton.EDU> >From: "(Rich Winkel)" <rich(a)pencil.cs.missouri.edu> Subject: PAX: SEIZING THE MEDIA: A NETWORKER CONGRESS To: Multiple recipients of ACTIV-L <ACTIV-L%MIZZOU1.BITNET(a)pucc.Princeton.EDU> /** gen.media: 141.0 **/ ** Topic: SEIZING THE MEDIA: NETWORKER CONGR ** ** Written 6:39 pm Sep 25, 1992 by openmedia in cdp:gen.media ** SEIZING THE MEDIA: A NETWORKER CONGRESS A weekend of activity to discuss, self-educate, and put into practice the creation of subversive media. 1:30pm Saturday 24 October to 6pm Sunday 25 October 1992 Media and resource exchange; slides, fax, posters, pamphlets, computer files, ideas, proposals, tactics Practical action on billboard improvement and removal; Big Art and postering E-mail and fax facility to receive material to be discussed and implemented during the weekend Documentation to all participants Materials supplied: photocopier reproduction/enlargement and the streets of Oxford Bloomin Arts, Princes Street, Cowley Road, Oxford, OX4, U.K. If you can't make it in person, you can take part in the Seizing the Media Congress by post, fax, E-mail. Send documents, comments, proposals, art, ideas, and posters. Post to: BM Jed, London WC1N 3XX, United Kingdom Fax to: (011 441) 0865 72 4317 E-Mail to: Eastoxcomcen(a)GN.APC.ORG Accommodation and other information are available from Friday night onwards. To make arrangements or get more information, get in touch with Oxfin between 1-4pm Mondays to Fridays at: (0865) 240545 >From the United States: 011 41865 240 545 Background: SEIZING THE MEDIA is the title of pamphlet written by the Immediast Underground and first released in Amsterdam , New York City, and Seattle in early 1992. The 26 pamphlet combines theory, graphics, research and proposals that examine: * Information control * Propaganda and advertising * CIA * Mind control * Immediast counter-offensives * tactics, subversive networking, public empowerment * multi-media * Public production libraries * the liberation of public space ...Just when Jesse Helms thought he made the world safe from poetic terrorism, along come the Immediasts, a cadre of media hackers who are fed up with the ecology of coercion that surrounds them. Their booklet SEIZING THE MEDIA proposes an all-out artistic assault on coercive communication, cultural monologue, and media control. They want all media insurgents to take back the airwaves with pirate radio, cable access TV, altering ads and billboards, and otherwise hacking the datasphere to break the spell of State/corporate media control. . . . from Gareth Branwyns STREET NOISE, Issue 7 of Mondo 2000 SEIZING THE MEDIA Version 1.1 is available for $3 from Open Media PO Box 2726 Westfield New Jersey 07091 USA THE IMMEDIAST UNDERGROUND is a centerless network of artists, writiers, hackers, culture jammers, pirate broadcasters, and posterists who connect with one another through information systems, mail art, networker congresses, and the underground press, and who communicate with the public through actions against all forms of coercive communication, space infringement, and media control. For more info contact: Immediast U. PO Box 2726 Westfield New Jersey 07091 USA DECENTRALIZED WORLD-WIDE NETWORKER CONGRESSES Since the beginning of the year, members of alternative info-nets, artists, insurgents, and cultural workers have been holding networker congresses, transnational engagements in cultural production, dialogue, collaborations, open exchange, subversive brainstorming, and collective disruptions of dominant culture. THE NETWORKER, A NEW PERCEPTION In societies where information is money and media is power, public access is as controlled as the corporate states grip on communication law, censorship, commerce, covert action and surveillance. In this context, uninhibited public communication, expression, and cultural production are acts of freedom, sovereignty, and defiance. Rooted in the drive to connect and exchange with others, Networker Congress engage in culture and media as the battleground for greater openness and freedom. MORE INFORMATION about NETWORKER CONGRESSES contact: H.R. Fricker Buro fur kunsterische Umtriebe CH 9043 Trogen Switzerland Retrofuturism PO Box 2278 Iowa City, Iowa 52244 Face of the Congress FaGaGaGa Po Box 1382 Youngstown, Ohio 44501 Peter Kaufman Bergenwissenstrasse 11 CH-8123 EbmatigenDecentralized Networker Congresses Switzerland Decentralized Networker Congresses Netshaker PO Box 978 Hanover, New Hampshire 03766 ** End of text from cdp:gen.media **

1 0

Re: A statement of purpose
by Fen Labalme 05 Oct '92

05 Oct '92

Subject: RE>A statement of purpose I am way excited to see this all coming together! It's like a 13-year- old dream-come-true! This is a great statement of purpose, though I might leave "DC-nets" out (since many won't know what that means) and perhaps replace it with the only slightly-less-cryptic "information-theoretically-secure networks", or some such. $0.02

1 0

Meeting Sat. Oct. 10, noon, Mt. View
by Eric Hughes 05 Oct '92

05 Oct '92

ANNOUNCEMENT ============ Second Meeting Saturday, October 10, 1992 12:00 noon - 6:00 p.m. Cygnus Support offices 1937 Landings Drive Mountain View The second meeting of the cypherpunks will be Saturday at noon. John Gilmore has graciously provided us with a meeting space at the new Cygnus Support offices. These offices are so new, in fact, that Cygnus will not have moved in yet. This meeting will be bring-your-own-pillow (or chair), since it will be held in largely empty space. Directions are at the end of the message. Attendance is transitive trust, arbitrarily deep. Invite whoever you want, and let them do so also, and so on. Invite them also to join the mailing list. Do not, however, just post the announcement. Time for that will come. I'd like everyone who plans on attending the meeting to send me, hughes(a)soda.berkeley.edu, a message telling me so. I'd like to get a rough head count before Saturday for game planning. We are starting at noon because of popular demand. Eat beforehand or bring a burrito or something. It will be fine to eat during the first segment; it won't be any more disruptive than the game is. Bring your PGP public key for in-person key distribution, preferably on diskette. We'll need a portable PC or three to do key distribution; if you have one you can bring, post to the list and tell people. We realized after the first meeting that a strict schedule was nonsense. This meeting has a very informal schedule. Schedule -------- Starting at noon, we're going to play session two of the crypto-anarchy game, in which players try to conduct business under the watchful eyes of others. We want to play for two hours and then have discuss experiences afterward for about an hour. Some of the improvements over last time will be flatter denominations of money, wider distribution of commodities, more watchers (governmental and otherwise), and perhaps some pre-printed forms. We'll take a break to regroup for about ten or twenty minutes. For the second half we'll talk about the security of remailers. I'll lead the discussion. We'll be designing protocols and analyzing attacks and defenses. I've done this with DigiCash for electronic money protocols, and remailers are much easier, but still probably more than an afternoon's discussion. We'll do this until six or so, when people will have to start leaving. Everyone who wants to will go out for dinner. I don't know the restaurants down there; perhaps someone could suggest one? Directions ---------- It's at 1937 Landings Drive, Mt. View. 101 to Amphitheatre Parkway (the bay side of Rengstorff Ave), go right at the first light, pass a right turn, and just before the road crests a tiny hill, turn right into the Landings complex. We're in Building H. -- Eric

1 0

A statement of purpose
by Eric Hughes 05 Oct '92

05 Oct '92

I've had a bunch of people ask me about the group and what it's up to. Accordingly, I drafted a small statement of purpose to send to folks. Please comment. Eric ---------------------- The cypherpunks list is a forum for discussion about technological defenses for privacy in the digital domain. Cypherpunks assume privacy is a good thing and wish there were more of it. Cypherpunks acknowledge that those who want privacy must create it for themselves and not expect governments, corporations, or other large, faceless organizations to grant them privacy out of beneficence. Cypherpunks know that people have been creating their own privacy for centuries with whispers, envelopes, closed doors, and couriers. Cypherpunks do not seek to prevent other people from speaking about their experiences or their opinions. The most important means to the defense of privacy is encryption. To encrypt is to indicate the desire for privacy. But to encrypt with weak cryptography is to indicate not too much desire for privacy. Cypherpunks hope that all people desiring privacy will learn how best to defend it. Cypherpunks are therefore devoted to cryptography. Cypherpunks wish to learn about it, to teach it, to implement it, and to make more of it. Cypherpunks know that cryptographic protocols make social structures. Cypherpunks know how to attack a system and how to defend it. Cypherpunks know just how hard it is to make good cryptosystems. Cypherpunks love to practice. They love to play with public key cryptography. They love to play with anonymous and pseudonymous mail forwarding and delivery. They love to play with DC-nets. They love to play with secure communications of all kinds. Cypherpunks write code. They know that someone has to write code to defend privacy, and since it's their privacy, their going to write it. Cypherpunks publish their code so that their fellow cypherpunks may practice and play with it. Cypherpunks realize that security is not built in a day and are patient with incremental progress. Cypherpunks don't care if you don't like the software they write. Cypherpunks know that software can't be destroyed. Cypherpunks know that a widely dispersed system can't be shut down. Cypherpunks will make the networks safe for privacy.

1 0

Nuts & Acorns
by Secret_Squirrel＠Treehouse.ORG 05 Oct '92

05 Oct '92

To: Tom Jennings >> Doesn't this imply that the unencrypted message would have to travel from the originator to the server? Or do you mean to send to X I'd request X's public key from the server, then encrypt, etc? << Not at all. In its simplest form: We'd have a single secure-IRC-server. It would have its own public key, which ever secure-IRC-client would know. When I want to send a secure broadcast msg, I type it, my client encrypts it with the public key of the secure-IRC-server, and transmits it. The server picks it up, decrypts it in memory, then re-encrypts that original msg with the public key of each paritxxx participant in the particular room I'm in. So, if there are ten participants in the room, and I want all of them to know something, but not anyone else who might be tapping ixxx wires or catching packets somewhere in the ether, then I'd send a single broadcast msg to the server; the server would end up sending ten differently encrypted msgs -- one to each participant, encrypted with each of the participants' public keys (which the secure-irc-server would have to maintain; it would function as a key-server.) To send a private msg across the secure-IRC, I'd indicate that it was a "/msg", the recipeixxx recipient, and again, encrypt it with the public key of the server. The server would learn who the recipient was, and rebroadcast my message to that person, in that person's public key. >> I am considering becoming and "introducer" for parts of FidoNet. I can't seem to get past the problems of how to assign reliability to public keys I receive over an unsecured email channel to begin with. No other method is practical. << Huh? I don't understand what you're pointing out. If I send you my public key -- even if I cc: dockmaster -- what does it matter that the NSA knows my public key (unoless they want to send me msgs, too)? The key itself is inherantly secure. Let your users decide on their public keys and register those keys with your key server. Not the other way around. Course, there's always the Kandinsky-Ogorov method of key exchange. To: St. Jude >> The bacteriophage virus replicates itself by injecting its own information into an existing system. The more copies of the phage, the worse for the bacteria etc etc. SO: in private, the planning, the designing, the coding... for public distribution as widely as possible. If the technology is intrinsically transformative, and if the process of distribution is engaging, even exciting, the revolution is next tuesday. << Providing the numbe r of cells you have access to and can anticipate influencyxxx incxxx influencing is large enough, and it isn't. Anyway, look, let's put our words into action. What makes code (programming, I mean) didxxx different from spoken language? The fact that you can communicate with a machine, and it will _act_ on what you say, no matter what. Theres beauty and there's magic in that. (And some of us have the same effect on people that we have on machines. ;-)) Instead of talking about all this, let's start doing it. What did I read the other day? "Hackers go where Angels fear to tread"? Let's have more ideas. This hopping remailer is exciting. So is passive encryption of electronic communications. When are we going totart xxx to start effecting de facto standards here? Once we start encrypting everything, then what? What do we do with this new tool? Communication of any kind (especially encrypted communication) presupposs that there are messages to be exchanged -- _ideas_! More ideas and less chatter. How can we have a revolution if we don't even know what we're trying to bring about? Maybe I was out of the loop. Maybe I was attending an Army/Navy game that day, but I don't know what we're trying to do here, exactly. What is this "revolution"? -- $33kr1t $kwurl. K.R.A.P. (K-Rad. A.SCII P.Ossee)

2 1

Re: Secure IRC
by Tom.Jennings＠f111.n125.z1.FIDONET.ORG 05 Oct '92

05 Oct '92

U> How about the idea of a secure Internet Relay Chat? I'm fairly interested... version 2 of PGP is generating some interest here in the FidoNet, though it has some serious problems, design problems. (It's "ASCII armor" method (ala UUENCODE) is delicate and fussy, for example). I am considering becoming and "introducer" for parts of FidoNet. I can't seem to get past the problems of how to assign reliability to public keys I receive over an unsecured email channel to begin with. No other method is practical. Alas, I can't take part in much it seems, the UFGATE was hobbled to intentionally prevent us FidoNet people from entering text into message headers (For example "Request-Remailing-To:"...) because we'd take over the planet or something I guess (we are apparently contagious). U> The Server receives it, decrypts it, then for each of the participants U> currently in this particular room, the server encrypts the msg U> with that person's Public Key and sends it. Doesn't this imply that the unencrypted message would have to travel from the originator to the server? Or do you mean to send to X I'd request X's public key from the server, then encrypt, etc? --- Msg V2.8 -- Tom Jennings - via FidoNet node 1:125/555 UUCP: ...!uunet!hoptoad!kumr!fidogate!111!Tom.Jennings INTERNET: Tom.Jennings(a)f111.n125.z1.FIDONET.ORG

2 2

Secure IRC
by postmastuh＠dawkmastuh.guv 05 Oct '92

05 Oct '92

How about the idea of a secure Internet Relay Chat? A central server might maintain the list of everybody's Public Keys. If you wanted to broadcast a 'public' yet secure msg in a particular room making sure only participants in that room (and not eavesdroppers somewhere else on the wire) could read the msg you could encrypt your broadcast with the server's own Public Key. Send it. The Server receives it, decrypts it, then for each of the participants currently in this particular room, the server encrypts the msg with that person's Public Key and sends it. Private IRC msgs would be treated similarly, except that they'd be re-encrypted only once, for the intended private recipient. Anyone interested on working on this? 0r 1z 1t 2 layme? -- /|n0n1mu$

2 1

PGP echo conference...
by Tom.Jennings＠f111.n125.z1.FIDONET.ORG 04 Oct '92

04 Oct '92

Date: 03 Oct 92 17:22:42 From: Christopher Baker on 374/14 To: Tom Jennings on 125/111 Subj: PUBLIC_KEYS Echo announcement * Forwarded from 1:374/14, Rights On! in Titusville FL * Originally to All in the ECHO_REQ echo. attention all public-key encryption buffs: a new Echo has been started for discussion and distribution of public-key encryption info. since it was only born a couple hours ago, it is being distributed privately from 1:374/14 [9600+ HST/V32] and 1:374/26 [2400]. here are the details from the EListing: area PUBLIC_KEYS title Public-Key Encryption and Distribution Echo desc Provides a technical forum for discussion of public-key desc encryption techniques and programs and for the distribution desc of public-keys in FidoNet and other BBS and e-mail networks. desc PUBLIC_KEYS is Moderated by Christopher Baker at 1:374/14 desc [KeyID: 1024/4B9A59] and GK Pace at 1:374/26 [KeyID: desc 1024/B6B823]. The messages entered into the Echo are the sole desc responsibility of the person entering the messages. When in desc doubt about public-keys, contact the poster directly via Netmail. desc The Echo is open to anyone with an interest in public-key desc encryption issues and methods. The Echo Guidelines are contained desc in PUBKEYS.RUL available in ELRUL???.LZH as of 11/92. mod C.Baker/GK.Pace, 1:374/14 tot 2 vol 10/week dist LOCAL, ZONE1 SEEN 374/14 374/26 PATH 374/14 374/26 -30- here's the info from the .RUL file to be found in ELRUL as of 11/92: This is the PUBLIC_KEYS Echo. The purpose of the Echo is to provide a place to post and find public-keys for data encryption within FidoNet and elsewhere and to discuss data and software encryption and the various schemes thereof. This is a technical Echo with very few rules. Those very few rules are: 1. Stay on-topic. Topics of keys and encryption are welcome. Others are not. 2. No politics [except as it relates to privacy issues] and no religion. 3. No personal attacks, slurs or innuendo. Stick to issues not personalities. 4. No Private flagged messages in Echomail! Encrypted traffic using public-keys is permitted for the exercise so long as it is on-topic. 5. This Echo may be traveling around the world so try to be concise. Avoid excessive quoting for one-liner responses. 6. Be aware that Echomail is NOT secure. Don't take anything at face value. 7. The posts in this Echo are the sole responsiblity of the poster. If you need verification, use Netmail. 8. The Moderators will deal with off-topic traffic. Don't respond for them. Links to this Echo will only be curtailed when absolutely necessary so please don't make it necessary. [grin] The Moderators are Christopher Baker [KeyID: 1024/4B9A59 1992/10/03] and GK Pace [KeyID: 1024/B6B823 1992/09/28] at 1:374/14 and 1:374/26, respectively. It is recommended that public-keys be made available via Netmail or by file-request with the magic filename: PGPKEY and that the public-key provided for that request by given a distinctive filename using part or all of each provider's name and address. For example, on my system, a file-request of PGPKEY will give BAK37414.ASC to the requesting system. This will avoid duplicate overwriting and make it easier to track the keys. Using a standard magic filename will make it easier to find keys on different systems. This Echo is not currently on the Zone 1 Backbone distribution list but that is expected to change as soon as the word gets out. This Echo will be EListed in ELIST211 next month. Please feel free to announce and distribute this Echo to all interested participants in your area. Thanks. TTFN. Christopher Baker & GK Pace Moderators -30- any questions? anyone with Areafix already set for this system or for 1:374/26 may link in remotely. all others need to send a Netmail request. the Echo will be distributed privately until it is large enough for moving to the Zone 1 Backbone [or any other Backbones who want to get into it]. thanks. TTFN. Chris & GK * Origin: Rights On! - Announcing ANOTHER Echo? - Titusville_FL (1:374/14) * Forwarded by Christopher Baker on 1:374/14, Rights On! in Titusville FL -- Tom Jennings - via FidoNet node 1:125/555 UUCP: ...!uunet!hoptoad!kumr!fidogate!111!Tom.Jennings INTERNET: Tom.Jennings(a)f111.n125.z1.FIDONET.ORG

1 0