Sciweavers

103 search results - page 13 / 21
» Unconditionally secure cryptosystems based on quantum crypto...
Sort
View
TC
2010
13 years 2 months ago
Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods
This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable ...
Miroslav Knezevic, Frederik Vercauteren, Ingrid Ve...
DCC
2001
IEEE
14 years 7 months ago
Cryptography in Quadratic Function Fields
We describe several cryptographic schemes in quadratic function fields of odd characteristic. In both the real and the imaginary representation of such a field, we present a Diffi...
Renate Scheidler
PKC
2007
Springer
219views Cryptology» more  PKC 2007»
14 years 1 months ago
Cryptanalysis of the Paeng-Jung-Ha Cryptosystem from PKC 2003
At PKC 2003 Paeng, Jung, and Ha proposed a lattice based public key cryptosystem(PJH). It is originated from GGH, and designed as a hybrid of GGH and NTRUEncrypt in order to reduce...
Daewan Han, Myung-Hwan Kim, Yongjin Yeom
CRYPTO
2000
Springer
151views Cryptology» more  CRYPTO 2000»
13 years 11 months ago
New Public-Key Cryptosystem Using Braid Groups
Abstract. The braid groups are infinite non-commutative groups naturally arising from geometric braids. The aim of this article is twofold. One is to show that the braid groups ca...
Ki Hyoung Ko, Sangjin Lee, Jung Hee Cheon, Jae Woo...
INFORMATICALT
2006
116views more  INFORMATICALT 2006»
13 years 7 months ago
An Electronic Cash System Based on Group Blind Signatures
One important requirement of electronic cash systems is the anonymity of customers. Unconditional anonymity is also very well suited to support criminals in blackmailing. Maitland ...
Constantin Popescu