Sciweavers

1769 search results - page 44 / 354
» Cryptography
Sort
View
INDOCRYPT
2001
Springer
15 years 2 months ago
Elliptic Curves of Prime Order over Optimal Extension Fields for Use in Cryptography
We present an algorithm for generating elliptic curves of prime order over Optimal Extension Fields suitable for use in cryptography. The algorithm is based on the theory of Comple...
Harald Baier
67
Voted
ECTEL
2006
Springer
15 years 1 months ago
New Media for Teaching Applied Cryptography and Network Security
Considering that security education needs to train students to deal with security problems in real environments, we developed new media for teaching applied cryptography and networ...
Ji Hu, Dirk Cordel, Christoph Meinel
FCS
2006
14 years 11 months ago
Polynomially Uncomputable Number-Theoretic Problems in Cryptography and Network Security
By far the most important automated tool for network and communications security is encryption, but encryption itself needs security. As we know, many cryptosystems and cryptograp...
Song Y. Yan, Glyn James, Gongyi Wu
IJNSEC
2006
61views more  IJNSEC 2006»
14 years 9 months ago
Is There a Shortage of Primes for Cryptography?
Cryptographic algorithms often prescribe the use of primes whose length in bits is a power of 2. Recently, we proved that for m > 1, there is no prime number with 2m significan...
Samuel S. Wagstaff Jr.
TCC
2009
Springer
167views Cryptology» more  TCC 2009»
15 years 10 months ago
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
This paper considers two questions in cryptography. Cryptography Secure Against Memory Attacks. A particularly devastating side-channel attack against cryptosystems, termed the &qu...
Adi Akavia, Shafi Goldwasser, Vinod Vaikuntanathan