sci.crypt

• Thread Index

---

• Encryption - How to Choose Password
  • From: Stephen
• Re: Enigma-like cipher: variable rotor stepping
  • From: DarkProtoman
• Re: Enigma machine strenght using a computer
  • From: Jeff Dege
• Re: OT: Microsoft does it again?!
  • From: David Wagner
• Re: Enigma machine strenght using a computer
  • From: Mike Amling
• Re: OT: Microsoft does it again?!
  • From: John E. Hadstate
• Re: Enigma machine strenght using a computer
  • From: David Wagner
• Re: Enigma machine strenght using a computer
  • From: Jeff Dege
• Re: KRYPTOS-3 transposition method
  • From: r.e.s.
• Re: Enigma machine strenght using a computer
  • From: Paul Rubin
• Re: Enigma machine strenght using a computer
  • From: Paul Rubin
• Re: Testing XTEA
  • From: Wolfgang Ehrhardt
• Re: Enigma-like cipher: variable rotor stepping
  • From: Jean-François Michaud
• Re: KRYPTOS-3 transposition method
  • From: r.e.s.
• Re: OT: Microsoft does it again?!
  • From: Mike Amling
• Re: Enigma machine strenght using a computer
  • From: Jean-François Michaud
• Re: Enigma machine strenght using a computer
  • From: Jean-François Michaud
• Re: Enigma machine strenght using a computer
  • From: Jean-François Michaud
• Re: The operational FreeMove Quantum Exchange Proof-of-Concept
  • From: David Wagner
• Re: Enigma machine strenght using a computer
  • From: Simon Johnson
• Re: and now for something completely different.
  • From: tomstdenis
• Re: Enigma machine strenght using a computer
  • From: Ignacio aecbi
• Re: KRYPTOS-3 transposition method
  • From: Ignacio aecbi
• Re: Testing XTEA
  • From: Mike Simpson
• Re: Testing XTEA
  • From: Mike Simpson
• Re: The operational FreeMove Quantum Exchange Proof-of-Concept
  • From: Mpilot
• Re: The operational FreeMove Quantum Exchange Proof-of-Concept
  • From: Mpilot
• Re: Enigma machine strenght using a computer
  • From: Paul Rubin
• Enigma-like cipher: variable rotor stepping
  • From: DarkProtoman
• Re: Enigma machine strenght using a computer
  • From: Jean-François Michaud
• Re: and now for something completely different.
  • From: Antony Clements
• Re: OT: Microsoft does it again?!
  • From: Carlos Moreno
• Re: Vegas Vault - A New Encryption Program
  • From: tomstdenis
• Re: OT: Microsoft does it again?!
  • From: clark
• Re: AACS hits the dust.
  • From: Rob Warnock
• Re: OT: Microsoft does it again?!
  • From: clark
• Re: OT: Microsoft does it again?!
  • From: John E. Hadstate
• Re: Enigma machine strenght using a computer
  • From: Ignacio aecbi
• Re: Enigma machine strenght using a computer
  • From: David Eather
• KRYPTOS-3 transposition method
  • From: r.e.s.
• Vegas Vault - A New Encryption Program
  • From: Ken_11010111
• Re: and now for something completely different.
  • From: Valery Pryamikov
• Re: Enigma machine strenght using a computer
  • From: Unruh
• Re: Was the Abwehr Enigma-G stronger than the normal Enigma, due to the rotating reflector?
  • From: DarkProtoman
• Re: OT: Microsoft does it again?!
  • From: Carlos Moreno
• OT: Microsoft does it again?!
  • From: John E. Hadstate
• Re: Enigma machine strenght using a computer
  • From: Jean-François Michaud
• Re: The operational FreeMove Quantum Exchange Proof-of-Concept
  • From: David Wagner
• Re: The operational FreeMove Quantum Exchange Proof-of-Concept
  • From: David Wagner
• Re: Enigma machine strenght using a computer
  • From: Jean-François Michaud
• Re: Was the Abwehr Enigma-G stronger than the normal Enigma, due to the rotating reflector?
  • From: David Hamer
• Re: and now for something completely different.
  • From: Kristian Gjøsteen
• Re: and now for something completely different.
  • From: Antony Clements
• Re: The operational FreeMove Quantum Exchange Proof-of-Concept
  • From: Kristian Gjøsteen
• Re: The operational FreeMove Quantum Exchange Proof-of-Concept
  • From: Kristian Gjøsteen
• Re: Enigma machine strenght using a computer
  • From: Ignacio aecbi
• Re: Testing XTEA
  • From: tomstdenis
• Re: Enigma machine strenght using a computer
  • From: Unruh
• Re: Internet Security Warning!
  • From: nemo_outis
• Re: Internet Security Warning!
  • From: nemo_outis
• Re: Enigma machine strenght using a computer
  • From: Jean-François Michaud
• Re: Testing XTEA
  • From: Wolfgang Ehrhardt
• Re: Testing XTEA
  • From: Mike Simpson
• The operational FreeMove Quantum Exchange Proof-of-Concept (second attempt)
  • From: Juuso Hukkanen
• Re: Internet Security Warning!
  • From: framarks
• Re: Testing XTEA
  • From: tomstdenis
• Testing XTEA
  • From: Mike Simpson
• Re: I'm back, news, good will and all that
  • From: tomstdenis
• Re: I'm back, news, good will and all that
  • From: Christophe Devine
• Re: and now for something completely different.
  • From: Valery Pryamikov
• Re: The operational FreeMove Quantum Exchange Proof-of-Concept
  • From: Mpilot
• Re: I'm back, news, good will and all that
  • From: clark
• Re: I'm back, news, good will and all that
  • From: David A Molnar
• Re: I'm back, news, good will and all that
  • From: Luc The Perverse
• Re: and now for something completely different.
  • From: Antony Clements
• I'm back, news, good will and all that
  • From: tomstdenis
• Was the Abwehr Enigma-G stronger than the normal Enigma, due to the rotating reflector?
  • From: DarkProtoman
• Re: and now for something completely different.
  • From: Antony Clements
• Re: The operational FreeMove Quantum Exchange Proof-of-Concept
  • From: Mpilot
• Re: RSA question as well, following B. Schneier book example
  • From: Carlos Moreno
• Re: Enigma machine strenght using a computer
  • From: Simon Johnson
• Re: The operational FreeMove Quantum Exchange Proof-of-Concept
  • From: Kristian Gjøsteen
• Re: The operational FreeMove Quantum Exchange Proof-of-Concept
  • From: Mpilot
