公开(公告)号：US10664589B2

公开(公告)日：2020-05-26

申请号：US15485868

申请日：2017-04-12

Applicant: Korea Advanced Institute of Science and Technology

Inventor： Brent ByungHoon Kang ,  Daehee Jang ,  Minsu Kim ,  Jonghwan Kim ,  Daegyeong Kim ,  Hojoon Lee

IPC: G06F12/14 ,  G06F12/00 ,  G06F21/52 ,  G06F21/57 ,  H04L29/06

Abstract: A memory alignment randomization method of a memory heap exploit is provided, memory alignment of objects inside a heap area is randomly performed to mitigate the exploits of the vulnerability of the software memory heap area The heap exploit is powerfully mitigated by aligning randomly obtained memory addresses instead of aligning memory addresses at multiples of 4 or 8 when the memory alignment for the objects inside the heap area.

公开(公告)号：US20250004958A1

公开(公告)日：2025-01-02

申请号：US18688901

申请日：2021-08-02

Applicant: Korea Advanced Institute of Science and Technology ,  Research & Business Foundation SUNGKYUNKWAN UNIVERSITY

Inventor： Brent ByungHoon Kang ,  Daegyeong Kim ,  Geonwoo Kim ,  Eunjin Kim ,  Wonwoo Choi ,  Chang-il Lim ,  Youngkwang Han ,  Hojoon Lee

IPC: G06F13/20

Abstract: A method for safely designing and implementing an interconnect for a disaggregated system is disclosed. The method for designing and implementing an interconnect for a disaggregated system, according to an embodiment, may comprise the steps of: configuring an interconnect for a disaggregated system by using a layer-based topology; and managing components of the disaggregated system via a plurality of routers included in the configured interconnect.

公开(公告)号：US20180157827A1

公开(公告)日：2018-06-07

申请号：US15485868

申请日：2017-04-12

Applicant: Korea Advanced Institute of Science and Technology

Inventor： Brent ByungHoon Kang ,  Daehee Jang ,  Minsu Kim ,  Jonghwan Kim ,  Daegyeong Kim ,  Hojoon Lee

IPC: G06F21/52 ,  G06F21/57

Abstract: A memory alignment randomization method of a memory heap exploit is provided, memory alignment of objects inside a heap area is randomly performed to mitigate the exploits of the vulnerability of the software memory heap area The heap exploit is powerfully mitigated by aligning randomly obtained memory addresses instead of aligning memory addresses at multiples of 4 or 8 when the memory alignment for the objects inside the heap area.