Harris Michail
Zitiert von
Zitiert von
An RNS Implementation of an Elliptic Curve Point Multiplier
DM Schinianakis, AP Fournaris, HE Michail, AP Kakarountas, T Stouraitis
IEEE Transactions on Circuits and Systems I: Regular Papers 56 (6), 1202-1213, 2008
A top-down design methodology for ultrahigh-performance hashing cores
H Michail, A Kakarountas, A Milidonis, C Goutis
IEEE Transactions on Dependable and Secure Computing 6 (4), 255-268, 2008
Efficient implementation of the keyed-hash message authentication code (HMAC) using the SHA-1 hash function
HE Michail, AP Kakarountas, A Milidonis, CE Goutis
Proceedings of the 2004 11th IEEE International Conference on Electronics …, 2004
On the exploitation of a high-throughput SHA-256 FPGA design for HMAC
HE Michail, GS Athanasiou, V Kelefouras, G Theodoridis, CE Goutis
ACM Transactions on Reconfigurable Technology and Systems (TRETS) 5 (1), 1-28, 2012
A low-power and high-throughput implementation of the SHA-1 hash function
H Michail, AP Kakarountas, O Koufopavlou, CE Goutis
2005 IEEE International Symposium on Circuits and Systems, 4086-4089, 2005
Design and implementation of totally-self checking SHA-1 and SHA-256 hash functions’ architectures
HE Michail, GS Athanasiou, G Theodoridis, A Gregoriades, CE Goutis
Microprocessors and Microsystems 45, 227-240, 2016
High performance pipelined FPGA implementation of the SHA-3 hash algorithm
L Ioannou, HE Michail, AG Voyiatzis
2015 4th Mediterranean Conference on Embedded Computing (MECO), 68-71, 2015
High-speed FPGA implementation of secure hash algorithm for IPSec and VPN applications
AP Kakarountas, H Michail, A Milidonis, CE Goutis, G Theodoridis
The Journal of Supercomputing 37, 179-195, 2006
Pipelined SHA-3 implementations on FPGA: Architecture and performance analysis
HE Michail, L Ioannou, AG Voyiatzis
Proceedings of the Second Workshop on Cryptography and Security in Computing …, 2015
Improved throughput bit-serial multiplier for GF (2m) fields
GN Selimis, AP Fournaris, HE Michail, O Koufopavlou
Integration 42 (2), 217-226, 2009
On the development of high-throughput and area-efficient multi-mode cryptographic hash designs in FPGAs
HE Michail, GS Athanasiou, G Theodoridis, CE Goutis
Integration 47 (4), 387-407, 2014
Assessing students’ learning in MIS using concept mapping
A Gregoriades, M Pampaka, H Michail
Journal of Information Systems Education 20 (4), 419, 2009
Optimizing SHA-1 hash function for high throughput with a partial unrolling study
HE Michail, AP Kakarountas, GN Selimis, CE Goutis
Integrated Circuit and System Design. Power and Timing Modeling …, 2005
Optimising the SHA‐512 cryptographic hash function on FPGAs
GS Athanasiou, HE Michail, G Theodoridis, CE Goutis
IET Computers & Digital Techniques 8 (2), 70-82, 2014
Efficient small-sized implementation of the keyed-hash message authentication code
M Papadonikolakis, H Michail, AP Kakarountas, CE Goutis
EUROCON 2005-The International Conference on" Computer as a Tool" 2, 1875-1878, 2005
Novel high throughput implementation of SHA-256 hash function through pre-computation technique
H Michail, A Milidonis, A Kakarountas, C Goutis
2005 12th IEEE International Conference on Electronics, Circuits and Systems …, 2005
A methodology for speeding up fast fourier transform focusing on memory architecture utilization
VI Kelefouras, GS Athanasiou, N Alachiotis, HE Michail, AS Kritikakou, ...
IEEE Transactions on Signal Processing 59 (12), 6217-6226, 2011
Maximizing the hash function of authentication codes
II Yiakoumis, ME Papadonikolakis, HE Michail, AP Kakarountas, ...
IEEE Potentials 25 (2), 9-12, 2006
A data locality methodology for matrix–matrix multiplication algorithm
N Alachiotis, VI Kelefouras, GS Athanasiou, HE Michail, AS Kritikakou, ...
The Journal of Supercomputing 59, 830-851, 2012
Area-throughput trade-offs for SHA-1 and SHA-256 hash functions’ pipelined designs
HE Michail, GS Athanasiou, VI Kelefouras, G Theodoridis, T Stouraitis, ...
Journal of Circuits, Systems and Computers 25 (04), 1650032, 2016
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20