• Re: RSA question as well, following B. Schneier book example
  • From: Mike Amling
• Re: RSA question as well, following B. Schneier book example
  • From: Carlos Moreno
• Re: The operational FreeMove Quantum Exchange Proof-of-Concept
  • From: Kristian Gjøsteen
• Re: RSA question as well, following B. Schneier book example
  • From: Mike Amling
• Re: and now for something completely different.
  • From: Valery Pryamikov
• Re: RSA question as well, following B. Schneier book example
  • From: Vincent Badier
• Re: RSA question as well, following B. Schneier book example
  • From: Bryan Olson
• Re: OT:Peter Gutmann - Nice Article!
  • From: clark
• Re: RSA question as well, following B. Schneier book example
  • From: Carlos Moreno
• Re: RSA question as well, following B. Schneier book example
  • From: M Jason Hinek
• Re: RSA question as well, following B. Schneier book example
  • From: Carlos Moreno
• Re: and now for something completely different.
  • From: Antony Clements
• Re: and now for something completely different.
  • From: Antony Clements
• Re: Enigma machine strenght using a computer
  • From: Mike Amling
• Re: Enigma machine strenght using a computer
  • From: Jean-François Michaud
• Re: RSA question as well, following B. Schneier book example
  • From: Mike Amling
• Re: Enigma machine strenght using a computer
  • From: Ivan Voras
• RSA question as well, following B. Schneier book example
  • From: Vincent Badier
• Re: Enigma machine strenght using a computer
  • From: Jean-François Michaud
• Re: Enigma machine strenght using a computer
  • From: Jean-François Michaud
• Re: Enigma machine strenght using a computer
  • From: Unruh
• Re: Enigma machine strenght using a computer
  • From: Unruh
• Re: Enigma machine strenght using a computer
  • From: Jean-François Michaud
• Re: Enigma machine strenght using a computer
  • From: David Eather
• Re: Enigma machine strenght using a computer
  • From: Jean-François Michaud
• Re: The operational FreeMove Quantum Exchange Proof-of-Concept
  • From: Mpilot
• Re: Enigma machine strenght using a computer
  • From: Unruh
• Enigma machine strenght using a computer
  • From: Jean-François Michaud
• Enigma machine strenght using a computer
  • From: Jean-François Michaud
• Re: The operational FreeMove Quantum Exchange Proof-of-Concept
  • From: Kristian Gjøsteen
• Re: and now for something completely different.
  • From: Kristian Gjøsteen
• Re: Number theoretic functions
  • From: user923005
• The operational FreeMove Quantum Exchange Proof-of-Concept
  • From: Mpilot
• OT:Peter Gutmann - Nice Article!
  • From: Timoleon
• Re: Number theoretic functions
  • From: stdazi@xxxxxxxxx
• Re: Number theoretic functions
  • From: Tim Peters
• Re: and now for something completely different.
  • From: John Hadstate
• Re: Number theoretic functions
  • From: user923005
• AACS hits the dust.
  • From: Jan Panteltje
• Re: Number theoretic functions
  • From: Tim Peters
• Re: and now for something completely different.
  • From: Antony Clements
• Re: announce: the ultimate crypto homepages list
  • From: David Wagner
• Re: Number theoretic functions
  • From: user923005
• Re: Number theoretic functions
  • From: Tim Peters
• Number theoretic functions
  • From: dcorbit
• Re: and now for something completely different.
  • From: Kristian Gjøsteen
• and now for something completely different.
  • From: Antony Clements
• Re: truecrypt keyfile complexity question
  • From: vedaal
• Re: [OT: Trusted Node Authentication™]
  • From: MikeD - Austin, TX
• truecrypt keyfile complexity question
  • From: vedaal
• Re: announce: the ultimate crypto homepages list
  • From: Wei Dai
• Re: announce: the ultimate crypto homepages list
  • From: Wei Dai
• Kryptos part 4.
  • From: Ignacio aecbi
• Re: Re: [OT: Trusted Node Authentication™]
  • From: David Wagner
• Re: [OT: Trusted Node Authentication™]
  • From: MikeD - Austin, TX
• Re: announce: the ultimate crypto homepages list
  • From: David Wagner
• Re: Trusted Node AuthenticationT]
  • From: MikeD - Austin, TX
• Re: Trusted Node AuthenticationT]
  • From: Harvy Resiling
• Re: [OT: Trusted Node Authentication™]
  • From: ecarl1017
• Re: announce: the ultimate crypto homepages list
  • From: clark
• How would seriation weaken a digraphic cipher?
  • From: r.e.s.
• Regarding acoustic echo cancellation using frequency domain LMS algorithm and subband LMS algorithm
  • From: Aparna Ram
• announce: the ultimate crypto homepages list
  • From: Wei Dai
• [OT: Trusted Node Authentication™]
  • From: MikeD - Austin, TX
• Re: What is the maximum length of the message for SHA-1
  • From: Damian 'legion' Szuberski
• Re: What is the maximum length of the message for SHA-1
  • From: Amit
• Re: What is the maximum length of the message for SHA-1
  • From: Luc The Perverse
• Re: What is the maximum length of the message for SHA-1
  • From: Bryan Olson
• Re: What is the maximum length of the message for SHA-1
  • From: Simon
• Re: What is the maximum length of the message for SHA-1
  • From: Damian 'legion' Szuberski
• clique method in differential cryptanalysis
  • From: ReZa
• What is the maximum length of the message for SHA-1
  • From: Simon
• Christmas Greetings
  • From: Simon Johnson
• Re: ADVERT: Secure comms
  • From: sandyinchina
• Re: Do Gap-CDH groups exist?
  • From: Amit
• Re: Please Help: x.509 Certificates Library or non-certificate authentication
  • From: clark
• Re: Please Help: x.509 Certificates Library or non-certificate authentication
  • From: Christophe Devine
• Re: Do Gap-CDH groups exist?
  • From: yampolskiy
• Re: Please Help: x.509 Certificates Library or non-certificate authentication
  • From: Paul Rubin
• Re: Key-based cryptographic modes
  • From: sandyinchina
• Re: Please Help: x.509 Certificates Library or non-certificate authentication
  • From: clark
• Re: Please Help: x.509 Certificates Library or non-certificate authentication
  • From: Jeff
• Re: Poly1305 vs. UMAC vs. new MAC1071
  • From: Wei Dai
• Re: Poly1305 vs. UMAC vs. new MAC1071
  • From: D. J. Bernstein
• Re: Please Help: x.509 Certificates Library or non-certificate authentication
  • From: clark
