133views more  IACR 2011»
12 years 6 months ago
Compact McEliece keys based on Quasi-Dyadic Srivastava codes
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very l...
Edoardo Persichetti
82views more  IACR 2011»
12 years 6 months ago
Wild McEliece Incognito
The wild McEliece cryptosystem uses wild Goppa codes over finite fields to achieve smaller public key sizes compared to the original McEliece cryptosystem at the same level of se...
Daniel J. Bernstein, Tanja Lange, Christiane Peter...
104views more  ISCI 2008»
13 years 6 months ago
Unconditionally secure cryptosystems based on quantum cryptography
Most modern cryptographic studies design cryptosystems and algorithms using mathematical concepts. In designing and analyzing cryptosystems and protocols, mathematical concepts ar...
Yu-Fang Chung, Zhen Yu Wu, Tzer-Shyong Chen
94views more  JOC 2000»
13 years 7 months ago
A New Public-Key Cryptosystem over a Quadratic Order with Quadratic Decryption Time
We present a new cryptosystem based on ideal arithmetic in quadratic orders. The method of our trapdoor is different from the Diffie
Sachar Paulus, Tsuyoshi Takagi
134views more  INFORMATICALT 2006»
13 years 7 months ago
Fast Parallel Exponentiation Algorithm for RSA Public-Key Cryptosystem
We know the necessity for information security becomes more widespread in these days, especially for hardware-based implementations such as smart cards chips for wireless applicati...
Chia-Long Wu, Der-Chyuan Lou, Jui-Chang Lai, Te-Je...
132views more  IJNSEC 2006»
13 years 7 months ago
A Fast Semantically Secure Public Key Cryptosystem Based on Factoring
The cryptosystem proposed by Koyama is not semantically secure. Also, it is not secure against partial known plaintext attack, linearly related plaintext attack and low exponent a...
Sahadeo Padhye, Birendra Kumar Sharma
69views more  FUIN 2006»
13 years 7 months ago
An Efficient and Secure Cryptosystem for Encrypting Long Messages
Traditionally, due to efficiency considerations, when encrypting long messages using an asymmtric cryptosystem, one needs to use a symmetric cryptosystem in addition. To eliminate ...
Sheng Zhong
98views more  ECCC 2008»
13 years 7 months ago
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
Chris Peikert
112views Education» more  CORR 2010»
13 years 7 months ago
Little Dragon Two: An efficient Multivariate Public Key Cryptosystem
In 1998 [8], Patarin proposed an efficient cryptosystem called Little Dragon which was a variant of Matsumoto Imai cryptosystem C . However Patarin later found that Little Dragon ...
Rajesh P. Singh, Anupam Saikia, B. K. Sarma
125views Cryptology» more  ICISC 2007»
13 years 8 months ago
A Cryptanalysis of the Double-Round Quadratic Cryptosystem
In the 80’s Matsumoto and Imai [8] proposed public key cryptosystems based on the difficulty of solving systems of polynomials in several variables. Although these first schemes...
Antoine Scemama