Sciweavers

490 search results - page 82 / 98
» A New Public-Key Cryptosystem
Sort
View
161
Voted
ASIACRYPT
2005
Springer
15 years 9 months ago
Adapting Density Attacks to Low-Weight Knapsacks
Cryptosystems based on the knapsack problem were among the first public-key systems to be invented. Their high encryption/decryption rate attracted considerable interest until it ...
Phong Q. Nguyen, Jacques Stern
140
Voted
GMP
2003
IEEE
247views Solid Modeling» more  GMP 2003»
15 years 9 months ago
Message Recovery Signature Scheme Using Complementary Elliptic Curves
Elliptic curve cryptography is known for its complexity due to its discrete logarithm problem, and this gives advantage to the system used since the formula developed using this c...
Teo Chun Yew, Hailiza Kamarulhaili, Putra Sumari
127
Voted
ASIACRYPT
2003
Springer
15 years 9 months ago
Tate Pairing Implementation for Hyperelliptic Curves y2 = xp-x + d
The Weil and Tate pairings have been used recently to build new schemes in cryptography. It is known that the Weil pairing takes longer than twice the running time of the Tate pair...
Iwan M. Duursma, Hyang-Sook Lee
129
Voted
FSE
2003
Springer
125views Cryptology» more  FSE 2003»
15 years 9 months ago
On Plateaued Functions and Their Constructions
We use the notion of covering sequence, introduced by C. Carlet and Y. Tarannikov, to give a simple characterization of bent functions. We extend it into a characterization of plat...
Claude Carlet, Emmanuel Prouff
ASIACRYPT
2001
Springer
15 years 8 months ago
Speeding Up XTR
This paper describes several speedups and simplifications for XTR. The most important results are new XTR double and single exponentiation methods where the latter requires a chea...
Martijn Stam, Arjen K. Lenstra