Sciweavers

402 search results - page 2 / 81
» Cryptosystems using Linear Groups
Sort
View
ASIACRYPT
2010
Springer
13 years 3 months ago
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
sion of an extended abstract published in Proceedings of Asiacrypt 2010, Springer-Verlag, 2010. Available from the IACR Cryptology ePrint Archive as Report 2010/474. Beginning wit...
Sarah Meiklejohn, Hovav Shacham, David Mandell Fre...
CRYPTO
2001
Springer
162views Cryptology» more  CRYPTO 2001»
13 years 9 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...
DCC
2004
IEEE
14 years 4 months ago
On the Security of Two Public Key Cryptosystems Using Non-Abelian Groups
Maria Isabel Gonzalez Vasco, Dennis Hofheinz, Cons...
DCC
2007
IEEE
14 years 4 months ago
Towards generating secure keys for braid cryptography
Abstract. Braid cryptosystem was proposed in CRYPTO 2000 as an alternate public-key cryptosystem. The security of this system is based upon the conjugacy problem in braid groups. S...
Ki Hyoung Ko, Jang-Won Lee, Tony Thomas
SIAMCOMP
2008
103views more  SIAMCOMP 2008»
13 years 5 months ago
Compression in Finite Fields and Torus-Based Cryptography
Abstract. We present efficient compression algorithms for subgroups of multiplicative groups of finite fields, we use our compression algorithms to construct efficient public key c...
Karl Rubin, Alice Silverberg