UMBC's 22nd Annual Undergraduate Research and Creative Achievement Day (URCAD) is April 25, 2018

Have mentor-led research or creative work to present? Present a powerpoint, poster, display your artwork, digital story, video game, film, choreography, engineered prototype, spoken word performance, musical composition... get creative!

Application Deadline: 
TODAY, MONDAY, Feb. 26, 2018 at 5pm.

Applying is easy- submit a 200-word abstract and mentor support form online! 

Go to: ur.umbc.edu/urcad

Questions? aprilh@umbc.edu

UMBC Professors Haibin Zhang (Computer Science and Electrical Engineering) and Karuna Joshi (Information Systems) will be panelists for an event focused on the impact, promise and perils of blockchain technologies at the bwtech@UMBC Research & Technology Park. The event will take place from 8:15 to 11:15am on Tuesday, March 20 2018 at and will include breakfast and time for networking.  They will be joined on the panel by Marcus Edwards, from Northrop Grumman’s Cyber & Intelligence Mission Solutions, Steve Cook of Verizon Enterprise Solutions and moderator Razvan Miutescu of Whiteford, Taylor & Preston, LLP.   For more information and tickets are available on eventbrite.

CyberInnovation Briefing: The Global Impact, Promise & Perils of Blockchain

8:15 – 11:15 Tuesday, March 20, 2018

bwtech@UMBC Research & Technology Park
5520 Research Park Drive, Baltimore, MD 21228

Cryptocurrency market capitalizations have soared over the past year and new innovative blockchain applications are continuing to emerge seemingly by the day. However, the average end-user is left to singularly make sense of a vast and global marketplace that is rapidly converging the core tenets of economics and technology development. The future prospects of traditional business and financial models is uncertain as blockchain technology leaves key decision makers in an untenable position to either adopt and adapt or simply be left behind. Industry and academic experts in the field will discuss the pros and cons and opportunities and challenges of this disruptive technology movement.

The post CyberInnovation Briefing: Global Impact, Promise & Perils of Blockchain appeared first on Department of Computer Science and Electrical Engineering.

UMBC's 22nd Annual Undergraduate Research and Creative Achievement Day (URCAD) is April 25, 2018

Have mentor-led research or creative work to present? Present a powerpoint, poster, display your artwork, digital story, video game, film, choreography, engineered prototype, spoken word performance, musical composition... get creative!

Application Deadline:
This MONDAY, Feb. 26, 2018 at 5pm.

Applying is easy- submit a 200-word abstract and mentor support form!

Go to: ur.umbc.edu/urcad

Questions? aprilh@umbc.edu

The UMBC Cyber Defense Lab presents

Experimentally Measuring the Circuit Complexity
of One-Way Boolean Functions

Brian Weber, CSEE, UMBC

12:00–1:00pm, Friday, 23 February 2018, ITE 229

I present preliminary results from an exhaustive search for one-way functions in certain classes of small Boolean functions.   One-way functions are functions that are easy to compute but hard to invert.  They are vital for cryptography, yet no one has proven their existence for arbitrary input sizes.  For any bounded circuit model of computation, it is possible to search exhaustively over all possible Boolean functions of restricted size and thereby determine for the searched class the maximum disparity between the complexity of any function and its inverse.  Throughout, we assume a circuit model in which each gate has fan-in 2 and fan-out 1.

In his 1985 dissertation at MIT, Steven Boyack carried out the first such search.  For any positive integers n and M, let F_n,M denote the set of Boolean functions with n inputs and Moutputs. Using circuit size as the complexity measure, Boyack searched the space of every combinatorial function in F_3,3 by searching each of 52 equivalency classes of functions in this space.  He found that every function class in this space has an identically sized inverse.  He was able to prove that functions do exist with more complex inverses outside the space he searched, but not by more than a constant factor.

In spring 2017, using circuit depth as the complexity measure, I searched all injective functions up to F_8,8 whose coordinate functions are in F_2,1.  A coordinate function in this context refers to the function that computes an individual output bit.  In addition, I searched up to F_4,4 allowing coordinate functions in F_3,1.  In the space I searched, the most one-way function has fixed depth of 1, and an inverse depth exactly equal to the input size of the function. That is, for each 2 < n < 9, the hardest inverse in the space I searched has a depth of n, where n is the number of input bits. In addition, a search space allowing a larger fan-in for the coordinate functions did not yield functions less invertible than were found in the original search space.

Brian Weber is a senior BS/MS computer engineering student and SFS scholar at UMBC.  He hopes to extend the work presented here into his Master’s thesis next year.  Email: *protected email*

Host: Alan T.  Sherman, *protected email*Support for this research was provided in part by the National Science Foundation under SFS grant 1241576.

The UMBC Cyber Defense Lab meets biweekly Fridays.  All meetings are open to the public.

The post talk: Circuit Complexity of One-Way Boolean Functions, 12pm Fri 2/23, ITE229 appeared first on Department of Computer Science and Electrical Engineering.