Sciweavers

2967 search results - page 397 / 594
» Cryptology
Sort
View
FDTC
2007
Springer
105views Cryptology» more  FDTC 2007»
16 years 5 days ago
Tate Pairing with Strong Fault Resiliency
We present a novel non-linear error coding framework which incorporates strong adversarial fault detection capabilities into identity based encryption schemes built using Tate pai...
Erdinç Öztürk, Gunnar Gaubatz, Be...
FSE
2007
Springer
263views Cryptology» more  FSE 2007»
16 years 5 days ago
Bad and Good Ways of Post-processing Biased Physical Random Numbers
Algorithmic post-processing is used to overcome statistical deficiencies of physical random number generators. We show that the quasigroup based approach for post-processing rando...
Markus Dichtl
PAIRING
2007
Springer
16 years 4 days ago
On the Minimal Embedding Field
Let C be a curve of genus g, defined over a finite field Fq, where q = pm for a prime p. Let N be a large integer coprime to p, dividing the order of the Jacobian variety associ...
Laura Hitt
PAIRING
2007
Springer
134views Cryptology» more  PAIRING 2007»
16 years 4 days ago
Proxy Re-encryption Systems for Identity-Based Encryption
A proxy re-encryption system allows the proxy to transform ciphertexts encrypted under Alice’s public key into the different ciphertexts that can be decrypted by Bob’s secret ...
Toshihiko Matsuo
PKC
2007
Springer
165views Cryptology» more  PKC 2007»
16 years 3 days ago
Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi's RSA
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
Noboru Kunihiro, Kaoru Kurosawa