127 search results - page 16 / 26 » On Cryptographic Schemes Based on Discrete Logarithms and Fa... |
ACISP
2000
Springer
14 years 8 days ago
2000
Springer
We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications. 1 Ove...
EUROCRYPT
2001
Springer
14 years 13 days ago
2001
Springer
Abstract. We show that finding an efficiently computable injective homomorphism from the XTR subgroup into the group of points over GF(p2 ) of a particular type of supersingular e...
EUROCRYPT
1999
Springer
14 years 6 days ago
1999
Springer
Abstract. We consider the problem of sending messages into the future." Previous constructions for this task were either based on heuristic assumptions or did not provide anon...
ASIACRYPT
2007
Springer
14 years 2 months ago
2007
Springer
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
DATE
1998
IEEE
14 years 6 days ago
1998
IEEE
Petri nets are a graph-based formalism appropriate to model concurrentsystems such as asynchronouscircuits or network protocols. Symbolic techniques based on Binary Decision Diagr...