History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 | next | last

Result 1 to 20 of 20 total

Low-latency encryption ‒ is “lightweight = light + wait”? (English)
Prouff, Emmanuel (ed.) et al., Cryptographic hardware and embedded systems - CHES 2012. 14th international workshop, Leuven, Belgium, September 9‒12, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33026-1/pbk). Lecture Notes in Computer Science 7428, 426-446 (2012).
1
Tripartite modular multiplication. (English)
Integr., VLSI J. 44, No. 4, 259-269 (2011).
2
Spongent: A lightweight hash function. (English)
Preneel, Bart (ed.) et al., Cryptographic hardware and embedded systems ‒ CHES 2011. 13th international workshop, Nara, Japan, September 28‒October 1, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23950-2/pbk). Lecture Notes in Computer Science 6917, 312-325 (2011).
3
Spongent: A lightweight hash function (English)
CHES, 312-325 (2011).
4
Speeding up bipartite modular multiplication. (English)
Hasan, M. Anwar (ed.) et al., Arithmetic of finite fields. Third international workshop, WAIFI 2010, Istanbul, Turkey, June 27‒30, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13796-9/pbk). Lecture Notes in Computer Science 6087, 166-179 (2010).
5
Faster interleaved modular multiplication based on barrett and montgomery reduction methods (English)
IEEE Trans. Computers 59, No. 12, 1715-1721 (2010).
6
Speeding up bipartite modular multiplication (English)
WAIFI, 166-179 (2010).
7
Prototyping platform for performance evaluation of SHA-3 candidates (English)
HOST, 60-63 (2010).
8
Low cost built in self test for public key crypto cores (English)
FDTC, 97-103 (2010).
9
KATAN and KTANTAN ‒ a family of small and efficient hardware-oriented block ciphers. (English)
Clavier, Christophe (ed.) et al., Cryptographic hardware and embedded systems ‒ CHES 2009. 11th international workshop Lausanne, Switzerland, September 6‒9, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04137-2/pbk). Lecture Notes in Computer Science 5747, 272-288 (2009).
10
Hardware evaluation of the luffa hash family (English)
WESS (2009).
11
KATAN and KTANTAN - A family of small and efficient hardware-oriented block ciphers (English)
CHES, 272-288 (2009).
12
Modular reduction without precomputational phase (English)
ISCAS, 1389-1392 (2009).
13
FPGA-based testing strategy for cryptographic chips: A case study on elliptic curve processor for RFID tags (English)
IOLTS, 189-191 (2009).
14
Modular reduction in $\mathrm{GF}(2^n)$ without pre-computational phase. (English)
von zur Gathen, Joachim (ed.) et al., Arithmetic of finite fields. 2nd international workshop, WAIFI 2008, Siena, Italy, July 6‒9, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69498-4/pbk). Lecture Notes in Computer Science 5130, 77-87 (2008).
15
On the practical performance of rateless codes (English)
WINSYS, 173-176 (2008).
16
On the high-throughput implementation of RIPEMD-160 hash algorithm (English)
ASAP, 85-90 (2008).
17
Modular reduction in $GF(2^{n})$ without pre-computational phase (English)
WAIFI, 77-87 (2008).
18
Demonstration of unobservable voice over IP (English)
WOWMOM, 1-3 (2008).
19
Tool assisted H.323 dial-plan design following formally defined strategies. (English)
Int. J. Commun. Syst. 19, No. 5, 585-602 (2006).
20
first | previous | 1 | next | last

Result 1 to 20 of 20 total