PKC 2010 - PDF Preprint Papers

PKC 2010 International Workshop on Public Key Cryptography

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed PKC-2010 Paper

click to vote

PKC
2010
Springer

234views Cryptology» more PKC 2010»

Solving a 676-Bit Discrete Logarithm Problem in GF(36n)

13 years 6 months ago

Download eprint.iacr.org

Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...

Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shi...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	234	Solving a 676-Bit Discrete Logarithm Problem in GF(36n)	claim
2	217	Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions	claim
3	210	Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem	claim
4	210	Efficient Arithmetic on Hessian Curves	claim
5	199	Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval	claim
6	193	Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes	claim
7	187	Confidential Signatures and Deterministic Signcryption	claim
8	183	Unlinkability of Sanitizable Signatures	claim
9	179	Preventing Pollution Attacks in Multi-source Network Coding	claim
10	177	More Constructions of Lossy and Correlation-Secure Trapdoor Functions	claim
11	175	Secure Network Coding over the Integers	claim
12	162	Faster Pairing Computations on Curves with High-Degree Twists	claim
13	161	Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model	claim
14	150	Security of Encryption Schemes in Weakened Random Oracle Models	claim
15	148	On the Feasibility of Consistent Computations	claim
16	146	Groth-Sahai Proofs Revisited	claim
17	138	Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA	claim
18	130	Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions	claim
19	126	Multi-query Computationally-Private Information Retrieval with Constant Communication Rate	claim
20	126	Implicit Factoring with Shared Most Significant and Middle Bits	claim
21	119	Efficient Set Operations in the Presence of Malicious Adversaries	claim
22	118	Text Search Protocols with Simulation Based Security	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers