sci.crypt

• Thread Index

---

• Re: Get Rich
  • From: Luc The ***e
• Re: Get Rich
  • From: Luc The ***e
• Re: Problem is "pure math"
  • From: googleuser
• Re: Get Rich
  • From: David Taylor
• x.509 issuer subject - no match exploits
  • From: MajorSoul
• Re: timestamp based protocol
  • From: stan
• Re: REPOST: Re: Codebreaking puzzle
  • From: David Taylor
• Re: REPOST: Re: OpenSSL receives FIPS 140-2 certification
  • From: Douglas A. Gwyn
• Re: REPOST: Generic code breaking
  • From: Douglas A. Gwyn
• Re: REPOST: Re: Codebreaking puzzle
  • From: Douglas A. Gwyn
• Re: Get Rich
  • From: David Taylor
• Re: timestamp based protocol
  • From: cicap
• Re: timestamp based protocol
  • From: stan
• timestamp based protocol
  • From: cicap
• Re: Get Rich
  • From: Luc The ***e
• Re: Problem is "pure math"
  • From: Anon E. Maus
• Re: *** surviving my new CANCEL attack***
  • From: Phil Carmody
• Re: *** surviving my new CANCEL attack***
  • From: Francois Grieu
• Problem is "pure math"
  • From: jstevh
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: cryptonom@xxxxxxx
• Re: *** surviving my new CANCEL attack***
  • From: cryptonom@xxxxxxx
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: Luc The ***e
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: cryptonom@xxxxxxx
• Re: REPOST: Osama and the J. Edgar Hoover Memorial Vacuum Cleaner
  • From: christo
• Re: *** surviving my new CANCEL attack***
  • From: Phil Carmody
• Re: *** surviving my new CANCEL attack***
  • From: Grumble
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: Tom St Denis
• Re: Proof doesn't work, examples don't work
  • From: Volker Hetzer
• Re: *** surviving my new CANCEL attack***
  • From: Phil Carmody
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: cryptonom
• Idle curiosity (ieee bitorder)
  • From: BRG
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: samvaknin
• Re: Cache Timing attacks on AES : Replication or further Development?
  • From: rohit
• Re: Enig4
  • From: crypticator
• Re: *** surviving my new CANCEL attack***
  • From: Francois Grieu
• Re: Enig4
  • From: Joseph Ashwood
• Re: *** surviving my new CANCEL attack***
  • From: Luc The ***e
• REPOST: Re: Idle curiosity (ieee bitorder)
  • From: Tom St Denis
• Re: Idle curiosity (ieee bitorder)
  • From: Tom St Denis
• REPOST: Re: Q: How to test new hash algorithm?
  • From: Sebastian Gottschalk
• Re: Q: How to test new hash algorithm?
  • From: Sebastian Gottschalk
• REPOST: Re: *** surviving my new CANCEL attack***
  • From: Luc The ***e
• Re: *** surviving my new CANCEL attack***
  • From: Luc The ***e
• REPOST: Re: *** surviving my new CANCEL attack***
  • From: John Savard
• Re: *** surviving my new CANCEL attack***
  • From: John Savard
• REPOST: Re: Q: How to test new hash algorithm?
  • From: Unruh
• Re: Q: How to test new hash algorithm?
  • From: Unruh
• REPOST: Re: Idle curiosity (ieee bitorder)
  • From: BRG
• Re: Idle curiosity (ieee bitorder)
  • From: BRG
• REPOST: Enig4
  • From: crypticator
• Enig4
  • From: crypticator
• REPOST: Re: Idle curiosity (ieee bitorder)
  • From: Tom St Denis
• Re: Idle curiosity (ieee bitorder)
  • From: Tom St Denis
• REPOST: Re: Idle curiosity (ieee bitorder)
  • From: BRG
• Re: Idle curiosity (ieee bitorder)
  • From: BRG
• REPOST: Re: Q: How to test new hash algorithm?
  • From: Sebastian Gottschalk
• Re: Q: How to test new hash algorithm?
  • From: Sebastian Gottschalk
• REPOST: Re: Q: How to test new hash algorithm?
  • From: Martin Hvidberg
• Re: Q: How to test new hash algorithm?
  • From: Martin Hvidberg
• REPOST: Re: Q: How to test new hash algorithm?
  • From: Martin Hvidberg
• Re: Q: How to test new hash algorithm?
  • From: Martin Hvidberg
• REPOST: Re: Q: How to test new hash algorithm?
  • From: Martin Hvidberg
• Re: Q: How to test new hash algorithm?
  • From: Martin Hvidberg
• REPOST: Re: Cache Timing attacks on AES : Replication or further Development?
  • From: stan
• Re: Cache Timing attacks on AES : Replication or further Development?
  • From: stan
• REPOST: Re: *** surviving my new CANCEL attack***
  • From: JP LR
• Re: *** surviving my new CANCEL attack***
  • From: JP LR
• REPOST: Re: 3-DES
  • From: Joseph Ashwood
• Re: 3-DES
  • From: Joseph Ashwood
• REPOST: Re: X509 question
  • From: MajorSoul@xxxxxxxxx
• Re: X509 question
  • From: MajorSoul@xxxxxxxxx
• REPOST: Re: X509 question
  • From: MajorSoul@xxxxxxxxx
• Re: X509 question
  • From: MajorSoul@xxxxxxxxx
• REPOST: Re: An hash-Encryption algorithm
  • From: Neo
• Re: An hash-Encryption algorithm
  • From: Neo
• 3-DES
  • From: M5vip
• Re: 3-DES
  • From: stan
• REPOST: Re: 3-DES
  • From: Joseph Ashwood
• Re: 3-DES
  • From: Joseph Ashwood
• Re: 3-DES
  • From: stan
• Idle curiosity (ieee bitorder)
  • From: Tom St Denis
• Re: Q: How to test new hash algorithm?
  • From: Carlos Moreno
• REPOST: Re: Q: How to test new hash algorithm?
  • From: Mike Amling
• Re: Q: How to test new hash algorithm?
  • From: Mike Amling
• REPOST: Re: X509 question
  • From: Bryan Olson
• Re: X509 question
  • From: Bryan Olson
• Re: An hash-Encryption algorithm
  • From: Kristian Gjøsteen
• Re: *** surviving my new CANCEL attack***
  • From: Juuso Hukkanen
• Re: An hash-Encryption algorithm
  • From: Neo
• Are Our Political Leaders Really as Mad as We Suspect? Read Here!
  • From: ragnell
• Re: An hash-Encryption algorithm
  • From: Harald Hanche-Olsen
• Re: An hash-Encryption algorithm
  • From: Kristian Gjøsteen
• Re: Q: How to test new hash algorithm?
  • From: Sebastian Gottschalk
• Re: Q: How to test new hash algorithm?
  • From: Sebastian Gottschalk
• Re: Q: How to test new hash algorithm?
  • From: Martin Hvidberg
• Re: Q: How to test new hash algorithm?
  • From: Martin Hvidberg
• Re: 3-DES
  • From: Joseph Ashwood
• Re: X509 question
  • From: MajorSoul@xxxxxxxxx
