Search For:

Displaying 1-16 out of 16 total
Robustness Analysis of Real-Time Scheduling Against Differential Power Analysis Attacks
Found in: 2014 IEEE Computer Society Annual Symposium on VLSI (ISVLSI)
By Ke Jiang,Lejla Batina,Petru Eles,Zebo Peng
Issue Date:July 2014
pp. 450-455
Embedded systems (ESs) have been a prominent solution for enhancing system performance and reliability in recent years. ESs that are required to ensure functional correctness under timing constraints are referred to as real-time embedded systems (RTESs). W...
 
Breaking Elliptic Curve Cryptosystems Using Reconfigurable Hardware
Found in: International Conference on Field Programmable Logic and Applications
By Junfeng Fan, Daniel V. Bailey, Lejla Batina, Tim Güneysu, Christof Paar, Ingrid Verbauwhede
Issue Date:September 2010
pp. 133-138
This paper reports a new speed record for FPGAs in cracking Elliptic Curve Cryptosystems. We conduct a detailed analysis of different $\textbf{F}_{2^m}$ multiplication approaches in this application. A novel architecture using optimized normal basis multip...
 
FPGA-based testing strategy for cryptographic chips: A case study on Elliptic Curve Processor for RFID tags
Found in: On-Line Testing Symposium, IEEE International
By Junfeng Fan, Miroslav Knezevic, Dusko Karaklajic, Roel Maes, Vladimir Rozic, Lejla Batina, Ingrid Verbauwhede
Issue Date:June 2009
pp. 189-191
Testing of cryptographic chips or components has one extra dimension: physical security. The chip designers should improve the design if it leaks too much information through side-channels, such as timing, power consumption, electric-magnetic radiation, an...
 
Elliptic-Curve-Based Security Processor for RFID
Found in: IEEE Transactions on Computers
By Yong Ki Lee, Kazuo Sakiyama, Lejla Batina, Ingrid Verbauwhede
Issue Date:November 2008
pp. 1514-1527
RFID (Radio Frequency IDentification) tags need to include security functions, yet at the same time their resources are extremely limited. Moreover, to provide privacy, authentication and protection against tracking of RFID tags without loosing the system ...
 
Low-cost implementations of NTRU for pervasive security
Found in: Application-Specific Systems, Architectures and Processors, IEEE International Conference on
By Ali Can Atici, Lejla Batina, Junfeng Fan, Ingrid Verbauwhede, S. Berna Ors Yalcin
Issue Date:July 2008
pp. 79-84
NTRU is a public-key cryptosystem based on the shortest vector problem in a lattice which is an alternative to RSA and ECC. This work presents a compact and low power NTRU design that is suitable for pervasive security applications such as RFIDs and sensor...
 
FPGA Design for Algebraic Tori-Based Public-Key Cryptography
Found in: Design, Automation and Test in Europe Conference and Exhibition
By Junfeng Fan, Lejla Batina, Kazuo Sakiyama, Ingrid Verbauwhede
Issue Date:March 2008
pp. 1292-1297
Algebraic torus-based cryptosystems are an alternative for Public-Key Cryptography (PKC). It maintains the security of a larger group while the actual computations are performed in a subgroup. Compared with RSA for the same security level, it allows faster...
 
Multicore Curve-Based Cryptoprocessor with Reconfigurable Modular Arithmetic Logic Units over GF(2^n)
Found in: IEEE Transactions on Computers
By Kazuo Sakiyama, Lejla Batina, Bart Preneel, Ingrid Verbauwhede
Issue Date:September 2007
pp. 1269-1282
This paper presents a reconfigurable curve-based cryptoprocessor that accelerates scalar multiplication of Elliptic Curve Cryptography (ECC) and HyperElliptic Curve Cryptography (HECC) of genus 2 over GF(2<sup>n</sup>). By allocating &#x03B...
 
Side-Channel Issues for Designing Secure Hardware Implementations
Found in: On-Line Testing Symposium, IEEE International
By Lejla Batina, Nele Mentens, Ingrid Verbauwhede
Issue Date:July 2005
pp. 118-121
Selecting a strong cryptographic algorithm makes no sense if the information leaks out of the device through side-channels. Sensitive information, such as secret keys, can be obtained by observing the power consumption, the electromagnetic radiation, etc. ...
 