• Re: Poly1305 vs. UMAC vs. new MAC1071
  • From: Wei Dai
• Re: Dividing 512 bit number by 128 bit number in C program
  • From: Le Chaud Lapin
• Re: crypto challenge
  • From: Amit
• Re: Dividing 512 bit number by 128 bit number in C program
  • From: Phil Carmody
• Re: Please Help: x.509 Certificates Library or non-certificate authentication
  • From: Christophe Devine
• Re: Dividing 512 bit number by 128 bit number in C program
  • From: Christian Siebert
• Re: Please Help: x.509 Certificates Library or non-certificate authentication
  • From: Jeff
• BBC links:Privacy Concerns over States/Corporations'Use of Personal Info
  • From: mashi3981@xxxxxxxxx
• Re: Please Help: x.509 Certificates Library or non-certificate authentication
  • From: Le Chaud Lapin
• Re: RSA Performance
  • From: Le Chaud Lapin
• Re: Please Help: x.509 Certificates Library or non-certificate authentication
  • From: Jeff
• Re: RSA Performance
  • From: Carlos Moreno
• Re: Dividing 512 bit number by 128 bit number in C program
  • From: Le Chaud Lapin
• Re: Please Help: x.509 Certificates Library or non-certificate authentication
  • From: fortune . bruce
• Re: Dividing 512 bit number by 128 bit number in C program
  • From: vaidehikedlaya
• Re: Dividing 512 bit number by 128 bit number in C program
  • From: Le Chaud Lapin
• Dividing 512 bit number by 128 bit number in C program
  • From: vaidehikedlaya
• Re: RSA Performance
  • From: Mike Amling
• Re: RSA Performance
  • From: Le Chaud Lapin
• Re: RSA Performance
  • From: Carlos Moreno
• Re: RSA Performance
  • From: Le Chaud Lapin
• Re: Do Gap-CDH groups exist?
  • From: Kristian Gjøsteen
• Please Help: x.509 Certificates Library or non-certificate authentication
  • From: Jeff
• Do Gap-CDH groups exist?
  • From: amitabh123
• Re: RSA Performance
  • From: Mike Amling
• Re: Decrypt messages received from different senders
  • From: amitabh123
• Re: Can we all talk about the elephant in the room?
  • From: David Eather
• Re: Can we all talk about the elephant in the room?
  • From: David Eather
• Re: Key-based cryptographic modes
  • From: Valery Pryamikov
• Re: Key-based cryptographic modes
  • From: David Wagner
• Re: Please explain in simple terms -- key collision attack
  • From: da5id65536@xxxxxxxxx
• Re: RSA Performance
  • From: Le Chaud Lapin
• To Beale Screamer
  • From: fiddle_flyer
• How would seriation weaken a digraphic cipher?
  • From: r.e.s.
• Key-based cryptographic modes
  • From: Jeff Dege
• Re: RSA Performance
  • From: Le Chaud Lapin
• Re: Decrypt messages received from different senders
  • From: Peter Fairbrother
• Re: RSA Performance
  • From: Mike Amling
• Re: Can we all talk about the elephant in the room?
  • From: Arthur J. O'Dwyer
• Re: Can we all talk about the elephant in the room?
  • From: vedaal
• Re: RSA Performance
  • From: Carlos Moreno
• Re: Please explain in simple terms -- key collision attack
  • From: Unruh
• Re: Can we all talk about the elephant in the room?
  • From: David Eather
• Re: Can we all talk about the elephant in the room?
  • From: David Eather
• Re: Sorry, Joe
  • From: david . florman
• Re: Can we all talk about the elephant in the room?
  • From: david . florman
• Re: Can we all talk about the elephant in the room?
  • From: vedaal
• Re: twofish
  • From: Antony Clements
• Re: Sorry, Joe
  • From: Simon Johnson
• Re: RSA Performance
  • From: Le Chaud Lapin
• Re: Can we all talk about the elephant in the room?
  • From: Luc The Perverse
• Re: RSA Performance
  • From: Joseph Ashwood
• Re: Number generation based on a pattern of previously generated numbers
  • From: da5id65536@xxxxxxxxx
• Re: Please explain in simple terms -- key collision attack
  • From: da5id65536@xxxxxxxxx
• RSA Performance
  • From: Le Chaud Lapin
• Re: Can we all talk about the elephant in the room?
  • From: Andrew Swallow
• Re: How random is RNGCryptoServiceProvider?
  • From: Mark Probert
• Re: twofish
  • From: Antony Clements
• Re: Can we all talk about the elephant in the room?
  • From: Joseph Ashwood
• Please explain in simple terms -- key collision attack
  • From: AM
• Re: I retract this. Can we all talk about the elephant in the room?
  • From: David Eather
• Re: How random is RNGCryptoServiceProvider?
  • From: yampolskiy
• Re: Can we all talk about the elephant in the room?
  • From: Luc The Perverse
• Re: Decrypt messages received from different senders
  • From: rossum
• Re: Can we all talk about the elephant in the room?
  • From: David Eather
• Re: Can we all talk about the elephant in the room?
  • From: David Eather
• Sorry, Joe
  • From: david . florman
• Re: Can we all talk about the elephant in the room?
  • From: david . florman
• Re: Can we all talk about the elephant in the room?
  • From: Luc The Perverse
• Re: Decrypt messages received from different senders
  • From: vedaal
• Can we all talk about the elephant in the room?
  • From: David Eather
• Re: Decrypt messages received from different senders
  • From: Sergei
• Re: Efficient Exponentiation of a Shared Secret
  • From: eike . kiltz
• Re: Decrypt messages received from different senders
  • From: Peter Pearson
• Re: Decrypt messages received from different senders
  • From: Sergei
• Re: Decrypt messages received from different senders
  • From: Paul Rubin
• Decrypt messages received from different senders
  • From: Sergei
• Re: twofish
  • From: clark
• Re: Outerbridge des.c on AIX (bigendian)
  • From: Neil W.
• Re: Zfone security
  • From: Paul Rubin
• Re: How random is RNGCryptoServiceProvider?
  • From: Mark Probert
• Re: Zfone security
  • From: Joseph Ashwood
• Re: Edible One-Time Pad books
  • From: Matt Mahoney
• >-) ~-`-`- Amazing 5.5" Turd Cutter -' -'-~ (-<
  • From: google98.email@xxxxxxxxxxx
• Re: Zfone security
  • From: Joseph Ashwood
• twofish
  • From: Antony Clements
• Re: How random is RNGCryptoServiceProvider?
  • From: Unruh