• 3-DES
  • From: M5vip
• hi
  • From: nk
• Re: X509 question
  • From: Bryan Olson
• Re: How to test new hash algorithm?
  • From: Joseph Ashwood
• Re: X509 question
  • From: Bryan Olson
• Re: X509 question
  • From: MajorSoul@xxxxxxxxx
• Re: An hash-Encryption algorithm
  • From: Neo
• Re: An hash-Encryption algorithm
  • From: Neo
• Re: X509 question
  • From: Thomas ***in
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: cryptonom
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: cryptonom
• Re: Cache Timing attacks on AES : Replication or further Development?
  • From: karl malbrain
• Re: X509 question
  • From: MajorSoul
• Re: X509 question
  • From: MajorSoul
• Re: An hash-Encryption algorithm
  • From: Gregory G Rose
• Re: X509 question
  • From: Bryan Olson
• Re: An hash-Encryption algorithm
  • From: Gregory G Rose
• Re: An hash-Encryption algorithm
  • From: Kristian Gjøsteen
• *** surviving my new CANCEL attack***
  • From: Francois Grieu
• Re: Cache Timing attacks on AES : Replication or further Development?
  • From: Tom St Denis
• Re: X509 question
  • From: MajorSoul
• Re: An hash-Encryption algorithm
  • From: Neo
• Re: Cache Timing attacks on AES : Replication or further Development?
  • From: stan
• Re: X509 question
  • From: Thomas ***in
• Re: Cache Timing attacks on AES : Replication or further Development?
  • From: Tom St Denis
• Re: Cache Timing attacks on AES : Replication or further Development?
  • From: stan
• Re: Decode
  • From: Sebastian Gottschalk
• Re: X509 question
  • From: MajorSoul
• Re: An hash-Encryption algorithm
  • From: Kristian Gjøsteen
• Re: Cache Timing attacks on AES : Replication or further Development?
  • From: Phil Carmody
• Decode
  • From: Enigma
• Proof doesn't work, examples don't work
  • From: jstevh
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: ink
• Re: An hash-Encryption algorithm
  • From: Neo
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: Tom St Denis
• Re: Q: How to test new hash algorithm?
  • From: Kristian Gjøsteen
• Re: Q: How to test new hash algorithm?
  • From: Sebastian Gottschalk
• Q: How to test new hash algorithm?
  • From: Martin Hvidberg
• Re: An hash-Encryption algorithm
  • From: Kristian Gjøsteen
• Re: An hash-Encryption algorithm
  • From: Neo
• Re: An hash-Encryption algorithm
  • From: Sebastian Gottschalk
• An hash-Encryption algorithm
  • From: Neo
• Re: X509 question
  • From: Thomas ***in
• Re: Cache Timing attacks on AES : Replication or further Development?
  • From: BRG
• X509 question
  • From: MajorSoul
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: cryptonom
• Re: Cache Timing attacks on AES : Replication or further Development?
  • From: Tom St Denis
• Re: Cache Timing attacks on AES : Replication or further Development?
  • From: rohit
• Re: Cache Timing attacks on AES : Replication or further Development?
  • From: Tom St Denis
• Re: Need help decipher....
  • From: Paul Rubin
• Cache Timing attacks on AES : Replication or further Development?
  • From: rohit
• Re: Need help decipher....
  • From: Shane
• Osama and the J. Edgar Hoover Memorial Vacuum Cleaner
  • From: ragnell
• Re: Need help decipher....
  • From: Paul Rubin
• Call for Papers: Special Issue on Security Certification
  • From: imecs_2006
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: Tom St Denis
• Re: Need help decipher....
  • From: Shane
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: Sevenhundred Elves
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: cryptonom@xxxxxxx
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: laughing
• Re: miller rabin test
  • From: Unruh
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: Sevenhundred Elves
• Re: miller rabin test
  • From: Mike Amling
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: Tom St Denis
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: Pubkeybreaker
• Re: miller rabin test
  • From: Pubkeybreaker
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: laughing
• Re: miller rabin test
  • From: cicap
• Re: miller rabin test
  • From: Sebastian Gottschalk
• miller rabin test
  • From: cicap
• Re: Hash only (Pepper) data transmission
  • From: Lars Schoening
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: Pubkeybreaker
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: laughing
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: laughing
• Codebreaking puzzle
  • From: Enigma
• Cryptanalysis
  • From: Fawle R
• Re: codebreaking puzzle
  • From: Enigma
• codebreaking puzzle
  • From: Fawle R
• Generic code breaking
  • From: enigma
• Cryptanalysis
  • From: chaoticseth
• Re: DES doubts. why we use 56 bit key when ony 48 bits are used?
  • From: Anon E. Maus
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: Anon E. Maus
• Re: DES doubts. why we use 56 bit key when ony 48 bits are used?
  • From: Luc The ***e
• Re: DES doubts. why we use 56 bit key when ony 48 bits are used?
  • From: Anon E. Maus
• Re: OpenSSL receives FIPS 140-2 certification
  • From: Tom St Denis
• Re: doubts about signature
  • From: David Wagner
• Re: doubts about signature
  • From: cicap
• OpenSSL receives FIPS 140-2 certification
  • From: Paul Rubin
• Re: Need help decipher....
  • From: Peter Pearson
• Re: Need help decipher....
  • From: Phil Carmody
• Re: doubts about signature
  • From: David Wagner
• Re: Need help decipher....
  • From: Stefan Krah
• Hash only (Pepper) data transmission
  • From: Lars Schoening
• Re: Need help decipher....
  • From: Shane
• Re: Public Key Encryption: The Weakest Link
  • From: Luc The ***e
• Re: Public Key Encryption: The Weakest Link
  • From: Gregory G Rose
• doubts about signature
  • From: cicap
• ANNOUNCE: L14 -> L15
  • From: robin_carey5
• Re: Sources to decript wanted
  • From: scottsanz
• Re: Need help decipher....
  • From: Douglas A. Gwyn
• Re: Public Key Encryption: The Weakest Link
  • From: Steven Jones
• Re: Need help decipher....
  • From: Peter Pearson
• Re: the merits of NTRU
  • From: Tom St Denis
• Re: Number of iterations in PKCS#5
  • From: Joseph Ashwood
• Re: Public Key Encryption: The Weakest Link
  • From: Joseph Ashwood
• Re: Public Key Encryption: The Weakest Link
  • From: Kristian Gjøsteen
• Re: Public Key Encryption: The Weakest Link
  • From: Tino Schwarze
• Number of iterations in PKCS#5
  • From: Jostein Tveit
• Public Key Encryption: The Weakest Link
  • From: TwistyCreek
• Sources to decript wanted
  • From: Alex
• Re: *** Surviving this new CANCEL attack ***
  • From: Kristian Gjøsteen
• Re: A factoring algorithm
  • From: Chris Card
• *** Surviving this new CANCEL attack ***
  • From: Francois Grieu
• Re: the merits of NTRU
  • From: Joseph Ashwood
• Proof, demonstration useless, what?
  • From: jstevh
• Re: Need help decipher....
  • From: Shane