Side-channel aware design: Algorithms and Architectures for Elliptic Curve Cryptography over GF(2^n )
Found in: Application-Specific Systems, Architectures and Processors, IEEE International Conference on
By Lejla Batina, Nele Mentens, Bart Preneel, Ingrid Verbauwhede
Issue Date:July 2005
pp. 350-355
<p>This paper proposes efficient algorithms for Elliptic Curve Cryptography (ECC). As an example a compact and efficient FPGA architecture for ECC over finite fields of even characteristic is presented. The implementation is balanced in order to incr...
 
Hardware Implementation of an Elliptic Curve Processor over GF(p)
Found in: Application-Specific Systems, Architectures and Processors, IEEE International Conference on
By Sýddýka Berna Ors, Lejla Batina, Bart Preneel, Joos Vandewalle
Issue Date:June 2003
pp. 433
This paper describes a hardware implementation of an arithmetic processor which is efficient for bit-lengths suitable for both commonly used types of Public Key Cryptography (PKC), i.e., Elliptic Curve (EC) and RSA Cryptosystems. Montgomery modular multipl...
 
Hardware Implementation of a Montgomery Modular Multiplier in a Systolic Array
Found in: Parallel and Distributed Processing Symposium, International
By Sýddýka Berna Örs, Lejla Batina, Bart Preneel, Joos Vandewalle
Issue Date:April 2003
pp. 184b
This paper describes a hardware architecture for modular multiplication operation which is efficient for bit-lengths suitable for both commonly used types of Public Key Cryptography (PKC) i.e. ECC and RSA Cryptosystems. The challenge of current PKC impleme...
 
On using genetic algorithms for intrinsic side-channel resistance: the case of AES S-box
Found in: Proceedings of the First Workshop on Cryptography and Security in Computing Systems (CS2 '14)
By Łukasz Chmielewski, Bariş Ege, Domagoj Jakobovic, Lejla Batina, Marin Golub, Stjepan Picek
Issue Date:January 2014
pp. 13-18
Finding balanced S-boxes with high nonlinearity and low transparency order is a difficult problem. The property of transparency order is important since it specifies the resilience of an S-box against differential power analysis. Better values for transpar...
     
The communication and computation cost of wireless security: extended abstract
Found in: Proceedings of the fourth ACM conference on Wireless network security (WiSec '11)
By Dave Singelee, Ingrid Verbauwhede, Lejla Batina, Stefaan Seys
Issue Date:June 2011
pp. 1-4
Ubiquity is dedicated to the future of computing and the people who are creating it. What exactly does this mean for readers, for contributors, and for editors soliciting and reviewing contributions? We decided to ask the editor in chief, Peter Denning, ho...
     
Low-cost untraceable authentication protocols for RFID
Found in: Proceedings of the third ACM conference on Wireless network security (WiSec '10)
By Dave Singelee, Ingrid Verbauwhede, Lejla Batina, Yong Ki Lee
Issue Date:March 2010
pp. 55-64
The emergence of pervasive computing devices has raised several privacy issues. In this paper, we address the risk of tracking attacks in RFID networks. Our contribution is threefold: (1) We repair three revised EC-RAC protocols of Lee, Batina and Verbauwh...
     
Identification via location-profiling in GSM networks
Found in: Proceedings of the 7th ACM workshop on Privacy in the electronic society (WPES '08)
By Bart Preneel, George Danezis, Lejla Batina, Yoni De Mulder
Issue Date:October 2008
pp. 53-62
As devices move within a cellular network, they register their new location with cell base stations to allow for the correct forwarding of data. We show it is possible to identify a mobile user from these records and a pre-existing location profile, based ...
     
FPGA design for algebraic tori-based public-key cryptography
Found in: Proceedings of the conference on Design, automation and test in Europe (DATE '08)
By Ingrid Verbauwhede, Junfeng Fan, Kazuo Sakiyama, Lejla Batina
Issue Date:March 2008
pp. 1-30
Algebraic torus-based cryptosystems are an alternative for Public-Key Cryptography (PKC). It maintains the security of a larger group while the actual computations are performed in a subgroup. Compared with RSA for the same security level, it allows faster...
     
 1