Bill Frantz writes, in part:
-+--
| In the San Francisco Bay Area, they are using the transponder codes
| to measure how fast traffic is moving from place to place. They
| post the times to various destinations on the electric signs when
| there are no Amber alerts or
Hi,
I am searching for symmetric encryption algorithms for decimal strings.
Let's say we have various 40-digit decimal numbers:
2349823966232362361233845734628834823823
3250920019325023523623692235235728239462
0198230198519248209721383748374928601923
As far as I calculated, a decimal has the
At Wed, 27 Aug 2008 17:05:44 +0200,
Philipp Gühring wrote:
Hi,
I am searching for symmetric encryption algorithms for decimal strings.
Let's say we have various 40-digit decimal numbers:
2349823966232362361233845734628834823823
3250920019325023523623692235235728239462
On Aug 27, 2008, at 7:10 AM, [EMAIL PROTECTED] wrote:
The relationship to this list may then be thin
excepting that the collection and handling of
such data remains of substantial interest.
Actually, it points to cash settlement of road tolls.
Most likely digital bearer transaction
=?ISO-8859-15?Q?Philipp_G=FChring?= [EMAIL PROTECTED] writes:
Does anyone know a an algorithm that has reasonable strength and is able to
operate on non-binary data? Preferrably on any chosen number-base?
I posted a description of how to perform encryption in limited subranges to
sci.crypt about
On Wed, 27 Aug 2008 17:05:44 +0200
Philipp G__hring [EMAIL PROTECTED] wrote:
Hi,
I am searching for symmetric encryption algorithms for decimal
strings.
Let's say we have various 40-digit decimal numbers:
2349823966232362361233845734628834823823
3250920019325023523623692235235728239462
On Wed, 27 Aug 2008 07:10:51 -0400
[EMAIL PROTECTED] wrote:
Bill Frantz writes, in part:
-+--
| In the San Francisco Bay Area, they are using the transponder codes
| to measure how fast traffic is moving from place to place. They
| post the times to various
Philipp Gühring wrote:
Hi,
I am searching for symmetric encryption algorithms for decimal strings.
Let's say we have various 40-digit decimal numbers:
2349823966232362361233845734628834823823
3250920019325023523623692235235728239462
0198230198519248209721383748374928601923
As far as I
Philipp Gühring wrote:
Hi,
G'day Philipp,
I am searching for symmetric encryption algorithms for decimal strings.
Let's say we have various 40-digit decimal numbers:
2349823966232362361233845734628834823823
3250920019325023523623692235235728239462
0198230198519248209721383748374928601923
Philipp Gühring writes:
I am searching for symmetric encryption algorithms for decimal strings.
Let's say we have various 40-digit decimal numbers:
2349823966232362361233845734628834823823
3250920019325023523623692235235728239462
0198230198519248209721383748374928601923
As far as I
On Wed, 27 Aug 2008, Eric Rescorla wrote:
At Wed, 27 Aug 2008 17:05:44 +0200,
Philipp Gühring wrote:
Hi,
I am searching for symmetric encryption algorithms for decimal strings.
Let's say we have various 40-digit decimal numbers:
2349823966232362361233845734628834823823
Philipp Gühring wote:
I am searching for symmetric encryption algorithms for decimal strings.
Let's say we have various 40-digit decimal numbers:
2349823966232362361233845734628834823823
3250920019325023523623692235235728239462
0198230198519248209721383748374928601923
As far as I
The Codinghorror blog has a good writeup on the level of sophistication of UI
spoofing being used in phishing attacks, specifically how a web search for
lilies leads to a pretty convincing social-engineering attack designed to get
users to install their malware:
On Wed, 27 Aug 2008 09:34:15 -0700
Greg Rose [EMAIL PROTECTED] wrote:
So, you don't have a 133-bit block cipher lying around? No worries,
I'll sell you one ;-).
Also see Debra Cook's PhD dissertation on Elastic Block Ciphers at
http://www1.cs.columbia.edu/~dcook/thesis_ab.shtml
Michael Tschannen wrote:
Hi list
Has anybody already gained experience concerning the technical
implementation of SRP (http://srp.stanford.edu)? There is one point I
couldn't find in any documentation: Should the modulus and the generator
(N and g) be unique for each client or can they be
At Wed, 27 Aug 2008 16:10:51 -0400 (EDT),
Jonathan Katz wrote:
On Wed, 27 Aug 2008, Eric Rescorla wrote:
At Wed, 27 Aug 2008 17:05:44 +0200,
There are a set of techniques that allow you to encrypt elements of
arbitrary sets back onto that set.
The original paper on this is:
John
Personally, I don't want to have a history of my travel stored in any
database. Right now, purchasing a one-time CharlieTicket is a 30 cent
surcharge per ride, but it is the only way to take the subway in Boston
without creating a travel history. Privacy in public transportation
should
I like Greg Rose's solution best:
There is a fairly standard technique for handling things like this.
1. encode your number N into a 133-bit string S
2. encrypt S with your favourite 133-bit block cipher (see below)
3. decode S to a number N'
4. if N' = 10^40, goto 2 (that is, re-encrypt
Hal Finney wrote:
So, you don't have a 133-bit block cipher lying around? No worries, I'll
sell you one ;-). Actually that is easy too. Take a trustworthy 128-bit
block cipher like AES. To encrypt, do:
1. Encrypt the first 128 bits (ECB mode)
2. Encrypt the last 128 bits (also ECB mode).
I
19 matches
Mail list logo