• Re: Efficient Exponentiation of a Shared Secret
  • From: Mike Amling
• Re: How random is RNGCryptoServiceProvider?
  • From: yampolskiy
• Re: Zfone security
  • From: Paul Rubin
• Re: Zfone security
  • From: Peter Fairbrother
• Re: Zfone security
  • From: Peter Fairbrother
• Re: crypto challenge
  • From: amitabh123
• Re: Seen Tom St Denis latly?
  • From: ink
• Re: Zfone security
  • From: Paul Rubin
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Bodo Moeller
• Re: Zfone security
  • From: vedaal
• Re: Outerbridge des.c on AIX (bigendian)
  • From: Simon Johnson
• Re: Number generation based on a pattern of previously generated numbers
  • From: Kristian Gjøsteen
• Re: Efficient Exponentiation of a Shared Secret
  • From: Kristian Gjøsteen
• Re: Number generation based on a pattern of previously generated numbers
  • From: Simon Johnson
• Re: Number generation based on a pattern of previously generated numbers
  • From: Kristian Gjøsteen
• Re: Number generation based on a pattern of previously generated numbers
  • From: Simon Johnson
• Re: Using Miracl under the Linux environment
  • From: Samson
• Re: covering radius (was "maximum distance") of a Goppa code?
  • From: Wei Dai
• Re: Zfone security
  • From: Paul Rubin
• Re: Zfone security
  • From: Joseph Ashwood
• Re: Zfone security
  • From: Peter Fairbrother
• Re: Zfone security
  • From: D Jablon
• Dig-Sig for MS Word
  • From: Tom
• Re: Number generation based on a pattern of previously generated numbers
  • From: laura fairhead
• Re: Efficient Exponentiation of a Shared Secret
  • From: Robert
• Re: Zfone security
  • From: Cactus
• Re: Zfone security
  • From: Simon Johnson
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Peter Pearson
• Zfone security
  • From: Peter Fairbrother
• Efficient Exponentiation of a Shared Secret
  • From: Robert
• Re: crypto challenge
  • From: Robert
• uri geller
  • From: uri.geller.jokes@xxxxxxxxx
• Re: Using Miracl under the Linux environment
  • From: Phil Carmody
• Using Miracl under the Linux environment
  • From: Samson
• Re: Seen Tom St Denis latly?
  • From: Juuso Hukkanen
• Re: Seen Tom St Denis latly?
  • From: Christophe Devine
• Re: AES code in Sparc assember
  • From: Casper H . S . Dik
• Re: covering radius (was "maximum distance") of a Goppa code?
  • From: daniel bleichenbacher
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Paul Rubin
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Mike Amling
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Joseph Ashwood
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Bodo Moeller
• Re: covering radius (was "maximum distance") of a Goppa code?
  • From: Wei Dai
• Re: Seen Tom St Denis latly?
  • From: David A Molnar
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Paul Rubin
• Re: "maximum distance" of a Goppa code?
  • From: daniel bleichenbacher
• Re: AES code in Sparc assember
  • From: clark
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Thomas Pornin
• Re: secure election with sms
  • From: citycrypt@xxxxxxxxx
• Re: secure election with sms
  • From: citycrypt@xxxxxxxxx
• Outerbridge des.c on AIX (bigendian)
  • From: Neil W.
• Re: AES Key expansion question
  • From: jetmarc
• Re: Elliptic curve factoring with points *NOT* on the curve
  • From: bongomongo
• Re: Edible One-Time Pad books
  • From: Unruh
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Paul Rubin
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Joseph Ashwood
• Re: Elliptic curve factoring with points *NOT* on the curve
  • From: ttw
• Re: "maximum distance" of a Goppa code?
  • From: DmitryKovtun
• "maximum distance" of a Goppa code?
  • From: Wei Dai
• Re: Seen Tom St Denis latly?
  • From: Luc The Perverse
• Re: Seen Tom St Denis latly?
  • From: Joseph Ashwood
• Re: Elliptic curve factoring with points *NOT* on the curve
  • From: Phil Carmody
• Re: Seen Tom St Denis latly?
  • From: clark
• Re: Elliptic curve factoring with points *NOT* on the curve
  • From: Mike Amling
• Re: Seen Tom St Denis latly?
  • From: Douglas A. Gwyn
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Douglas A. Gwyn
• Re: 2006/467 Chang Yung: silly?
  • From: Valery Pryamikov
• Re: Elliptic curve factoring with points *NOT* on the curve
  • From: Mike Scott
• Re: AES Key expansion question
  • From: Valery Pryamikov
• Re: Elliptic curve factoring with points *NOT* on the curve
  • From: bongomongo
• Re: Seen Tom St Denis latly?
  • From: fortune . bruce
• Re: Seen Tom St Denis latly?
  • From: David Eather
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Peter Pearson
• Re: Seen Tom St Denis latly?
  • From: Matthew Fanto
• Re: Elliptic curve factoring with points *NOT* on the curve
  • From: Phil Carmody
• Re: Seen Tom St Denis latly?
  • From: Phil Carmody
• Re: Seen Tom St Denis latly?
  • From: Paul Rubin
• Re: Seen Tom St Denis latly?
  • From: clark
• Re: Seen Tom St Denis latly?
  • From: Jean-Luc Cooke
• Re: Seen Tom St Denis latly?
  • From: David Eather
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: BenL
• Re: Edible One-Time Pad books
  • From: Joseph Ashwood
• Elliptic curve factoring with points *NOT* on the curve
  • From: bongomongo
• Re: Edible One-Time Pad books
  • From: admin
• Re: Extending Goldwasser-Micali
  • From: Kristian Gjøsteen
• Re: Seen Tom St Denis latly?
  • From: Kristian Gjøsteen
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Wei Dai
• Re: Seen Tom St Denis latly?
  • From: JR
• Re: Edible One-Time Pad books
  • From: Ernest Hammingweight
• Re: Edible One-Time Pad books
  • From: Unruh
• Re: Extending Goldwasser-Micali
  • From: David Wagner
• Re: error correcting/detecting code question
  • From: jsavard
• Extending Goldwasser-Micali
  • From: Mike Amling
• Re: Edible One-Time Pad books
  • From: admin
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Paul Rubin
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Paul Rubin
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Christophe Devine
• Re: Seen Tom St Denis latly?
  • From: David Wagner
• Re: error correcting/detecting code question
  • From: Peter Pearson
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Peter Pearson
• Re: Seen Tom St Denis latly?
  • From: Simon Johnson
