Sciweavers

281 search results - page 27 / 57
» A New RSA-Based Signature Scheme
Sort
View
CTRSA
2007
Springer
146views Cryptology» more  CTRSA 2007»
14 years 5 months ago
How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
SETA
2004
Springer
122views Mathematics» more  SETA 2004»
14 years 4 months ago
New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
Kenneth J. Giuliani, Guang Gong
CRYPTO
2001
Springer
162views Cryptology» more  CRYPTO 2001»
14 years 3 months ago
New Public Key Cryptosystem Using Finite Non Abelian Groups
Most public key cryptosystems have been constructed based on abelian groups up to now. We propose a new public key cryptosystem built on finite non abelian groups in this paper. I...
Seong-Hun Paeng, Kil-Chan Ha, Jae Heon Kim, Seongt...
IACR
2011
136views more  IACR 2011»
12 years 10 months ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
IACR
2011
94views more  IACR 2011»
12 years 10 months ago
Practical Key-recovery For All Possible Parameters of SFLASH
In this paper we present a new practical key-recovery attack on the SFLASH signature scheme. SFLASH is a derivative of the older C∗ encryption and signature scheme that was broke...
Charles Bouillaguet, Pierre-Alain Fouque, Gilles M...