• Re: Need help decipher....
  • From: Peter Pearson
• Need help decipher....
  • From: Shane
• Re: More perspective, factoring
  • From: Tom St Denis
• Re: More perspective, factoring
  • From: Gregory G Rose
• Re: Simple Python elliptic curves and ECDSA
  • From: Tom St Denis
• Re: A factoring algorithm
  • From: Tom St Denis
• Virtual Copy of Printed Document
  • From: frequencieme
• Re: More perspective, factoring
  • From: Tim Peters
• Simple Python elliptic curves and ECDSA
  • From: Peter Pearson
• Re: Using Gimp For Key Material
  • From: Douglas A. Gwyn
• Re: none
  • From: Douglas A. Gwyn
• the merits of NTRU
  • From: Juuso Hukkanen
• Re: Encryption used in Oxford English Dictionary
  • From: tjwolf
• Re: More perspective, factoring
  • From: Bruce Stephens
• Re: More perspective, factoring
  • From: jstevh
• Re: More perspective, factoring
  • From: Ben Livengood
• More perspective, factoring
  • From: jstevh
• What will happen
  • From: jstevh
• Re: Encryption used in Oxford English Dictionary
  • From: Tino Schwarze
• Re: [OT] Point of wiping in-memory keys?
  • From: Mike Amling
• Re: explanation of unilateral authentication nonce based protocol
  • From: David Wagner
• explanation of unilateral authentication nonce based protocol
  • From: cicap
• Re: Encryption used in Oxford English Dictionary
  • From: Paul Rubin
• Re: Encryption used in Oxford English Dictionary
  • From: Tino Schwarze
• Re: Using Gimp For Key Material
  • From: Joseph Ashwood
• Re: Using Gimp For Key Material
  • From: TomFoolery
• Re: Using Gimp For Key Material
  • From: Sebastian Gottschalk
• Using Gimp For Key Material
  • From: TomFoolery
• Re: So why lie?
  • From: Sebastian Gottschalk
• So why lie?
  • From: jstevh
• Re: break it - protect confidentiality and integrity with symmetric key
  • From: 000
• Re: break it - protect confidentiality and integrity with symmetric key
  • From: 000
• Re: [OT] Point of wiping in-memory keys?
  • From: Bryan Olson
• Re: implementing sha1
  • From: ness
• Re: implementing sha1
  • From: Tom St Denis
• Re: break it - protect confidentiality and integrity with symmetric key
  • From: Tom St Denis
• Re: implementing sha1
  • From: ness
• Re: implementing sha1
  • From: ness
• Re: implementing sha1
  • From: Will Dickson
• Re: RS-232 random number generator
  • From: Terry Ritter
• break it - protect confidentiality and integrity with symmetric key
  • From: 000
• protect confidentiality and integrity with symmetric key
  • From: 000
• protect confidentiality and integrity with symmetric key
  • From: 000
• implementing sha1
  • From: ness
• Re: Proof of fraud, flawed number theory still taught
  • From: Proginoskes
• Re: [OT] Point of wiping in-memory keys?
  • From: David Wagner
• Re: Proof of fraud, flawed number theory still taught
  • From: Unruh
• Re: Proof of fraud, flawed number theory still taught
  • From: Bruce Stephens
• Re: Comparison
  • From: fatal.serpent
• Re: Proof of fraud, flawed number theory still taught
  • From: David Eather
• Re: How this algorithm of prime factor decomposition works?
  • From: NS
• Re: simple protocol (execrise)
  • From: Kristian Gjøsteen
• Re: [OT] Point of wiping in-memory keys?
  • From: Mike Amling
• Re: simple protocol (execrise)
  • From: NS
• Re: I need some help.
  • From: Abraham Wolk
• Re: Comparison
  • From: Joseph Ashwood
• Comparison
  • From: datacrush
• New attacks on Bluetooth encryption - please clarify
  • From: Markus Jansson
• How this algorithm of prime factor decomposition works?
  • From: rickyzhang
• Re: simple protocol (execrise)
  • From: cicap
• Re: [OT] Point of wiping in-memory keys?
  • From: Sebastian Gottschalk
• Re: [OT] Point of wiping in-memory keys?
  • From: David Wagner
• Re: [OT] Point of wiping in-memory keys?
  • From: Will Dickson
• Re: simple protocol (execrise)
  • From: NS
• Re: [OT] Point of wiping in-memory keys?
  • From: Paul Rubin
• Re: [OT] Point of wiping in-memory keys?
  • From: David Wagner
• Re: [OT] Point of wiping in-memory keys?
  • From: Mike Amling
• Re: Encryption used in Oxford English Dictionary
  • From: tjwolf
• Re: Encryption used in Oxford English Dictionary
  • From: Paul Rubin
• Encryption used in Oxford English Dictionary
  • From: tjwolf
• Re: [OT] Point of wiping in-memory keys?
  • From: David Taylor
• Re: Virus spammers getting bolder...
  • From: Jean-Luc Cooke
• Re: What field to study
  • From: Douglas A. Gwyn
• Re: simple protocol (execrise)
  • From: Kristian Gjøsteen
• Re: [OT] Point of wiping in-memory keys?
  • From: Bryan Olson
• Re: [OT] Point of wiping in-memory keys?
  • From: David Wagner
• simple protocol (execrise)
  • From: cicap
• Re: Files Unreadable (.doc, .url, .mht)
  • From: Sebastian Gottschalk
• Files Unreadable (.doc, .url, .mht)
  • From: ftrye38
• Re: [OT] Point of wiping in-memory keys?
  • From: Sebastian Gottschalk
• Re: Virus spammers getting bolder...
  • From: Luc The ***e
• Re: OT: Virus spammers getting bolder...
  • From: Paul Rubin
• OT: Virus spammers getting bolder...
  • From: John Savard
• Re: [OT] Point of wiping in-memory keys?
  • From: David Wagner
• Re: [OT] Point of wiping in-memory keys?
  • From: Luc The ***e
• Re: [OT] Point of wiping in-memory keys?
  • From: David Wagner
• What field to study
  • From: wschlanger
• Re: [OT] Point of wiping in-memory keys?
  • From: Sebastian Gottschalk
• Re: [OT] Point of wiping in-memory keys?
  • From: Colin Percival
• Re: [OT] Point of wiping in-memory keys?
  • From: Joseph Ashwood
• Re: Chosen attacks
  • From: Francois Grieu
• Re: [OT] Point of wiping in-memory keys?
  • From: Paul Rubin
• Re: Chosen attacks
  • From: Unruh
• Re: [OT] Point of wiping in-memory keys?
  • From: Mike Amling
• Re: Chosen attacks
  • From: Douglas A. Gwyn
• Re: easy stealth encryption?
  • From: Douglas A. Gwyn
• Re: Chosen attacks
  • From: Luc The ***e
• Re: DES doubts. why we use 56 bit key when ony 48 bits are used?
  • From: Luc The ***e
• Re: Chosen attacks
  • From: Unruh
• Re: [OT] Point of wiping in-memory keys?
  • From: nemo_outis
• Re: [OT] Point of wiping in-memory keys?
  • From: Jean-Luc Cooke