• Re: error correcting/detecting code question
  • From: Mike Amling
• Re: group signature
  • From: vedaal
• Re: Seen Tom St Denis latly?
  • From: clark
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Carlos Moreno
• error correcting/detecting code question
  • From: Bart Vandewoestyne
• Re: Does Privacy Preserving Data Mining make any sence?
  • From: Kristian Gjøsteen
• Re: group signature
  • From: guss
• Re: Edible One-Time Pad books
  • From: Ernest Hammingweight
• Re: AES Key expansion question
  • From: Stefan Lucks
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Joseph Ashwood
• Re: Key management vs. Authentication Tag Size
  • From: Ulfrei
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: BenL
• Re: Digital signature repository
  • From: Mike Amling
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Felix Rawlings
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Mike Amling
• Re: Edible One-Time Pad books
  • From: Mike Amling
• Re: Key management vs. Authentication Tag Size
  • From: Mike Amling
• Re: Edible One-Time Pad books
  • From: Unruh
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Bruce Stephens
• Re: Edible One-Time Pad books
  • From: amitabh123
• Re: Edible One-Time Pad books
  • From: admin
• Re: AES Key expansion question
  • From: Peter van Liesdonk
• Re: So, what is it about OpenSSL and sci.crypt?
  • From: Paul Rubin
• So, what is it about OpenSSL and sci.crypt?
  • From: Carlos Moreno
• Re: implemented DES brute force attack
  • From: Peter Trei
• Re: Digital signature repository
  • From: David R. Tribble
• crypto challenge
  • From: amitabh123
• Re: secure election with sms
  • From: Kimmo Koivisto
• 2006/467 Chang Yung: silly?
  • From: D. J. Bernstein
• Re: Seen Tom St Denis latly?
  • From: Simon Johnson
• Seen Tom St Denis latly?
  • From: Jean-Luc Cooke
• Re: AES Key expansion question
  • From: Stefan Lucks
• Re: AES Key expansion question
  • From: Simon Johnson
• Re: AES Key expansion question
  • From: Peter van Liesdonk
• Re: secure election with sms
  • From: Civitas Fenniae
• Re: AES Key expansion question
  • From: Robert
• Re: AES Key expansion question
  • From: Peter van Liesdonk
• Re: secure election with sms
  • From: Robert
• Re: AES Key expansion question
  • From: Robert
• Re: AES Key expansion question
  • From: Simon Johnson
• secure election with sms
  • From: citycrypt@xxxxxxxxx
• AES Key expansion question
  • From: Robert
• Key management vs. Authentication Tag Size
  • From: Ulfrei
• Re: How random is RNGCryptoServiceProvider?
  • From: TomFoolery
• Re: BBS with unknown N parameter
  • From: Scott Contini
• Re: Edible One-Time Pad books
  • From: Paul Rubin
• Re: How random is RNGCryptoServiceProvider?
  • From: fortune . bruce
• Re: How random is RNGCryptoServiceProvider?
  • From: rossum
• Re: Edible One-Time Pad books
  • From: Unruh
• Re: How random is RNGCryptoServiceProvider?
  • From: fortune . bruce
• Re: How random is RNGCryptoServiceProvider?
  • From: Unruh
• Re: How random is RNGCryptoServiceProvider?
  • From: Unruh
• Re: Edible One-Time Pad books
  • From: framarks
• Re: How random is RNGCryptoServiceProvider?
  • From: Simon Johnson
• How random is RNGCryptoServiceProvider?
  • From: Mark Probert
• Re: Edible One-Time Pad books
  • From: David Eather
• Re: implemented DES brute force attack
  • From: Unruh
• Re: more secure communication over the network
  • From: secretcodebreaker
• Re: Does Privacy Preserving Data Mining make any sence?
  • From: Sergei
• Re: implemented DES brute force attack
  • From: Simon Johnson
• Re: implemented DES brute force attack
  • From: tor
• implemented DES brute force attack
  • From: Nikola Skoric
• Re: group signature
  • From: vedaal
• Re: Fujisaki-Okamoto Hybrid Encryption
  • From: Peter van Liesdonk
• Unbalanced Feistel Networks security
  • From: Diego Taylor
• Re: Fujisaki-Okamoto Hybrid Encryption
  • From: eike . kiltz
• Re: Fujisaki-Okamoto Hybrid Encryption
  • From: Peter van Liesdonk
• Re: Fujisaki-Okamoto Hybrid Encryption
  • From: Kristian Gjøsteen
• Re: Fujisaki-Okamoto Hybrid Encryption
  • From: sillybanter
• Re: Fujisaki-Okamoto Hybrid Encryption
  • From: Peter van Liesdonk
• Re: Fujisaki-Okamoto Hybrid Encryption
  • From: Kristian Gjøsteen
• Re: Edible One-Time Pad books
  • From: Kristian Gjøsteen
• Fujisaki-Okamoto Hybrid Encryption
  • From: Peter van Liesdonk
• Edible One-Time Pad books
  • From: admin
• Re: BBS with unknown N parameter
  • From: Simon Johnson
• Re: IBE and HIBE
  • From: eike . kiltz
• Re: Does Privacy Preserving Data Mining make any sence?
  • From: Kristian Gjøsteen
• Does Privacy Preserving Data Mining make any sence?
  • From: Sergei
• Re: BBS with unknown N parameter
  • From: Kristian Gjøsteen
• Re: BBS with unknown N parameter
  • From: Scott Contini
• Re: CryptoDox - Encyclopedia on Cryptography & Information Security
  • From: Matt
• Re: Help !!! RSA with OpenSSL
  • From: Carlos Moreno
• Re: AES code in Sparc assember
  • From: Carlos Moreno
• Re: where use RSA?
  • From: Carlos Moreno
• Re: AES code in Sparc assember
  • From: clark
• Re: AES code in Sparc assember
  • From: clark
• Re: Digital signature repository
  • From: Mike Amling
• Re: Help !!! RSA with OpenSSL
  • From: Carlos Moreno
• Re: Digital signature repository
  • From: David R. Tribble
• Re: AES code in Sparc assember
  • From: Carlos Moreno
• Digital signature repository
  • From: David R. Tribble
• Re: BBS with unknown N parameter
  • From: Simon Johnson
• Re: BBS with unknown N parameter
  • From: Kristian Gjøsteen
• Re: where use RSA?
  • From: Pubkeybreaker
• Re: AES code in Sparc assember
  • From: Chris Card
• Re: AES code in Sparc assember
  • From: clark
• Re: CryptoDox - Encyclopedia on Cryptography & Information Security
  • From: sillybanter
