14 search results - page 1 / 3 » Pseudorandomness from Braid Groups |
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
Recently the braid groups were introduced as a new source for cryptography. The group operations are performed efficiently and the features are quite different from those of other...
CRYPTO
2000
Springer
13 years 9 months ago
2000
Springer
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...
EUROCRYPT
2003
Springer
13 years 9 months ago
2003
Springer
At CRYPTO 2000, a new public-key encryption based on braid groups was introduced. This paper demonstrates how to solve its underlying problem using the Burau representation. By thi...
IJNSEC
2011
12 years 11 months ago
2011
In this paper, we reinvestigate the security analysis of blind signature scheme over braid groups proposed by Verma in 2008. A blind signature scheme is a cryptographic primitive ...
CRV
2007
IEEE
13 years 11 months ago
2007
IEEE
As an extension to classical structured lighting techniques, the use of bi-dimensional pseudo-random color codes is explored to perform range sensing with variable density from a ...