• Re: [OT] Point of wiping in-memory keys?
  • From: Paul Rubin
• [OT] Point of wiping in-memory keys?
  • From: Will Dickson
• Re: Chosen attacks
  • From: Gordon Burditt
• Re: Chosen attacks
  • From: Mike Nelson
• Re: Chosen attacks
  • From: Mike Amling
• Re: DES doubts. why we use 56 bit key when ony 48 bits are used?
  • From: Tom St Denis
• Re: DES doubts. why we use 56 bit key when ony 48 bits are used?
  • From: Jean-Luc Cooke
• Re: Chosen attacks
  • From: Francois Grieu
• Re: DES doubts. why we use 56 bit key when ony 48 bits are used?
  • From: fermisoft
• Re: Chosen attacks
  • From: Unruh
• Chosen attacks
  • From: fermisoft
• Re: some question about RSA
  • From: Tom St Denis
• Re: some question about RSA
  • From: Wang
• Re: some question about RSA
  • From: Wang
• Pre-call for submissions for IEEE Std 1363-2000 revision
  • From: William Whyte
• Re: FlexiProvider: an open source cryptography provider for the JCA/JCE
  • From: daniel bleichenbacher
• Re: FlexiProvider: an open source cryptography provider for the JCA/JCE
  • From: daniel bleichenbacher
• Re: RSA key length and more
  • From: Unruh
• Re: FlexiProvider: an open source cryptography provider for the JCA/JCE
  • From: Paul Rubin
• Re: FlexiProvider: an open source cryptography provider for the JCA/JCE
  • From: Mike Amling
• Re: US nu-cu-lear bases.. access is kids stuff :-)
  • From: Mxsmanic
• Re: RSA key length and more
  • From: Paul Leyland
• Open positions at Concordia University, Canada
  • From: youssef
• Tenure-track faculty positions
  • From: youssef
• Re: A New Encryption Algorithm
  • From: Bill Unruh
• Re: Computing big numbers
  • From: Jean-Luc Cooke
• Re: US nu-cu-lear bases.. access is kids stuff :-)
  • From: Jan Panteltje
• Re: US nu-cu-lear bases.. access is kids stuff :-)
  • From: Jan Panteltje
• Re: some question about RSA
  • From: Tom St Denis
• Re: US nu-cu-lear bases.. access is kids stuff :-)
  • From: David Eather
• Re: US nu-cu-lear bases.. access is kids stuff :-)
  • From: Mxsmanic
• Re: US nu-cu-lear bases.. access is kids stuff :-)
  • From: Mxsmanic
• Re: some question about RSA
  • From: Wang
• Re: A New Encryption Algorithm
  • From: John Savard
• Re: multi-key encryption algorithm is meaningful?
  • From: Phil Carmody
• Re: Electronic Codebook
  • From: s_4
• Re: Electronic Codebook
  • From: s_4
• Re: Electronic Codebook
  • From: Paul Rubin
• Re: Electronic Codebook
  • From: Andrew Swallow
• Re: Electronic Codebook
  • From: Unruh
• Re: Electronic Codebook
  • From: Mike Scott
• Re: Electronic Codebook
  • From: Andrew Swallow
• Re: Electronic Codebook
  • From: Kristian Gjøsteen
• Re: Electronic Codebook
  • From: Douglas A. Gwyn
• Re: Electronic Codebook
  • From: s_4
• Re: Electronic Codebook
  • From: Paul Rubin
• Electronic Codebook
  • From: s_4
• Re: US nu-cu-lear bases.. access is kids stuff :-)
  • From: Mack
• Re: RS-232 random number generator
  • From: Mack
• AES4_UICE_slides.pdf
  • From: Jean Easter
• Re: some question about RSA
  • From: Tom St Denis
• Re: RSA key length and more
  • From: sillybanter
• Re: multi-key encryption algorithm is meaningful?
  • From: Mxsmanic
• Re: multi-key encryption algorithm is meaningful?
  • From: Bob
• FlexiProvider: an open source cryptography provider for the JCA/JCE
  • From: Martin Döring
• Re: some question about RSA
  • From: Joseph Ashwood
• Re: multi-key encryption algorithm is meaningful?
  • From: chaeso
• Re: RSA key length and more
  • From: Unruh
• Re: RSA key length and more
  • From: Pubkeybreaker
• Re: RSA key length and more
  • From: Paul Leyland
• Re: multi-key encryption algorithm is meaningful?
  • From: Bryan Olson
• Re: US nu-cu-lear bases.. access is kids stuff :-)
  • From: Jan Panteltje
• Re: US nu-cu-lear bases.. access is kids stuff :-)
  • From: Andrew Swallow
• Re: US nu-cu-lear bases.. access is kids stuff :-)
  • From: Jan Panteltje
• Re: US nu-cu-lear bases.. access is kids stuff :-)
  • From: Mxsmanic
• Re: multi-key encryption algorithm is meaningful?
  • From: Mxsmanic
• US nu-cu-lear bases.. access is kids stuff :-)
  • From: Jan Panteltje
• Re: multi-key encryption algorithm is meaningful?
  • From: chaeso
• Re: multi-key encryption algorithm is meaningful?
  • From: chaeso
• Re: multi-key encryption algorithm is meaningful?
  • From: Phil Carmody
• Re: multi-key encryption algorithm is meaningful?
  • From: chaeso
• Re: multi-key encryption algorithm is meaningful?
  • From: Mxsmanic
• Re: multi-key encryption algorithm is meaningful?
  • From: Pubkeybreaker
• multi-key encryption algorithm is meaningful?
  • From: chaeso
• Re: A New Encryption Algorithm
  • From: Unruh
• Re: A New Encryption Algorithm
  • From: John Savard
• Re: [NEWBIE]vigenere
  • From: Kristian Gjøsteen
• Re: Computing big numbers
  • From: Gabriel Lear
• Re: Computing big numbers
  • From: Gabriel Lear
• Re: Computing big numbers
  • From: Erik Naggum
• Re: A New Encryption Algorithm
  • From: Unruh
• Re: A New Encryption Algorithm
  • From: John Savard
• Re: [NEWBIE]vigenere
  • From: Sebastian Gottschalk
• Re: Why should the primes p and q be safe primes?
  • From: Colin Percival
• Re: Computing big numbers
  • From: Gabriel Lear
• Re: Computing big numbers
  • From: Gabriel Lear
• Re: Computing big numbers
  • From: stan
• OEF for DH?
  • From: Tom St Denis
• Re: Computing big numbers
  • From: Tom St Denis
• Re: Computing big numbers
  • From: Gabriel Lear
• Re: Computing big numbers
  • From: Tom St Denis
• Re: Computing big numbers
  • From: Gabriel Lear
• Re: Computing big numbers
  • From: Paul Rubin
• Re: Computing big numbers
  • From: Gabriel Lear
• Re: Computing big numbers
  • From: Gabriel Lear
• Re: Computing big numbers
  • From: Paul Rubin
• Re: [NEWBIE]vigenere
  • From: Kristian Gjøsteen