• performance of One key MAC (OMAC)
  • From: Ulf Reiman
• Re: BBS with unknown N parameter
  • From: Christian Siebert
• Re: BBS with unknown N parameter
  • From: Simon Johnson
• where use RSA?
  • From: athur-luobo
• Re: BBS with unknown N parameter
  • From: Joseph Ashwood
• Re: Help !!! RSA with OpenSSL
  • From: Christian Siebert
• Re: AES code in Sparc assember
  • From: Rob Warnock
• Small errata: Help !!! RSA with OpenSSL
  • From: Carlos Moreno
• Help !!! RSA with OpenSSL
  • From: Carlos Moreno
• Re: Dimensions of Encipherment
  • From: Mike McNally
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Unruh
• Re: CryptoDox - Encyclopedia on Cryptography & Information Security
  • From: lars . adler
• Re: BBS with unknown N parameter
  • From: David Eather
• BBS with unknown N parameter
  • From: Simon Johnson
• Cache Attack on AES
  • From: sukeshjain
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Sergei
• Re: CryptoDox - Encyclopedia on Cryptography & Information Security
  • From: Paul Rubin
• CryptoDox - Encyclopedia on Cryptography & Information Security
  • From: Anuj
• Re: how secure is SSL?
  • From: Mpilot
• Re: AES code in Sparc assember
  • From: clark
• Re: how secure is SSL?
  • From: Joseph Ashwood
• Re: AES code in Sparc assember
  • From: Carlos Moreno
• Re: AES code in Sparc assember
  • From: clark
• Re: Cryptography in the UK...
  • From: Simon Johnson
• Re: how secure is SSL?
  • From: Simon Johnson
• Re: Disk encryption software for Win98 and Win2000/XP
  • From: nemo_outis
• Re: how secure is SSL?
  • From: Kristian Gjøsteen
• Re: Disk encryption software for Win98 and Win2000/XP
  • From: atapen@xxxxxxxxxxxx
• Re: how secure is SSL?
  • From: tick
• Re: Disk encryption software for Win98 and Win2000/XP
  • From: tick
• Re: group signature
  • From: Vicious . vivacious
• Re: how secure is SSL?
  • From: Joseph Ashwood
• Re: AES code in Sparc assember
  • From: Arthur J. O'Dwyer
• Re: how secure is SSL?
  • From: tick
• Re: how secure is SSL?
  • From: Joseph Ashwood
• Re: what is probability to create two equal hashes for md5algorithm
  • From: Joseph Ashwood
• Re: Disk encryption software for Win98 and Win2000/XP
  • From: nemo_outis
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Unruh
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Unruh
• Re: group signature
  • From: vedaal
• Re: how secure is SSL?
  • From: Thomas B.
• Re: how secure is SSL?
  • From: Mike Amling
• Re: how secure is SSL?
  • From: Matthew Fanto
• Re: how secure is SSL?
  • From: Matthew Fanto
• Re: how secure is SSL?
  • From: Mpilot
• Re: Disk encryption software for Win98 and Win2000/XP
  • From: tick
• Re: how secure is SSL?
  • From: netscape
• Re: how secure is SSL?
  • From: Mpilot
• Re: how secure is SSL?
  • From: Matthew Fanto
• Re: how secure is SSL?
  • From: Mpilot
• Re: Disk encryption software for Win98 and Win2000/XP
  • From: nemo_outis
• Re: how secure is SSL?
  • From: Matthew Fanto
• Re: how secure is SSL?
  • From: Matthew Fanto
• Re: how secure is SSL?
  • From: Kristian Gjøsteen
• Re: how secure is SSL?
  • From: Mpilot
• AES code in Sparc assember
  • From: bytebro
• Re: group signature
  • From: Vicious . vivacious
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Peter Fairbrother
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Peter Fairbrother
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Peter Fairbrother
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Joseph Ashwood
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Peter Fairbrother
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Sergei
• Re: Cryptography in the UK...
  • From: BRG
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Joseph Ashwood
• Re: can anyone post a FAQ or explain in plain english what encryption really is?
  • From: kalimaa
• Re: Disk encryption software for Win98 and Win2000/XP
  • From: netscape
• how secure is SSL?
  • From: netscape
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Unruh
• can anyone post a FAQ or explain in plain english what encryption really is?
  • From: tick
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Unruh
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Peter Fairbrother
• Re: Cryptography in the UK...
  • From: Peter Fairbrother
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Peter Fairbrother
• Re: Cryptography in the UK...
  • From: Unruh
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Unruh
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Unruh
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Unruh
• Re: group signature
  • From: Peter Fairbrother
• Disk encryption software for Win98 and Win2000/XP
  • From: Nomen Nescio
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Mike Amling
• Re: Cryptography in the UK...
  • From: Richard Clayton
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Volker Hetzer
• Re: group signature
  • From: guss
• Re: Number generation based on a pattern of previously generated numbers
  • From: Peter Pearson
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Peter Fairbrother
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Sergei
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Volker Hetzer
• Re: Cryptography in the UK...
  • From: Simon Johnson
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Peter Fairbrother
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Sergei
• Re: Group verifiable encryption
  • From: Joseph Ashwood
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Joseph Ashwood
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Joseph Ashwood
• Re: Number generation based on a pattern of previously generated numbers
  • From: Unruh
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Carlos Moreno
• Number generation based on a pattern of previously generated numbers
  • From: Naivite
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Mike Amling
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Sergei
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Carlos Moreno
• Re: group signature
  • From: vedaal
• Group verifiable encryption
  • From: Berlid
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Unruh
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Unruh
• Re: group signature
  • From: enzymatic . bubble
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Volker Hetzer
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Sergei
• Re: group signature
  • From: vedaal
• IBE and HIBE
  • From: brian . james . kirby
• Re: Storing data
  • From: Peter van Liesdonk
• group signature
  • From: guss
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Peter Fairbrother
• Re: Storing data
  • From: hula
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Peter Fairbrother
• Re: Need a quick advice plz
  • From: zzz
• Re: Cryptography in the UK...
  • From: mm
• Re: Need a quick advice plz
  • From: Ian Toltz
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Luc The Perverse
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Mike Amling
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Joseph Ashwood
• Re: Storing data
  • From: hula
• Re: Storing data
  • From: Ivan Voras
• Re: Storing data
  • From: hula
• Re: Storing data
  • From: hula
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: James Stroud
• Re: Storing data
  • From: Ivan Voras
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Unruh
• Re: CSS: Disk key. Why?
  • From: Mike Amling
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Mike Amling
• Re: Cryptography in the UK...
  • From: Arthur J. O'Dwyer
