Gahyun Park Headshot

Gahyun Park

Lecturer
Department of Computing Security
Golisano College of Computing and Information Sciences

585-475-5348
Office Location
Office Mailing Address
152 Lomb Memorial Drive Rochester, NY 14623

Gahyun Park

Lecturer
Department of Computing Security
Golisano College of Computing and Information Sciences

Education

BS, Ewha Womans University (South Korea); MS, Ph.D., Purdue University

Bio

Gahyun Park joined the Computing Security department in 2016. She received her Ph.D. in Computer Science from Purdue University. Since then, she has been teaching a wide range of courses in Computer Science and Mathematics at SUNY Geneseo and School of Mathematics at Rochester Institute of Technology. Her interests include stochastic analysis and randomization with applications to distributed computing.

585-475-5348

Areas of Expertise
Design and Analysis of Algorithms

Currently Teaching

CSCI-141
4 Credits
This course serves as an introduction to computational thinking using a problem-centered approach. Specific topics covered include: expression of algorithms in pseudo code and a programming language; functional and imperative programming techniques; control structures; problem solving using recursion; basic searching and sorting; elementary data structures such as lists, trees, and graphs; and correctness, testing and debugging. Assignments (both in class and for homework) requiring a pseudo code solution and an implementation are an integral part of the course. An end-of-term project is also required.
CSEC-362
3 Credits
As more users access remote systems, the job of identifying and authenticating those users at distance becomes increasingly difficult. The growing impact of attackers on identification and authentication systems puts additional strain on our ability to ensure that only authorized users obtain access to controlled or critical resources. This course introduces encryption techniques and their application to contemporary authentication methods.
CSCI-142
4 Credits
This course delves further into problem solving by continuing the discussion of data structure use and design, but now from an object-oriented perspective. Key topics include more information on tree and graph structures, nested data structures, objects, classes, inheritance, interfaces, object-oriented collection class libraries for abstract data types (e.g. stacks, queues, maps, and trees), and static vs. dynamic data types. Concepts of object-oriented design are a large part of the course. Software qualities related to object orientation, namely cohesion, minimal coupling, modifiability, and extensibility, are all introduced in this course, as well as a few elementary object-oriented design patterns. Input and output streams, graphical user interfaces, and exception handling are covered. Students will also be introduced to a modern integrated software development environment (IDE). Programming projects will be required.
CSEC-201
3 Credits
This course builds upon basic programming skills to give students the programming knowledge necessary to study computing security. Students will be introduced to network programming, memory management, and operating system calls along with associated security concepts. Specific focus will placed on understanding the compilation process and on the relation between high-level programming concepts and low-level programming concepts, culminating in identifying and exploiting memory corruption vulnerabilities.
CSEC-202
3 Credits
This course will teach students the core concepts needed to analyze unknown source code. Students will study a variety of low-level programming languages and how high-level programming language structures relate to low-level programming languages. Students will learn study tools and techniques used for both static and dynamic analysis of unknown binaries, providing the foundation for further study in malware analysis.