• Re: Is it a hard problem?
  • From: Pubkeybreaker
• Re: Computing big numbers
  • From: Gabriel Lear
• Re: Computing big numbers
  • From: stan
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: Tom St Denis
• Re: Why should the primes p and q be safe primes?
  • From: Tom St Denis
• Re: rosary-based low-tech crypto?
  • From: David Eather
• Re: Is it a hard problem?
  • From: Bryan Olson
• Why should the primes p and q be safe primes?
  • From: bobic
• Re: Is it a hard problem?
  • From: fbloveu
• Re: Is it a hard problem?
  • From: fbloveu
• Re: Questoin about the security of Discrete Log Problem
  • From: fbloveu
• Re: RSA key length and more
  • From: Paul Rubin
• Re: [NEWBIE]vigenere
  • From: Sebastian Gottschalk
• RSA key length and more
  • From: Pesso
• Re: Computing big numbers
  • From: Erik Naggum
• Re: Computing big numbers
  • From: stan
• Re: Computing big numbers
  • From: Erik Naggum
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: laughing
• Re: Call for Papers: SAM'06 (part of WORLDCOMP'06)
  • From: Colin Percival
• Re: Computing big numbers
  • From: stan
• Re: some question about RSA
  • From: Wang
• Re: [NEWBIE]vigenere
  • From: Mike Amling
• Re: Computing big numbers
  • From: Tom St Denis
• Re: Computing big numbers
  • From: Gabriel Lear
• Re: Computing big numbers
  • From: Eduardo Ruiz
• Re: Computing big numbers
  • From: Eduardo Ruiz
• Re: some question about RSA
  • From: Tom St Denis
• some question about RSA
  • From: Wang
• Re: rosary-based low-tech crypto?
  • From: johnicholas . hines
• Re: Is it a hard problem?
  • From: Bryan Olson
• Re: A New Encryption Algorithm
  • From: Tom St Denis
• Re: [NEWBIE]vigenere
  • From: Sebastian Gottschalk
• Re: Computing big numbers
  • From: Tom St Denis
• Re: A New Encryption Algorithm
  • From: Luc The ***e
• Re: Is it a hard problem?
  • From: Paul Rubin
• Re: A New Encryption Algorithm
  • From: Unruh
• Re: Questoin about the security of Discrete Log Problem
  • From: Unruh
• Re: A New Encryption Algorithm
  • From: fbloveu
• Re: Is it a hard problem?
  • From: fbloveu
• Re: Computing big numbers
  • From: Douglas A. Gwyn
• Re: Computing big numbers
  • From: David Wagner
• Re: Questoin about the security of Discrete Log Problem
  • From: fbloveu
• Re: Computing big numbers
  • From: Tom St Denis
• Re: [NEWBIE]vigenere
  • From: Kristian Gjøsteen
• Re: Call for Papers: SAM'06 (part of WORLDCOMP'06)
  • From: Pubkeybreaker
• Re: Computing big numbers
  • From: Pubkeybreaker
• A New Encryption Algorithm
  • From: healyd
• Re: Computing big numbers
  • From: Tom St Denis
• Re: [NEWBIE]vigenere
  • From: Mike Amling
• Re: Computing big numbers
  • From: Douglas A. Gwyn
• Re: Call for Papers: SAM'06 (part of WORLDCOMP'06)
  • From: Douglas A. Gwyn
• Re: [NEWBIE]vigenere
  • From: Douglas A. Gwyn
• Re: Computing big numbers
  • From: Pubkeybreaker
• Re: Computing big numbers
  • From: Tom St Denis
• Re: Computing big numbers
  • From: Tom St Denis
• Re: Computing big numbers
  • From: stan
• Re: Computing big numbers
  • From: stan
• Re: Questoin about the security of Discrete Log Problem
  • From: Unruh
• Re: Call for Papers: SAM'06 (part of WORLDCOMP'06)
  • From: Tom St Denis
• Re: Is it a hard problem?
  • From: Peter Pearson
• Re: [NEWBIE]vigenere
  • From: Sebastian Gottschalk
• [NEWBIE]vigenere
  • From: cicap
• Re: HMAC vs Salt
  • From: Shai Halevi
• Re: Is it a hard problem?
  • From: Tom St Denis
• Is it a hard problem?
  • From: fbloveu
• Questoin about the security of Discrete Log Problem
  • From: fbloveu
• Re: A factoring algorithm
  • From: Chris Card
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: Ichinin
• Re: Computing big numbers
  • From: David Eather
• Re: Computing big numbers
  • From: Tom St Denis
• Re: Computing big numbers
  • From: Mike Amling
• Re: Computing big numbers
  • From: Tom St Denis
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: kurt wismer
• Re: DNA used as cipher
  • From: Bob
• Re: Computing big numbers
  • From: Paul Rubin
• Re: project - signing (and verifying) a message (text) using DSA(Visual Basic.NET implementation, or VB)
  • From: David Eather
• Re: Computing big numbers
  • From: cryptonom@xxxxxxx
• Re: msieve is FAST!!
  • From: Paul Leyland
• Re: Computing big numbers
  • From: Douglas A. Gwyn
• RSA Security Group - Feel Free to Join -
  • From: Information Security
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: Mike Amling
• Re: Computing big numbers
  • From: Erik Naggum
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: Tom St Denis
• Re: Computing big numbers
  • From: Tom St Denis
• Re: Computing big numbers
  • From: stan
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: Ichinin
• Re: HMAC vs Salt
  • From: Hieu
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: Berryo
• Re: efficiency question about modular exponention operation
  • From: laicko
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: Tom St Denis
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: The Flavored Coffee Guy
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: Bryan Olson
• Re: efficiency question about modular exponention operation
  • From: Tom St Denis
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: Tom St Denis
• Re: Computing big numbers
  • From: Tom St Denis
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: elgersmad
• Re: project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: Joseph Ashwood
• Re: Computing big numbers
  • From: cryptonom
• Re: Computing big numbers
  • From: ink
• project - signing (and verifying) a message (text) using DSA (Visual Basic.NET implementation, or VB)
  • From: Kasparov
• Re: Computing big numbers
  • From: cryptonom@xxxxxxx
• Re: Computing big numbers
  • From: Gabriel Lear
• Re: Computing big numbers
  • From: Tom St Denis
• Re: Computing big numbers
  • From: cryptonom@xxxxxxx
• Re: efficiency question about modular exponention operation
  • From: laicko
• Re: DNA used as cipher
  • From: christo
• Re: HMAC vs Salt
  • From: Mike Amling
• Re: Computing big numbers
  • From: cryptonom
• Re: Computing big numbers
  • From: BRG
• Re: Computing big numbers
  • From: cryptonom
• Re: Computing big numbers
  • From: Tom St Denis
• Re: Computing big numbers
  • From: cryptonom
• Re: Computing big numbers
  • From: Tom St Denis
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: cryptonom
• Re: Computing big numbers
  • From: Tom St Denis
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: cryptonom
• Re: Computing big numbers
  • From: cryptonom
• Re: Computing big numbers
  • From: cryptonom
• Re: Computing big numbers
  • From: Douglas A. Gwyn