• Re: RSACryptoServiceProvider or similar
  • From: Mike Amling
• Storing data
  • From: hula
• Re: Cryptography in the UK...
  • From: da5id65536
• Re: what is probability to create two equal hashes for md5 algorithm
  • From: Christian Siebert
• what is probability to create two equal hashes for md5 algorithm
  • From: Dmitry Chumack
• Re: Cryptography in the UK...
  • From: Unruh
• Re: CSS: Disk key. Why?
  • From: Tom St Denis
• Re: CSS: Disk key. Why?
  • From: clark
• Re: Need a quick advice plz
  • From: Salami Man
• Re: CSS: Disk key. Why?
  • From: Ernest Hammingweight
• Re: Need a quick advice plz
  • From: Tom St Denis
• Re: Need a quick advice plz
  • From: Salami Man
• Re: Database encryption facilities
  • From: Volker Hetzer
• Re: Cryptography in the UK...
  • From: Daniel James
• Re: CSS: Disk key. Why?
  • From: Kristian Gjøsteen
• Re: RSACryptoServiceProvider or similar
  • From: hula
• Re: Cryptography in the UK...
  • From: David Eather
• Re: Cryptography in the UK...
  • From: Thad Mulligan
• Re: Cryptography in the UK...
  • From: Unruh
• Database encryption facilities (was: Re: a simple question regarding AES)
  • From: Carlos Moreno
• Re: Need a quick advice plz
  • From: Carlos Moreno
• Re: Cryptography in the UK...
  • From: da5id65536
• Re: Need a quick advice plz
  • From: da5id65536
• Re: XML encryption
  • From: xml
• Re: Language as a cipher?
  • From: Glenn P.,
• Re: Cost of modexp's?
  • From: BRG
• Re: RSACryptoServiceProvider or similar
  • From: Mike Amling
• Re: Dimensions of Encipherment
  • From: Jean-Luc Cooke
• Re: CSS: Disk key. Why?
  • From: Tom St Denis
• Re: CSS: Disk key. Why?
  • From: Ernest Hammingweight
• Re: XML encryption
  • From: Jean-Luc Cooke
• Re: Cost of modexp's?
  • From: Mike Amling
• Re: CSS: Disk key. Why?
  • From: Mike Amling
• Re: RSACryptoServiceProvider or similar
  • From: Mike Amling
• Re: Need a quick advice plz
  • From: Tom St Denis
• Re: a simple question regarding AES
  • From: Tom St Denis
• Re: Need a quick advice plz
  • From: Ian Toltz
• Re: a simple question regarding AES
  • From: ttt.tas@xxxxxxxxx
• Re: a simple question regarding AES
  • From: Volker Hetzer
• Need a quick advice plz
  • From: ttt.tas@xxxxxxxxx
• Re: a simple question regarding AES
  • From: ttt.tas@xxxxxxxxx
• Re: CSS: Disk key. Why?
  • From: Ernest Hammingweight
• Re: CSS: Disk key. Why?
  • From: clark
• Re: CSS: Disk key. Why?
  • From: Peter Fairbrother
• Re: CSS: Disk key. Why?
  • From: Tom St Denis
• Re: CSS: Disk key. Why?
  • From: Ernest Hammingweight
• Re: CSS: Disk key. Why?
  • From: Tom St Denis
• CSS: Disk key. Why?
  • From: Ernest Hammingweight
• Re: a simple question regarding AES
  • From: Volker Hetzer
• Re: a simple question regarding AES
  • From: Peter van Liesdonk
• Re: a simple question regarding AES
  • From: Joseph Ashwood
• a simple question regarding AES
  • From: ttt . tas
• Re: Cost of modexp's?
  • From: Tom St Denis
• Re: Halarious
  • From: zzz
• Re: Cost of modexp's?
  • From: Paul Rubin
• Re: Cost of modexp's?
  • From: BRG
• Re: Tämän hetkinen sää on Jumalan lahja ihmisille .....
  • From: kalimaa
• Re: Cost of modexp's?
  • From: Mike Scott
• Re: RSACryptoServiceProvider or similar
  • From: hula
• Re: Cost of modexp's?
  • From: BRG
• Re: RSACryptoServiceProvider or similar
  • From: hula
• Re: Halarious
  • From: Joseph Ashwood
• Re: Cost of modexp's?
  • From: Tom St Denis
• Re: Cryptography in the UK...
  • From: Peter Fairbrother
• Re: Cost of modexp's?
  • From: Peter Fairbrother
• Re: Cryptography in the UK...
  • From: zzz
• Re: Cryptography in the UK...
  • From: Tom St Denis
• Re: Cryptography in the UK...
  • From: zzz
• Re: about joe-jobs/trolling
  • From: mm
• Re: Cryptography in the UK...
  • From: Tom St Denis
• Re: Cryptography in the UK...
  • From: zzz
• Re: Cryptography in the UK...
  • From: Tom St Denis
• Re: Cryptography in the UK...
  • From: zzz
• Re: Cryptography in the UK...
  • From: Tom St Denis
• Re: Cryptography in the UK...
  • From: zzz
• Re: Cryptography in the UK...
  • From: Tom St Denis
• Re: Cryptography in the UK...
  • From: zzz
• Re: Cryptography in the UK...
  • From: Unruh
• Re: Cryptography in the UK...
  • From: zzz
• Re: RSACryptoServiceProvider or similar
  • From: Mike Amling
• Re: RSACryptoServiceProvider or similar
  • From: Tom St Denis
• Re: RSACryptoServiceProvider or similar
  • From: hula
• Re: RSACryptoServiceProvider or similar
  • From: Tom St Denis
• Re: Cryptography in the UK...
  • From: Unruh
• Re: RSACryptoServiceProvider or similar
  • From: hula
• Re: RSACryptoServiceProvider or similar
  • From: hula
• Re: RSACryptoServiceProvider or similar
  • From: Tom St Denis
• Re: RSACryptoServiceProvider or similar
  • From: hula
• Re: Cryptography in the UK...
  • From: BRG
• Re: RSACryptoServiceProvider or similar
  • From: Tom St Denis
• RSACryptoServiceProvider or similar
  • From: hula
• Cryptography in the UK...
  • From: Oliver_FF
• Re: about joe-jobs/trolling
  • From: clark
• Re: volunteer auditing/verification
  • From: clark
• Re: about joe-jobs/trolling
  • From: Paul Rubin