• Re: Computing big numbers
  • From: stan
• Re: Computing big numbers
  • From: Douglas A. Gwyn
• Re: Computing big numbers
  • From: Juuso Hukkanen
• Re: Computing big numbers
  • From: daniel bleichenbacher
• Re: efficiency question about modular exponention operation
  • From: David Wagner
• Re: Computing big numbers
  • From: ink
• Re: Computing big numbers
  • From: BRG
• Re: HMAC vs Salt
  • From: Joseph Ashwood
• Re: rosary-based low-tech crypto?
  • From: David Eather
• Re: Computing big numbers
  • From: BRG
• Re: DNA used as cipher
  • From: A. Caspis
• Re: Computing big numbers
  • From: stan
• Re: blind signature is not blind enough?
  • From: Bryan Olson
• Re: Computing big numbers
  • From: stan
• Re: efficiency question about modular exponention operation
  • From: laicko
• Re: DNA used as cipher
  • From: Doug
• Re: A factoring algorithm
  • From: wbhart
• Re: msieve is FAST!!
  • From: wbhart
• Re: How to represent a message as a point M in ECC with Miracl
  • From: Berlid
• Re: HMAC vs Salt
  • From: Hieu
• Re: HMAC vs Salt
  • From: Tom St Denis
• Re: rosary-based low-tech crypto?
  • From: wbhart
• HMAC vs Salt
  • From: Hieu
• Re: Computing big numbers
  • From: Tom St Denis
• Re: DNA used as cipher
  • From: Douglas A. Gwyn
• Re: Computing big numbers
  • From: David Wagner
• Re: DNA used as cipher
  • From: wbhart
• Re: Computing big numbers
  • From: BRG
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: Gabriel Lear
• DNA used as cipher
  • From: christo
• Re: blind signature is not blind enough?
  • From: Mike Amling
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: Bill Unruh
• Re: msieve is FAST!!
  • From: Pubkeybreaker
• Re: rosary-based low-tech crypto?
  • From: Douglas A. Gwyn
• Re: rsa key generation question
  • From: Mike Amling
• Re: Computing big numbers
  • From: Pubkeybreaker
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: Mike Amling
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: Gregory G Rose
• Re: Computing big numbers
  • From: Paul Rubin
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: Mike Amling
• Re: Computing big numbers
  • From: Tom St Denis
• Re: blind signature is not blind enough?
  • From: Jeff
• Re: Computing big numbers
  • From: Tom St Denis
• Re: msieve is FAST!!
  • From: wbhart
• Re: Computing big numbers
  • From: Pubkeybreaker
• Re: Computing big numbers
  • From: Pubkeybreaker
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: Terry Ritter
• Re: Computing big numbers
  • From: stan
• Re: msieve is FAST!!
  • From: Chris Card
• Re: Computing big numbers
  • From: Tom St Denis
• Re: msieve is FAST!!
  • From: wbhart
• Re: EU decides to keep all connectio ndata for 6 month to 2 years, how to circumvent / elude ?
  • From: Richard Herring
• Re: efficiency question about modular exponention operation
  • From: David Wagner
• Re: Computing big numbers
  • From: Pubkeybreaker
• Re: Help needed with encryption algorithm
  • From: Nemok
• Re: efficiency question about modular exponention operation
  • From: Mike Scott
• Re: efficiency question about modular exponention operation
  • From: Tom St Denis
• efficiency question about modular exponention operation
  • From: laicko
• Re: EU decides to keep all connectio ndata for 6 month to 2 years, how to circumvent / elude ?
  • From: Jan Panteltje
• Re: Computing big numbers
  • From: Tom St Denis
• Re: Computing big numbers
  • From: Pubkeybreaker
• Re: EU decides to keep all connectio ndata for 6 month to 2 years, how to circumvent / elude ?
  • From: Mxsmanic
• Re: How to represent a message as a point M in ECC with Miracl
  • From: Tom St Denis
• Re: Computing big numbers
  • From: Tom St Denis
• Re: A factoring algorithm
  • From: Pubkeybreaker
• Re: rsa key generation question
  • From: kaskati2003
• Re: EU decides to keep all connectio ndata for 6 month to 2 years, how to circumvent / elude ?
  • From: Paul Rubin
• Re: EU decides to keep all connectio ndata for 6 month to 2 years, how to circumvent / elude ?
  • From: Richard Herring
• Re: EU decides to keep all connectio ndata for 6 month to 2 years, how to circumvent / elude ?
  • From: Richard Herring
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: Phil Carmody
• Re: msieve is FAST!!
  • From: Chris Card
• Re: A factoring algorithm
  • From: Chris Card
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: Colin Percival
• How to represent a message as a point M in ECC with Miracl
  • From: jean_lee1998id
• Re: Computing big numbers
  • From: stan
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: Paul Rubin
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: David Eather
• Re: EU decides to keep all connectio ndata for 6 month to 2 years, how to circumvent / elude ?
  • From: Mxsmanic
• RSA encrypt/decrypt in C++ (with OpenSSL)
  • From: Carlos Moreno
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: Tom St Denis
• Re: Computing big numbers
  • From: Tom St Denis
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: cryptonom@xxxxxxx
• Re: Computing big numbers
  • From: cryptonom@xxxxxxx
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: Tom St Denis
• Re: Computing big numbers
  • From: Tom St Denis
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: cryptonom@xxxxxxx
• Re: Computing big numbers
  • From: cryptonom@xxxxxxx
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: Tom St Denis
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: cryptonom@xxxxxxx
• Re: Computing big numbers
  • From: Tom St Denis
• Re: Computing big numbers
  • From: cryptonom@xxxxxxx
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: cryptonom@xxxxxxx
• Re: Help needed with encryption algorithm
  • From: David Wagner
• Re: Help needed with encryption algorithm
  • From: Gregory G Rose
• Re: Computing big numbers
  • From: Michael Harrington
• Re: rosary-based low-tech crypto?
  • From: wbhart
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: stan
• Re: msieve is FAST!!
  • From: wbhart
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: Tom St Denis
• Re: Computing big numbers
  • From: Tom St Denis
• Re: Computing big numbers
  • From: Tom St Denis
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: Mike Amling
• Re: msieve is FAST!!
  • From: Phil Carmody
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: cryptonom@xxxxxxx
• msieve is FAST!!
  • From: wbhart
• Re: porting GnuPG to PPC {Re: Computing big numbers}
  • From: Paul Rubin
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: Paul Rubin
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: cryptonom@xxxxxxx
• porting GnuPG to PPC {Re: Computing big numbers}
  • From: cryptonom@xxxxxxx
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: John E. Hadstate
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: Paul Rubin
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: cryptonom@xxxxxxx
• Re: A factoring algorithm
  • From: Paul Rubin
• Re: Computing big numbers
  • From: Paul Rubin
• Re: Computing big numbers
  • From: stan
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: Mike Amling
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: cryptonom@xxxxxxx
• Re: Computing big numbers
  • From: cryptonom@xxxxxxx
• Re: A factoring algorithm
  • From: wbhart
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: Mike Amling
• Re: Computing big numbers
  • From: cryptonom@xxxxxxx
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: Tom St Denis
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: cryptonom@xxxxxxx
• Re: A factoring algorithm
  • From: David Wagner
• Re: Computing big numbers
  • From: Tom St Denis
• Re: A factoring algorithm
  • From: David Wagner
• Re: Computing big numbers
  • From: Tom St Denis
• Re: A factoring algorithm
  • From: wbhart
• Re: Computing big numbers
  • From: Paul Rubin
• Re: A factoring algorithm
  • From: Phil Carmody
• Re: A factoring algorithm
  • From: wbhart
• Re: Computing big numbers
  • From: stan
• Re: A factoring algorithm
  • From: wbhart
• Re: A factoring algorithm
  • From: Phil Carmody
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: stan
• Re: How to construct one-way permutation from one-way function?
  • From: Mike Amling
• Re: A factoring algorithm
  • From: Mike Amling
• Re: rosary-based low-tech crypto?
  • From: Mike Amling
• Re: Can you crack this
  • From: Mike Amling
• Re: A factoring algorithm
  • From: wbhart
• Re: self-appointed expert? {Re: RS-232 random number generator}
  • From: Kristian Gjøsteen
• Re: A factoring algorithm
  • From: wbhart
• Re: A factoring algorithm
  • From: Pubkeybreaker
• Re: A factoring algorithm
  • From: David Wagner
• Re: A factoring algorithm
  • From: Phil Carmody
• self-appointed expert? {Re: RS-232 random number generator}
  • From: cryptonom
• Re: Computing big numbers
  • From: cryptonom
• Re: A factoring algorithm
  • From: David Wagner
• Re: A factoring algorithm
  • From: David Wagner
• Re: EU decides to keep all connectio ndata for 6 month to 2 years, how to circumvent / elude ?
  • From: Jan Panteltje
• Re: A factoring algorithm
  • From: Phil Carmody
• Re: EU decides to keep all connectio ndata for 6 month to 2 years, how to circumvent / elude ?
  • From: Mxsmanic
• Re: A factoring algorithm
  • From: Phil Carmody
• Re: EU decides to keep all connectio ndata for 6 month to 2 years, how to circumvent / elude ?
  • From: Richard Herring
• Re: How to construct one-way permutation from one-way function?
  • From: Peter Pearson
• Re: Computing big numbers
  • From: Juuso Hukkanen
• Re: Computing big numbers
  • From: Tom St Denis
• How to construct one-way permutation from one-way function?
  • From: dan
• Re: A factoring algorithm
  • From: Pubkeybreaker
• Re: RS-232 random number generator
  • From: David Eather
• Re: Computing big numbers
  • From: Pubkeybreaker
• Re: A factoring algorithm
  • From: Chris Card
• Re: A factoring algorithm
  • From: Juuso Hukkanen
• Re: A factoring algorithm
  • From: Juuso Hukkanen
• Re: A factoring algorithm
  • From: Bryan Olson
• Re: Help needed with encryption algorithm
  • From: Joseph Ashwood
• Re: Computing big numbers
  • From: Michael Harrington
• Re: Computing big numbers
  • From: ink
• Re: A factoring algorithm
  • From: hart_wb
• Re: Can you crack this
  • From: teslacoils2006
• Re: A factoring algorithm
  • From: hart_wb
• Re: Recommentations for research topic and mentor
  • From: David A Molnar
• Re: Recommentations for research topic and mentor
  • From: MrFix3
• Re: A factoring algorithm
  • From: hart_wb
• Re: RS-232 random number generator
  • From: Terry Ritter
• Re: A factoring algorithm
  • From: wbhart
• Computing big numbers
  • From: toorandom@xxxxxxxxx
• Re: A factoring algorithm
  • From: wbhart
• Re: Help needed with encryption algorithm
  • From: Luc The ***e
• Re: A factoring algorithm
  • From: JP LR
• Re: Help needed with encryption algorithm
  • From: Unruh
• Re: Non-computer randomization
  • From: snaga
• Re: A factoring algorithm
  • From: hart_wb
• rosary-based low-tech crypto?
  • From: johnicholas . hines
• Re: Help needed with encryption algorithm
  • From: Luc The ***e
• Re: A factoring algorithm
  • From: hart_wb
• Re: A factoring algorithm
  • From: hart_wb
• Re: A factoring algorithm
  • From: hart_wb
• Re: A factoring algorithm
  • From: hart_wb
• Re: Recommentations for research topic and mentor
  • From: David A Molnar
• Re: Help needed with encryption algorithm
  • From: Tuna Fish
• Re: A factoring algorithm
  • From: Joseph Ashwood
• Re: A factoring algorithm
  • From: Phil Carmody
• Re: A factoring algorithm
  • From: Mike Amling
• Re: A factoring algorithm
  • From: Mike Amling
• Re: A factoring algorithm
  • From: Bryan Olson
• Re: Recommentations for research topic and mentor
  • From: Carlos Moreno
• Re: A factoring algorithm
  • From: Phil Carmody
• Re: Double-applied symmetric algorithm
  • From: Tino Schwarze
• Re: Help needed with encryption algorithm
  • From: Nemok
• Re: A factoring algorithm
  • From: Juuso Hukkanen
• Re: Recommentations for research topic and mentor
  • From: David A Molnar
• Re: Help needed with encryption algorithm
  • From: Joseph Ashwood
• Re: Help needed with encryption algorithm
  • From: Paul Rubin
• A factoring algorithm
  • From: hart_wb
• Re: SIGS How to get the sieving polynoms
  • From: hart_wb
• Re: Help needed with encryption algorithm
  • From: Paul Rubin
• Re: Double-applied symmetric algorithm
  • From: David Wagner
• Recommentations for research topic and mentor
  • From: truevalue
• Re: Double-applied symmetric algorithm
  • From: Douglas A. Gwyn
• Re: SHA Question
  • From: Luc The ***e
• Re: Double-applied symmetric algorithm
  • From: David Wagner
• Re: Help needed with encryption algorithm
  • From: David Wagner
• Re: Help needed with encryption algorithm
  • From: Andrew Swallow
• Double-applied symmetric algorithm
  • From: David F
• Re: Help needed with encryption algorithm
  • From: Tom St Denis
• Re: Help needed with encryption algorithm
  • From: Nemok
• Re: Help needed with encryption algorithm
  • From: Douglas A. Gwyn
• Re: Help needed with encryption algorithm
  • From: Unruh
• Re: Help needed with encryption algorithm
  • From: Mike Amling
• Re: Help needed with encryption algorithm
  • From: Tom St Denis
• Re: Help needed with encryption algorithm
  • From: Jameson King
• Re: Help needed with encryption algorithm
  • From: Nemok
• Re: Help needed with encryption algorithm
  • From: Sebastian Gottschalk
• Help needed with encryption algorithm
  • From: Nemok
• Re: project - signing (and verifying) a message using XTR algorithm (java implementation)
  • From: Kristian Gjøsteen
• Re: project - signing (and verifying) a message using XTR algorithm (java implementation)
  • From: Tomasz Leskier