• Re: volunteer auditing/verification
  • From: Tom St Denis
• Re: about joe-jobs/trolling
  • From: clark
• about joe-jobs/trolling
  • From: Tom St Denis
• Re: volunteer auditing/verification
  • From: clark
• Re: Shamir's Trick (EC-DSA verify)
  • From: Tom St Denis
• Shamir's Trick (EC-DSA verify)
  • From: Tom St Denis
• Electronic Signature Validator
  • From: mrella
• Re: Inexpensive authentication
  • From: David Eather
• Re: Inexpensive authentication
  • From: David Wagner
• Re: volunteer auditing/verification
  • From: Tom St Denis
• Re: Cost of modexp's?
  • From: Tom St Denis
• Re: can you decrypt?
  • From: David Eather
• Re: Inexpensive authentication
  • From: David Eather
• Re: Programs for breaking Classic Ciphers
  • From: secretcodebreaker
• Re: Usable pen-and-paper ciphers?
  • From: Simon Johnson
• Re: Usable pen-and-paper ciphers?
  • From: Simon Johnson
• Re: XML encryption
  • From: xml
• Re: Cost of modexp's?
  • From: BRG
• Re: Hardware Security Modules (HSM)
  • From: Joseph Ashwood
• Re: Cost of modexp's?
  • From: Phil Carmody
• Re: Hardware Security Modules (HSM)
  • From: zzz
• Re: Cost of modexp's?
  • From: robertwessel2@xxxxxxxxx
• Dimensions of Encipherment
  • From: Mike McNally
• Re: Hash libraries
  • From: Doug
• Re: Hardware Security Modules (HSM)
  • From: JR
• Re: Hardware Security Modules (HSM)
  • From: Joseph Ashwood
• Re: Inexpensive authentication
  • From: aliptah
• Re: Inexpensive authentication
  • From: David Wagner
• Re: Inexpensive authentication
  • From: aliptah
• Re: ADVERT: C12-GAMMA
  • From: noload
• Re: Inexpensive authentication
  • From: Kristian Gjøsteen
• Hardware Security Modules (HSM)
  • From: karl
• Re: Inexpensive authentication
  • From: Matthew Fanto
• Re: ADVERT: C12-GAMMA
  • From: fortune . bruce
• Re: can you decrypt?
  • From: Douglas A. Gwyn
• Inexpensive authentication
  • From: aliptah
• Re: Usable pen-and-paper ciphers?
  • From: Alan
• Re: Usable pen-and-paper ciphers?
  • From: Alan
• Re: XML encryption
  • From: Jean-Luc Cooke
• Re: Cost of modexp's?
  • From: Thomas Carter
• Re: Cost of modexp's?
  • From: Marcus Streets
• Re: Cost of modexp's?
  • From: Peter Fairbrother
• Re: Cost of modexp's?
  • From: BRG
• RIPE-MD 160 ?
  • From: Senderos
• Re: Cost of modexp's?
  • From: Pubkeybreaker
• Re: Usable pen-and-paper ciphers?
  • From: John Hadstate
• Cost of modexp's?
  • From: Peter Fairbrother
• Re: New attacks on the financial PIN processing
  • From: Anne & Lynn Wheeler
• Re: volunteer auditing/verification
  • From: clark
• Re: Comaprison between MD5 and SHA
  • From: Stelian Ene
• Re: Usable pen-and-paper ciphers?
  • From: Mike McNally
• volunteer auditing/verification
  • From: Tom St Denis
• Re: Usable pen-and-paper ciphers?
  • From: da5id65536
• Re: Usable pen-and-paper ciphers?
  • From: Unruh
• Re: Usable pen-and-paper ciphers?
  • From: Unruh
• Re: Usable pen-and-paper ciphers?
  • From: Pubkeybreaker
• Re: Usable pen-and-paper ciphers?
  • From: Markus Jansson
• Re: Usable pen-and-paper ciphers?
  • From: vedaal
• Re: Usable pen-and-paper ciphers?
  • From: secretcodebreaker
• Re: can you decrypt?
  • From: Mike McNally
• Re: Usable pen-and-paper ciphers?
  • From: Alan
• Re: ADVERT: C12-GAMMA
  • From: clark
• XML encryption
  • From: xml
• 3rd Chaos Communication Congress: planned events/
  • From: Jan Panteltje
• Re: Usable pen-and-paper ciphers?
  • From: David Eather
• Re: Usable pen-and-paper ciphers?
  • From: VPE
• Re: Usable pen-and-paper ciphers?
  • From: VPE
• Re: Usable pen-and-paper ciphers?
  • From: Markus Jansson
• Re: Hash libraries
  • From: Phil Carmody
• Re: Interesting paper: On the Power of Simple Branch Prediction Analysis
  • From: clark
• Re: Usable pen-and-paper ciphers?
  • From: ttw
• Re: can you decrypt?
  • From: Luc The Perverse
• Re: Usable pen-and-paper ciphers?
  • From: Luc The Perverse
• Re: Usable pen-and-paper ciphers?
  • From: David Eather
• Re: Hash libraries
  • From: Tom St Denis
• Hash libraries
  • From: Thaddeus L Olczyk
• Re: Usable pen-and-paper ciphers?
  • From: Markus Jansson
• volunteer auditing/verification
  • From: Tom St Denis
• Re: Usable pen-and-paper ciphers?
  • From: Peter van Liesdonk
• Re: can you decrypt?
  • From: Douglas A. Gwyn
• Re: Usable pen-and-paper ciphers?
  • From: Unruh
• Usable pen-and-paper ciphers?
  • From: Chris De Young
• Re: AES CBC/CFB128 MCT tests
  • From: BRG
• Re: Poly1305 vs. UMAC vs. new MAC1071
  • From: D. J. Bernstein
• Re: ADVERT: C12-GAMMA
  • From: Jean-Luc Cooke
• Re: ADVERT: C12-GAMMA
  • From: Peter Pearson
• AES CBC/CFB128 MCT tests
  • From: surryeverett
• Re: Programs for breaking Classic Ciphers
  • From: secretcodebreaker
• Re: can you decrypt?
  • From: Mike McNally
• Re: ADVERT: C12-GAMMA
  • From: kalimaa
• Re: Interesting paper: On the Power of Simple Branch Prediction Analysis
  • From: mm
• Re: Programs for breaking Classic Ciphers
  • From: Mike McNally
• Re: can you decrypt?
  • From: jon . mann

We are proud to have Web Hosting and Rack Housing from 9 Net Avenue Deutschland.
(18)