• Biotechnology********Intellectual Property Rights
  • From: contactme4u
• Re: OT: Why include this in your reply?
  • From: stan
• Re: SHA Question
  • From: Neo
• Re: RS-232 random number generator
  • From: Unruh
• Re: project - signing (and verifying) a message using XTR algorithm (java implementation)
  • From: Tom St Denis
• Re: RS-232 random number generator
  • From: David Eather
• Re: RS-232 random number generator
  • From: Jan Panteltje
• Re: project - signing (and verifying) a message using XTR algorithm (java implementation)
  • From: Tomasz Leskier
• Re: OEF curve
  • From: Kristian Gjøsteen
• Re: project - signing (and verifying) a message using XTR algorithm (java implementation)
  • From: Tom St Denis
• Re: RS-232 random number generator
  • From: Will Dickson
• Re: RS-232 random number generator
  • From: Mike Amling
• Re: RS-232 random number generator
  • From: Luc The ***e
• Re: OEF curve
  • From: Darrel Hankerson
• Re: RS-232 random number generator
  • From: David Eather
• Re: RS-232 random number generator
  • From: Jan Panteltje
• Re: RS-232 random number generator
  • From: David Eather
• Re: RS-232 random number generator
  • From: David Eather
• Java iButton discontinued
  • From: Paul Rubin
• Re: OEF curve
  • From: WiteG
• Re: project - signing (and verifying) a message using XTR algorithm (java implementation)
  • From: WiteG
• project - signing (and verifying) a message using XTR algorithm (java implementation)
  • From: Tomasz Leskier
• Re: RS-232 random number generator
  • From: Vernon Schryver
• Re: RS-232 random number generator
  • From: Jan Panteltje
• Re: RS-232 random number generator
  • From: David Eather
• Re: RS-232 random number generator
  • From: Jan Panteltje
• Re: RS-232 random number generator
  • From: David Eather
• Re: RS-232 random number generator
  • From: Mike Amling
• Re: Non-computer randomization
  • From: Paul Rubin
• Re: Non-computer randomization
  • From: Doug
• Re: RS-232 random number generator
  • From: Paul Rubin
• Re: RS-232 random number generator
  • From: David Eather
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Douglas A. Gwyn
• Re: Non-computer randomization
  • From: Mike Amling
• Re: Non-computer randomization
  • From: David Wagner
• Re: Non-computer randomization
  • From: Paul Rubin
• Re: Non-computer randomization
  • From: snaga
• Re: RS-232 random number generator
  • From: Paul Rubin
• RS-232 random number generator
  • From: David Eather
• Re: DES doubts. why we use 56 bit key when ony 48 bits are used?
  • From: vedaal
• Re: Non-computer randomization
  • From: Doug
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Doug
• enigmail, evolution with signature and encryption
  • From: Peter Schwabe
• Re: Can you crack this
  • From: John E. Hadstate
• PKI question, trusting subordinate CA
  • From: hagaiy
• Re: Can you crack this
  • From: Luc The ***e
• Re: Can you crack this
  • From: Siddharam Shingshetty
• Re: sending hidden messages
  • From: Twittering One
• Re: Typo in "Guide to Elliptic Curve Cryptography"
  • From: Tom St Denis
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Peter Fairbrother
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Unruh
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Phil Carmody
• Re: OT: Why include this in your reply?
  • From: Phil Carmody
• Re: Basic tools of encryption: Transposition and substitution?
  • From: David Wagner
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Peter Fairbrother
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Peter Fairbrother
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Doug
• Re: On IVs
  • From: Ivan Voras
• how to manage certificate store
  • From: jay25dec@xxxxxxxxx
• Re: Typo in "Guide to Elliptic Curve Cryptography"
  • From: Tom St Denis
• Re: OT: Why include this in your reply?
  • From: Gabriel Lear
• Typo in "Guide to Elliptic Curve Cryptography"
  • From: Tom St Denis
• Typo in "Guide to Elliptic Curve Cryptography"
  • From: Tom St Denis
• Re: On IVs
  • From: Tom St Denis
• Re: On IVs
  • From: Ivan Voras
• Re: On IVs
  • From: Ivan Voras
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Peter Fairbrother
• Re: DES doubts. why we use 56 bit key when ony 48 bits are used?
  • From: Francois Grieu
• Re: OT: Why include this in your reply?
  • From: stan
• Re: DES doubts. why we use 56 bit key when ony 48 bits are used?
  • From: David Eather
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Doug
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Doug
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Doug
• Re: OEF curve
  • From: Kristian Gjøsteen
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Peter Fairbrother
• Re: AES operation order
  • From: Kristian Gjøsteen
• Re: DES doubts. why we use 56 bit key when ony 48 bits are used?
  • From: Joseph Ashwood
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Joseph Ashwood
• Re: DES doubts. why we use 56 bit key when ony 48 bits are used?
  • From: Francois Grieu
• Re: Non-computer randomization
  • From: snaga
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Doug
• Re: OT: Why include this in your reply?
  • From: cryptonom
• Re: DES doubts. why we use 56 bit key when ony 48 bits are used?
  • From: David Eather
• Re: On IVs
  • From: David Wagner
• Re: OT: Why include this in your reply?
  • From: Gabriel Lear
• Re: OT: Why include this in your reply?
  • From: Tom St Denis
• Re: OT: Why include this in your reply?
  • From: Gabriel Lear
• Re: SHA Question
  • From: Tom St Denis
• Re: OT: Why include this in your reply?
  • From: Tom St Denis
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Peter Fairbrother
• Re: On IVs
  • From: Tom St Denis
• Re: OT: Why include this in your reply?
  • From: Gabriel Lear
• On IVs
  • From: Ivan Voras
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Doug
• Re: OT: Why include this in your reply?
  • From: Phil Carmody
• Re: OT: Why include this in your reply?
  • From: Gabriel Lear
• Re: Non-computer randomization
  • From: Unruh
• Re: OT: Why include this in your reply?
  • From: stan
• Re: Non-computer randomization
  • From: snaga
• Re: sending hidden messages
  • From: Peter Fairbrother
• sending hidden messages
  • From: hassan.jameel@xxxxxxxxx
• Re: DES doubts. why we use 56 bit key when ony 48 bits are used?
  • From: vedaal
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Peter Fairbrother
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Doug
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Doug
• Re: Non-computer randomization
  • From: Paul Rubin
• Non-computer randomization
  • From: snaga
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Paul Rubin
• Re: SHA Question
  • From: Ichinin
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Joseph Ashwood
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Doug
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Paul Rubin
• Re: Basic tools of encryption: Transposition and substitution?
  • From: Doug
• Re: Why include this in your reply?
  • From: Gabriel Lear
• Re: Password length and bit number of encryption algorithm?
  • From: Joseph Ashwood
• Re: Why include this in your reply?
  • From: Joseph Ashwood

• Security
• UNIX
• Linux
• Coding
• Usenet

• News
• Mailing-Lists
• Newsgroups
• Service
• About
• Privacy
• Search
• Imprint

www.derkeiler.com  > Newsgroups  > sci.crypt  > 2006-01